Angelo Monti

Publication Activity (10 Years)

Years Active: 1991-2023
Publications (10 Years): 19

Top Topics

Extended Abstract

Positive Integer

Top Venues

Theor. Comput. Sci.

Publications

Angelo Monti, Blerina Sinaimeri
On Graphs that are not Star-k-PCGs (short paper). ICTCS (2023)
Angelo Monti, Blerina Sinaimeri
On Star-Multi-interval Pairwise Compatibility Graphs. WALCOM (2023)
Angelo Monti, Blerina Sinaimeri
On star-multi-interval pairwise compatibility graphs. CoRR (2022)
Tiziana Calamoneri, Angelo Monti, Blerina Sinaimeri
On the Domination Number of t-Constrained de Bruijn Graphs. ICTCS (2022)
Tiziana Calamoneri, Angelo Monti, Fabrizio Petroni
All Graphs with at most 8 nodes are 2-interval-PCGs. CoRR (2022)
Tiziana Calamoneri, Angelo Monti, Blerina Sinaimeri
On the domination number of $t$-constrained de Bruijn graphs. Discret. Math. Theor. Comput. Sci. 24 (2) (2022)
Tiziana Calamoneri, Angelo Monti, Blerina Sinaimeri
On Generalizations of Pairwise Compatibility Graphs. CoRR (2021)
Angelo Monti, Blerina Sinaimeri
String factorisations with maximum or minimum dimension. Theor. Comput. Sci. 842 (2020)
Pierluigi Baiocchi, Tiziana Calamoneri, Angelo Monti, Rossella Petreschi
Some classes of graphs that are not PCGs. Theor. Comput. Sci. 791 (2019)
Angelo Monti, Blerina Sinaimeri
String factorisations with maximum or minimum dimension. CoRR (2019)
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 (2019)
Pierluigi Baiocchi, Tiziana Calamoneri, Angelo Monti, Rossella Petreschi
Graphs that Are Not Pairwise Compatible: A New Proof Technique (Extended Abstract). IWOCA (2018)
János Körner, Angelo Monti
Families of locally separated Hamilton paths. J. Graph Theory 88 (3) (2018)
Angelo Monti, Blerina Sinaimeri
On variants of Vertex Geography on undirected graphs. Discret. Appl. Math. 251 (2018)
Tiziana Calamoneri, Angelo Monti, Rossella Petreschi
On dynamic threshold graphs and related classes. Theor. Comput. Sci. 718 (2018)
Pierluigi Baiocchi, Tiziana Calamoneri, Angelo Monti, Rossella Petreschi
Some classes of graphs that are not PCGs. CoRR (2017)
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)
Tiziana Calamoneri, Angelo Monti, Rossella Petreschi
Fully Dynamically Maintaining Minimal Integral Separator for Threshold and Difference Graphs. WALCOM (2016)
Tiziana Calamoneri, Angelo Monti, Rossella Petreschi
Dynamically Operating on Threshold Graphs and Related Classes (Extended Abstract). CTW (2015)
János Körner, Angelo Monti
Families of locally separated Hamilton paths. CoRR (2014)
Angelo Monti
Deciding the winner in k rounds for DISJOINT ARROWS, a new combinatorial partizan game. Theor. Comput. Sci. 513 (2013)
Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri
Fast flooding over Manhattan. Distributed Comput. 26 (1) (2013)
Andrea E. F. Clementi, Angelo Monti, Francesco Pasquale, Riccardo Silvestri
Optimal gossiping in geometric radio networks in the presence of dynamical faults. Networks 59 (3) (2012)
Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri
Modelling mobility: A discrete revolution. Ad Hoc Networks 9 (6) (2011)
Andrea E. F. Clementi, Angelo Monti, Francesco Pasquale, Riccardo Silvestri
Information Spreading in Stationary Markovian Evolving Graphs. IEEE Trans. Parallel Distributed Syst. 22 (9) (2011)
Andrea E. F. Clementi, Angelo Monti, Francesco Pasquale, Riccardo Silvestri
Information Spreading in Stationary Markovian Evolving Graphs CoRR (2011)
Angelo Monti, Blerina Sinaimeri
Rainbow graph splitting. Theor. Comput. Sci. 412 (39) (2011)
Zoltán Füredi, Ida Kantor, Angelo Monti, Blerina Sinaimeri
Reverse-free codes and permutations. Electron. Notes Discret. Math. 38 (2011)
Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri
Fast Flooding over Manhattan CoRR (2010)
Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri
Modelling Mobility: A Discrete Revolution CoRR (2010)
Zoltán Füredi, Ida Kantor, Angelo Monti, Blerina Sinaimeri
On Reverse-Free Codes and Permutations. SIAM J. Discret. Math. 24 (3) (2010)
Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri
Revolution. ICALP (2) (2010)
Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri
Fast flooding over Manhattan. PODC (2010)
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) (2010)
Andrea E. F. Clementi, Angelo Monti, Francesco Pasquale, Riccardo Silvestri
Broadcasting in dynamic radio networks. J. Comput. Syst. Sci. 75 (4) (2009)
Andrea E. F. Clementi, Angelo Monti, Francesco Pasquale, Riccardo Silvestri
Information spreading in stationary Markovian evolving graphs. IPDPS (2009)
Andrea E. F. Clementi, Claudio Macci, Angelo Monti, Francesco Pasquale, Riccardo Silvestri
Flooding time in edge-Markovian dynamic graphs. PODC (2008)
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 (2008)
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)
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) (2008)
Angelo Monti, Paolo Penna, Riccardo Silvestri
An Equivalent Version of the Caccetta-Häggkvist Conjecture in an Online Load Balancing Problem. WG (2007)
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) (2007)
Emanuele G. Fusco, Angelo Monti
Spanning Trees with Many Leaves in Regular Bipartite Graphs. ISAAC (2007)
Andrea E. F. Clementi, Angelo Monti, Francesco Pasquale, Riccardo Silvestri
Optimal Gossiping in Directed Geometric Radio Networks in Presence of Dynamical Faults. MFCS (2007)
Andrea E. F. Clementi, Francesco Pasquale, Angelo Monti, Riccardo Silvestri
Communication in dynamic radio networks. PODC (2007)
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)
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)
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)
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)
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)
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)
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) (2004)
Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri
Distributed broadcast in radio networks of unknown topology. Theor. Comput. Sci. 302 (1-3) (2003)
Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri
Optimal F-Reliable Protocols for the Do-All Problem on Single-Hop Wireless Networks. ISAAC (2002)
János Körner, Angelo Monti
Delta-Systems and Qualitative (In)Dependence. J. Comb. Theory, Ser. A 99 (1) (2002)
János Körner, Angelo Monti
Delta-systems and qualitative (in)dependence. Electron. Notes Discret. Math. 10 (2001)
Emanuela Fachini, János Körner, Angelo Monti
Self-Similarity Bounds for Locally Thin Set Families. Comb. Probab. Comput. 10 (4) (2001)
Emanuela Fachini, János Körner, Angelo Monti
A Better Bound for Locally Thin Set Families. J. Comb. Theory, Ser. A 95 (2) (2001)
Andrea E. F. Clementi, Pierluigi Crescenzi, Angelo Monti, Paolo Penna, Riccardo Silvestri
On Computing Ad-hoc Selective Families. RANDOM-APPROX (2001)
Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri
Distributed Broadcast in Wireless Networks with Unknown Topology CoRR (2001)
Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri
Selective families, superimposed codes, and broadcasting on unknown radio networks. SODA (2001)
Angelo Monti, Adriano Peron
Logical definability of Y-tree and trellis systolic omega-languages. Acta Cybern. 15 (1) (2001)
Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri
Distributed multi-broadcast in unknown radio networks. PODC (2001)
János Körner, Angelo Monti
Compact Representations of the Intersection Structure of Families of Finite Sets. SIAM J. Discret. Math. 14 (2) (2001)
Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri
Round Robin Is Optimal for Fault-Tolerant Broadcasting on Wireless Networks. ESA (2001)
Noga Alon, János Körner, Angelo Monti
String Quartets In Binary. Comb. Probab. Comput. 9 (5) (2000)
Angelo Monti, Adriano Peron
Systolic tree omega-Languages: the operational and the logical view. Theor. Comput. Sci. 233 (1-2) (2000)
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) (2000)
Vincenzo Auletta, Angelo Monti, Mimmo Parente, Pino Persiano
A Linear-Time Algorithm for the Feasibility of Pebble Motion on Trees. Algorithmica 23 (3) (1999)
Roberto De Prisco, Angelo Monti, Linda Pagli
Testing and Reconfiguration of VLSI Linear Arrays. Theor. Comput. Sci. 197 (1-2) (1998)
Angelo Monti, Adriano Peron
A Logical Characterization of Systolic Languages. STACS (1998)
Jozef Gruska, Angelo Monti, Margherita Napoli, Domenico Parente
Succinctness of Descriptions of SBTA-Languages. Theor. Comput. Sci. 179 (1-2) (1997)
Emanuela Fachini, Angelo Monti
Chomsky Hierarchy and Systolic Y-Tree Automata. Fundam. Informaticae 29 (4) (1997)
Angelo Monti
On the Computational Complexity of Graph Closures. Inf. Process. Lett. 57 (6) (1996)
Angelo Monti, Alessandro Roncato
A Gap Theorem for the Anonymous Torus. Inf. Process. Lett. 57 (5) (1996)
Vincenzo Auletta, Angelo Monti, Domenico Parente, Giuseppe Persiano
A Linear Time Algorithm for the Feasibility of Pebble Motion on Trees. SWAT (1996)
Angelo Monti, Adriano Peron
Systolic Tree Omega-Languages. STACS (1995)
Angelo Monti, Alessandro Roncato
Completeness Results Concerning Systolic Tree Automata and EOL Languages. Inf. Process. Lett. 53 (1) (1995)
Jozef Gruska, Angelo Monti, Margherita Napoli, Domenico Parente
State Complexity of SBTA Languages. LATIN (1995)
Paolo Ferragina, Angelo Monti, Alessandro Roncato
Trade-off Between Computational Power and Common Knowledge in Anonymous Rings. SIROCCO (1994)
Angelo Monti, Alessandro Roncato
On the Complexity of Some Reachability Problems. CIAC (1994)
Emanuela Fachini, Angelo Monti
A Kleene-like Characterization of Languages Accepted by Systolic Tree Automata. J. Comput. Syst. Sci. 49 (1) (1994)
Roberto De Prisco, Angelo Monti
On Reconfigurability of VLSI Linear Arrays. WADS (1993)
Emanuela Fachini, Angelo Monti, Margherita Napoli, Domenico Parente
Languages Accepted by Systolic Y-Tree Automata: Structural Characterizations. Acta Informatica 29 (8) (1992)
Emanuela Fachini, Angelo Monti, Margherita Napoli, Domenico Parente
Systolic Y-Tree Automata: Closure Properties and Decision Problems. FCT (1991)
Angelo Monti, Domenico Parente
Systolic Tree with Base Automata. Int. J. Found. Comput. Sci. 2 (3) (1991)