default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAngelo Monti
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[i13]Angelo Monti, Blerina Sinaimeri:
Disjoint covering of bipartite graphs with s-clubs. CoRR abs/2409.14783 (2024)- 2023
- [c34]Angelo Monti, Blerina Sinaimeri:
On Graphs that are not Star-k-PCGs (short paper). ICTCS 2023: 92-97 - [c33]Angelo Monti
, Blerina Sinaimeri:
On Star-Multi-interval Pairwise Compatibility Graphs. WALCOM 2023: 267-278 - 2022
- [j40]Tiziana Calamoneri, Angelo Monti, Blerina Sinaimeri:
On the domination number of $t$-constrained de Bruijn graphs. Discret. Math. Theor. Comput. Sci. 24(2) (2022) - [c32]Tiziana Calamoneri, Angelo Monti, Blerina Sinaimeri:
On the Domination Number of t-Constrained de Bruijn Graphs. ICTCS 2022: 34-39 - [i12]Tiziana Calamoneri, Angelo Monti, Fabrizio Petroni:
All Graphs with at most 8 nodes are 2-interval-PCGs. CoRR abs/2202.13844 (2022) - [i11]Angelo Monti, Blerina Sinaimeri:
On star-multi-interval pairwise compatibility graphs. CoRR abs/2209.11860 (2022) - 2021
- [i10]Tiziana Calamoneri, Angelo Monti, Blerina Sinaimeri:
On Generalizations of Pairwise Compatibility Graphs. CoRR abs/2112.08503 (2021) - 2020
- [j39]Angelo Monti, Blerina Sinaimeri:
String factorisations with maximum or minimum dimension. Theor. Comput. Sci. 842: 65-73 (2020)
2010 – 2019
- 2019
- [j38]Tiziana Calamoneri, Matteo Dell'Orefice, Angelo Monti:
A simple linear time algorithm for the locally connected spanning tree problem on maximal planar chordal graphs. Theor. Comput. Sci. 764: 2-14 (2019) - [j37]Pierluigi Baiocchi, Tiziana Calamoneri, Angelo Monti, Rossella Petreschi:
Some classes of graphs that are not PCGs. Theor. Comput. Sci. 791: 62-75 (2019) - [i9]Angelo Monti, Blerina Sinaimeri:
String factorisations with maximum or minimum dimension. CoRR abs/1912.10140 (2019) - 2018
- [j36]Angelo Monti, Blerina Sinaimeri:
On variants of Vertex Geography on undirected graphs. Discret. Appl. Math. 251: 268-275 (2018) - [j35]János Körner, Angelo Monti:
Families of locally separated Hamilton paths. J. Graph Theory 88(3): 402-410 (2018) - [j34]Tiziana Calamoneri, Angelo Monti, Rossella Petreschi:
On dynamic threshold graphs and related classes. Theor. Comput. Sci. 718: 46-57 (2018) - [c31]Pierluigi Baiocchi, Tiziana Calamoneri, Angelo Monti, Rossella Petreschi:
Graphs that Are Not Pairwise Compatible: A New Proof Technique (Extended Abstract). IWOCA 2018: 39-51 - 2017
- [i8]Pierluigi Baiocchi, Tiziana Calamoneri, Angelo Monti, Rossella Petreschi:
Some classes of graphs that are not PCGs. CoRR abs/1707.07436 (2017) - 2016
- [c30]Tiziana Calamoneri, Matteo Dell'Orefice, Angelo Monti:
A Locally Connected Spanning Tree Can Be Found in Polynomial Time on Simple Clique 3-Trees. ICTCS 2016: 103-121 - [c29]Tiziana Calamoneri, Angelo Monti, Rossella Petreschi:
Fully Dynamically Maintaining Minimal Integral Separator for Threshold and Difference Graphs. WALCOM 2016: 313-324 - 2015
- [i7]Tiziana Calamoneri, Angelo Monti, Rossella Petreschi:
Dynamically Operating on Threshold Graphs and Related Classes (Extended Abstract). CTW 2015: 20-23 - 2014
- [i6]János Körner, Angelo Monti:
Families of locally separated Hamilton paths. CoRR abs/1411.3902 (2014) - 2013
- [j33]Andrea Clementi, Angelo Monti, Riccardo Silvestri:
Fast flooding over Manhattan. Distributed Comput. 26(1): 25-38 (2013) - [j32]Angelo Monti:
Deciding the winner in k rounds for DISJOINT ARROWS, a new combinatorial partizan game. Theor. Comput. Sci. 513: 96-108 (2013) - 2012
- [j31]Andrea Clementi, Angelo Monti, Francesco Pasquale, Riccardo Silvestri:
Optimal gossiping in geometric radio networks in the presence of dynamical faults. Networks 59(3): 289-298 (2012) - 2011
- [j30]Andrea Clementi, Angelo Monti, Riccardo Silvestri:
Modelling mobility: A discrete revolution. Ad Hoc Networks 9(6): 998-1014 (2011) - [j29]Zoltán Füredi, Ida Kantor, Angelo Monti, Blerina Sinaimeri:
Reverse-free codes and permutations. Electron. Notes Discret. Math. 38: 383-387 (2011) - [j28]Angelo Monti, Blerina Sinaimeri:
Rainbow graph splitting. Theor. Comput. Sci. 412(39): 5315-5324 (2011) - [j27]Andrea Clementi, Angelo Monti, Francesco Pasquale, Riccardo Silvestri:
Information Spreading in Stationary Markovian Evolving Graphs. IEEE Trans. Parallel Distributed Syst. 22(9): 1425-1432 (2011) - [i5]Andrea Clementi, Angelo Monti, Francesco Pasquale, Riccardo Silvestri:
Information Spreading in Stationary Markovian Evolving Graphs. CoRR abs/1103.0741 (2011) - 2010
- [j26]Zoltán Füredi, Ida Kantor, Angelo Monti, Blerina Sinaimeri:
On Reverse-Free Codes and Permutations. SIAM J. Discret. Math. 24(3): 964-978 (2010) - [j25]Andrea E. F. Clementi, Claudio Macci, Angelo Monti, Francesco Pasquale, Riccardo Silvestri:
Flooding Time of Edge-Markovian Evolving Graphs. SIAM J. Discret. Math. 24(4): 1694-1712 (2010) - [c28]Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri:
Modelling Mobility: A Discrete Revolution. ICALP (2) 2010: 490-501 - [c27]Andrea Clementi, Angelo Monti, Riccardo Silvestri:
Fast flooding over Manhattan. PODC 2010: 375-383 - [i4]Andrea Clementi, Angelo Monti, Riccardo Silvestri:
Modelling Mobility: A Discrete Revolution. CoRR abs/1002.1016 (2010) - [i3]Andrea Clementi, Angelo Monti, Riccardo Silvestri:
Fast Flooding over Manhattan. CoRR abs/1002.3757 (2010)
2000 – 2009
- 2009
- [j24]Andrea E. F. Clementi, Angelo Monti, Francesco Pasquale, Riccardo Silvestri:
Broadcasting in dynamic radio networks. J. Comput. Syst. Sci. 75(4): 213-230 (2009) - [c26]Andrea E. F. Clementi, Angelo Monti, Francesco Pasquale, Riccardo Silvestri:
Information spreading in stationary Markovian evolving graphs. IPDPS 2009: 1-12 - 2008
- [j23]Tiziana Calamoneri, Andrea E. F. Clementi, Miriam Di Ianni, Massimo Lauria, Angelo Monti, Riccardo Silvestri:
Minimum-Energy Broadcast and disk cover in grid wireless networks. Theor. Comput. Sci. 399(1-2): 38-53 (2008) - [c25]Tiziana Calamoneri, Andrea E. F. Clementi, Angelo Monti, Gianluca Rossi, Riccardo Silvestri:
Minimum-energy broadcast in random-grid ad-hoc networks: approximation and distributed algorithms. MSWiM 2008: 354-361 - [c24]Andrea E. F. Clementi, Claudio Macci, Angelo Monti, Francesco Pasquale, Riccardo Silvestri:
Flooding time in edge-Markovian dynamic graphs. PODC 2008: 213-222 - [i2]Tiziana Calamoneri, Andrea E. F. Clementi, Angelo Monti, Gianluca Rossi, Riccardo Silvestri:
Minimum-energy broadcast in random-grid ad-hoc networks: approximation and distributed algorithms. CoRR abs/0804.3902 (2008) - 2007
- [j22]Andrea E. F. Clementi, Miriam Di Ianni, Massimo Lauria, Angelo Monti, Gianluca Rossi, Riccardo Silvestri:
On the bounded-hop MST problem on random Euclidean instances. Theor. Comput. Sci. 384(2-3): 161-167 (2007) - [c23]Emanuele G. Fusco, Angelo Monti:
Spanning Trees with Many Leaves in Regular Bipartite Graphs. ISAAC 2007: 904-914 - [c22]Andrea E. F. Clementi, Angelo Monti, Francesco Pasquale, Riccardo Silvestri:
Optimal Gossiping in Directed Geometric Radio Networks in Presence of Dynamical Faults. MFCS 2007: 430-441 - [c21]Andrea E. F. Clementi, Francesco Pasquale, Angelo Monti, Riccardo Silvestri:
Communication in dynamic radio networks. PODC 2007: 205-214 - [c20]Angelo Monti, Paolo Penna, Riccardo Silvestri:
An Equivalent Version of the Caccetta-Häggkvist Conjecture in an Online Load Balancing Problem. WG 2007: 154-165 - 2006
- [c19]Andrea E. F. Clementi, Miriam Di Ianni, Massimo Lauria, Angelo Monti, Gianluca Rossi, Riccardo Silvestri:
A Distributed Protocol for the Bounded-Hops Converge-Cast in Ad-Hoc Networks. ADHOC-NOW 2006: 60-72 - [c18]Tiziana Calamoneri, Andrea E. F. Clementi, Miriam Di Ianni, Massimo Lauria, Angelo Monti, Riccardo Silvestri:
Minimum Energy Broadcast and Disk Cover in Grid Wireless Networks. SIROCCO 2006: 227-239 - 2005
- [c17]Andrea E. F. Clementi, Miriam Di Ianni, Angelo Monti, Gianluca Rossi, Riccardo Silvestri:
Experimental Analysis of Practically Efficient Algorithms for Bounded-Hop Accumulation in Ad-Hoc Wireless Networks. IPDPS 2005 - [c16]Andrea E. F. Clementi, Miriam Di Ianni, Angelo Monti, Massimo Lauria, Gianluca Rossi, Riccardo Silvestri:
Divide and Conquer Is Almost Optimal for the Bounded-Hop MST Problem on Random Euclidean Instances. SIROCCO 2005: 89-98 - 2004
- [j21]Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri:
Round Robin is optimal for fault-tolerant broadcasting on wireless networks. J. Parallel Distributed Comput. 64(1): 89-96 (2004) - [c15]Christoph Ambühl, Andrea E. F. Clementi, Miriam Di Ianni, Gianluca Rossi, Angelo Monti, Riccardo Silvestri:
The Range Assignment Problem in Non-Homogeneous Static Ad-Hoc Networks. IPDPS 2004 - [c14]Christoph Ambühl, Andrea E. F. Clementi, Miriam Di Ianni, Nissan Lev-Tov, Angelo Monti, David Peleg, Gianluca Rossi, Riccardo Silvestri:
Efficient Algorithms for Low-Energy Bounded-Hop Broadcast in Ad-Hoc Wireless Networks. STACS 2004: 418-427 - 2003
- [j20]Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri:
Distributed broadcast in radio networks of unknown topology. Theor. Comput. Sci. 302(1-3): 337-364 (2003) - 2002
- [j19]János Körner, Angelo Monti:
Delta-Systems and Qualitative (In)Dependence. J. Comb. Theory A 99(1): 75-84 (2002) - [c13]Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri:
Optimal F-Reliable Protocols for the Do-All Problem on Single-Hop Wireless Networks. ISAAC 2002: 320-331 - 2001
- [j18]Angelo Monti, Adriano Peron:
Logical definability of Y-tree and trellis systolic omega-languages. Acta Cybern. 15(1): 75-100 (2001) - [j17]Emanuela Fachini, János Körner, Angelo Monti:
Self-Similarity Bounds for Locally Thin Set Families. Comb. Probab. Comput. 10(4): 309-315 (2001) - [j16]János Körner, Angelo Monti:
Delta-systems and qualitative (in)dependence. Electron. Notes Discret. Math. 10: 160-163 (2001) - [j15]Emanuela Fachini, János Körner, Angelo Monti:
A Better Bound for Locally Thin Set Families. J. Comb. Theory A 95(2): 209-218 (2001) - [j14]János Körner, Angelo Monti:
Compact Representations of the Intersection Structure of Families of Finite Sets. SIAM J. Discret. Math. 14(2): 181-192 (2001) - [c12]Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri:
Round Robin Is Optimal for Fault-Tolerant Broadcasting on Wireless Networks. ESA 2001: 452-463 - [c11]Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri:
Distributed multi-broadcast in unknown radio networks. PODC 2001: 255-264 - [c10]Andrea E. F. Clementi, Pierluigi Crescenzi, Angelo Monti, Paolo Penna, Riccardo Silvestri:
On Computing Ad-hoc Selective Families. RANDOM-APPROX 2001: 211-222 - [c9]Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri:
Selective families, superimposed codes, and broadcasting on unknown radio networks. SODA 2001: 709-718 - [i1]Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri:
Distributed Broadcast in Wireless Networks with Unknown Topology. CoRR cs.DS/0107011 (2001) - 2000
- [j13]Noga Alon, János Körner, Angelo Monti:
String Quartets In Binary. Comb. Probab. Comput. 9(5): 381-390 (2000) - [j12]Angelo Monti, Adriano Peron:
Systolic tree omega-Languages: the operational and the logical view. Theor. Comput. Sci. 233(1-2): 1-18 (2000) - [j11]G. Bongiovanni, Giuseppe A. De Biase, Annalisa Massini, Angelo Monti:
The Shuffled Mesh: a flexible and efficient model for parallel computing. Telecommun. Syst. 13(1): 21-27 (2000)
1990 – 1999
- 1999
- [j10]Vincenzo Auletta, Angelo Monti, Mimmo Parente, Pino Persiano:
A Linear-Time Algorithm for the Feasibility of Pebble Motion on Trees. Algorithmica 23(3): 223-245 (1999) - 1998
- [j9]Roberto De Prisco, Angelo Monti, Linda Pagli:
Testing and Reconfiguration of VLSI Linear Arrays. Theor. Comput. Sci. 197(1-2): 171-188 (1998) - [c8]Angelo Monti, Adriano Peron:
A Logical Characterization of Systolic Languages. STACS 1998: 466-476 - 1997
- [j8]Emanuela Fachini, Angelo Monti:
Chomsky Hierarchy and Systolic Y-Tree Automata. Fundam. Informaticae 29(4): 325-339 (1997) - [j7]Jozef Gruska, Angelo Monti, Margherita Napoli, Domenico Parente:
Succinctness of Descriptions of SBTA-Languages. Theor. Comput. Sci. 179(1-2): 251-271 (1997) - 1996
- [j6]Angelo Monti, Alessandro Roncato:
A Gap Theorem for the Anonymous Torus. Inf. Process. Lett. 57(5): 279-285 (1996) - [j5]Angelo Monti:
On the Computational Complexity of Graph Closures. Inf. Process. Lett. 57(6): 291-295 (1996) - [c7]Vincenzo Auletta, Angelo Monti, Domenico Parente, Giuseppe Persiano:
A Linear Time Algorithm for the Feasibility of Pebble Motion on Trees. SWAT 1996: 259-270 - 1995
- [j4]Angelo Monti, Alessandro Roncato:
Completeness Results Concerning Systolic Tree Automata and EOL Languages. Inf. Process. Lett. 53(1): 11-16 (1995) - [c6]Jozef Gruska, Angelo Monti, Margherita Napoli, Domenico Parente:
State Complexity of SBTA Languages. LATIN 1995: 346-357 - [c5]Angelo Monti, Adriano Peron:
Systolic Tree Omega-Languages. STACS 1995: 131-142 - 1994
- [j3]Emanuela Fachini, Angelo Monti:
A Kleene-like Characterization of Languages Accepted by Systolic Tree Automata. J. Comput. Syst. Sci. 49(1): 133-147 (1994) - [c4]Angelo Monti, Alessandro Roncato:
On the Complexity of Some Reachability Problems. CIAC 1994: 192-202 - [c3]Paolo Ferragina, Angelo Monti, Alessandro Roncato:
Trade-off Between Computational Power and Common Knowledge in Anonymous Rings. SIROCCO 1994: 35-48 - 1993
- [c2]Roberto De Prisco, Angelo Monti:
On Reconfigurability of VLSI Linear Arrays. WADS 1993: 553-564 - 1992
- [j2]Emanuela Fachini, Angelo Monti, Margherita Napoli, Domenico Parente:
Languages Accepted by Systolic Y-Tree Automata: Structural Characterizations. Acta Informatica 29(8): 761-778 (1992) - 1991
- [j1]Angelo Monti, Domenico Parente:
Systolic Tree with Base Automata. Int. J. Found. Comput. Sci. 2(3): 221-236 (1991) - [c1]Emanuela Fachini, Angelo Monti, Margherita Napoli, Domenico Parente:
Systolic Y-Tree Automata: Closure Properties and Decision Problems. FCT 1991: 210-219
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-16 21:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
