Angelo Monti

93 papers A* 5A 8B 12C 3Journal 57Unranked 8
YearRankTypeTitle / Venue / Authors
2025 J jnl
All Graphs with at Most 8 Nodes are 2-interval-PCGs.
Fundam. Informaticae
Tiziana Calamoneri, Angelo Monti, Fabrizio Petroni
2025 — conf
Disjoint Covering of Bipartite Graphs with s-clubs.
SOFSEM (2)
Angelo Monti, Blerina Sinaimeri
2025 J jnl
Effects of graph operations on star pairwise compatibility graphs.
Comput. J.
Angelo Monti, Blerina Sinaimeri
2025 J jnl
On star-k-PCGs: exploring class boundaries for small k values.
Acta Informatica
Angelo Monti, Blerina Sinaimeri
2024 J jnl
Disjoint covering of bipartite graphs with
CoRR
Angelo Monti, Blerina Sinaimeri
2024 J jnl
Effects of graph operations on star pairwise compatibility graphs.
CoRR
Angelo Monti, Blerina Sinaimeri
2024 J jnl
On Generalizations of Pairwise Compatibility Graphs.
Discret. Math. Theor. Comput. Sci.
Tiziana Calamoneri, Manuel Lafond, Angelo Monti, Blerina Sinaimeri
2023 — conf
On Graphs that are not Star-k-PCGs (short paper).
ICTCS
Angelo Monti, Blerina Sinaimeri
2023 B conf
On Star-Multi-interval Pairwise Compatibility Graphs.
WALCOM
Angelo Monti, Blerina Sinaimeri
2022 J jnl
All Graphs with at most 8 nodes are 2-interval-PCGs.
CoRR
Tiziana Calamoneri, Angelo Monti, Fabrizio Petroni
2022 J jnl
On star-multi-interval pairwise compatibility graphs.
CoRR
Angelo Monti, Blerina Sinaimeri
2022 — conf
On the Domination Number of t-Constrained de Bruijn Graphs.
ICTCS
Tiziana Calamoneri, Angelo Monti, Blerina Sinaimeri
2022 J jnl
On the domination number of $t$-constrained de Bruijn graphs.
Discret. Math. Theor. Comput. Sci.
Tiziana Calamoneri, Angelo Monti, Blerina Sinaimeri
2021 J jnl
On Generalizations of Pairwise Compatibility Graphs.
CoRR
Tiziana Calamoneri, Angelo Monti, Blerina Sinaimeri
2020 J jnl
String factorisations with maximum or minimum dimension.
Theor. Comput. Sci.
Angelo Monti, Blerina Sinaimeri
2019 J jnl
A simple linear time algorithm for the locally connected spanning tree problem on maximal planar chordal graphs.
Theor. Comput. Sci.
Tiziana Calamoneri, Matteo Dell'Orefice, Angelo Monti
2019 J jnl
Some classes of graphs that are not PCGs.
Theor. Comput. Sci.
Pierluigi Baiocchi, Tiziana Calamoneri, Angelo Monti, Rossella Petreschi
2019 J jnl
String factorisations with maximum or minimum dimension.
CoRR
Angelo Monti, Blerina Sinaimeri
2018 J jnl
Families of locally separated Hamilton paths.
J. Graph Theory
János Körner, Angelo Monti
2018 C conf
Graphs that Are Not Pairwise Compatible: A New Proof Technique (Extended Abstract).
IWOCA
Pierluigi Baiocchi, Tiziana Calamoneri, Angelo Monti, Rossella Petreschi
2018 J jnl
On dynamic threshold graphs and related classes.
Theor. Comput. Sci.
Tiziana Calamoneri, Angelo Monti, Rossella Petreschi
2018 J jnl
On variants of Vertex Geography on undirected graphs.
Discret. Appl. Math.
Angelo Monti, Blerina Sinaimeri
2017 J jnl
Some classes of graphs that are not PCGs.
CoRR
Pierluigi Baiocchi, Tiziana Calamoneri, Angelo Monti, Rossella Petreschi
2016 — conf
A Locally Connected Spanning Tree Can Be Found in Polynomial Time on Simple Clique 3-Trees.
ICTCS
Tiziana Calamoneri, Matteo Dell'Orefice, Angelo Monti
2016 B conf
Fully Dynamically Maintaining Minimal Integral Separator for Threshold and Difference Graphs.
WALCOM
Tiziana Calamoneri, Angelo Monti, Rossella Petreschi
2015 C conf
Dynamically Operating on Threshold Graphs and Related Classes (Extended Abstract).
CTW
Tiziana Calamoneri, Angelo Monti, Rossella Petreschi
2014 J jnl
Families of locally separated Hamilton paths.
CoRR
János Körner, Angelo Monti
2013 J jnl
Deciding the winner in k rounds for DISJOINT ARROWS, a new combinatorial partizan game.
Theor. Comput. Sci.
Angelo Monti
2013 J jnl
Fast flooding over Manhattan.
Distributed Comput.
Andrea Clementi, Angelo Monti, Riccardo Silvestri
2012 J jnl
Optimal gossiping in geometric radio networks in the presence of dynamical faults.
Networks
Andrea Clementi, Angelo Monti, Francesco Pasquale, Riccardo Silvestri
2011 J jnl
Information Spreading in Stationary Markovian Evolving Graphs
CoRR
Andrea Clementi, Angelo Monti, Francesco Pasquale, Riccardo Silvestri
2011 J jnl
Information Spreading in Stationary Markovian Evolving Graphs.
IEEE Trans. Parallel Distributed Syst.
Andrea Clementi, Angelo Monti, Francesco Pasquale, Riccardo Silvestri
2011 J jnl
Modelling mobility: A discrete revolution.
Ad Hoc Networks
Andrea Clementi, Angelo Monti, Riccardo Silvestri
2011 J jnl
Rainbow graph splitting.
Theor. Comput. Sci.
Angelo Monti, Blerina Sinaimeri
2011 J jnl
Reverse-free codes and permutations.
Electron. Notes Discret. Math.
Zoltán Füredi, Ida Kantor, Angelo Monti, Blerina Sinaimeri
2010 J jnl
Fast Flooding over Manhattan
CoRR
Andrea Clementi, Angelo Monti, Riccardo Silvestri
2010 A* conf
Fast flooding over Manhattan.
PODC
Andrea Clementi, Angelo Monti, Riccardo Silvestri
2010 J jnl
Flooding Time of Edge-Markovian Evolving Graphs.
SIAM J. Discret. Math.
Andrea E. F. Clementi, Claudio Macci, Angelo Monti, Francesco Pasquale, Riccardo Silvestri
2010 — conf
Modelling Mobility: A
ICALP (2)
Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri
2010 J jnl
Modelling Mobility: A Discrete Revolution
CoRR
Andrea Clementi, Angelo Monti, Riccardo Silvestri
2010 J jnl
On Reverse-Free Codes and Permutations.
SIAM J. Discret. Math.
Zoltán Füredi, Ida Kantor, Angelo Monti, Blerina Sinaimeri
2009 J jnl
Broadcasting in dynamic radio networks.
J. Comput. Syst. Sci.
Andrea E. F. Clementi, Angelo Monti, Francesco Pasquale, Riccardo Silvestri
2009 A conf
Information spreading in stationary Markovian evolving graphs.
IPDPS
Andrea E. F. Clementi, Angelo Monti, Francesco Pasquale, Riccardo Silvestri
2008 A* conf
Flooding time in edge-Markovian dynamic graphs.
PODC
Andrea E. F. Clementi, Claudio Macci, Angelo Monti, Francesco Pasquale, Riccardo Silvestri
2008 J jnl
Minimum-Energy Broadcast and disk cover in grid wireless networks.
Theor. Comput. Sci.
Tiziana Calamoneri, Andrea E. F. Clementi, Miriam Di Ianni, Massimo Lauria, Angelo Monti, Riccardo Silvestri
2008 J jnl
Minimum-energy broadcast in random-grid ad-hoc networks: approximation and distributed algorithms
CoRR
Tiziana Calamoneri, Andrea E. F. Clementi, Angelo Monti, Gianluca Rossi, Riccardo Silvestri
2008 A conf
Minimum-energy broadcast in random-grid ad-hoc networks: approximation and distributed algorithms.
MSWiM
Tiziana Calamoneri, Andrea E. F. Clementi, Angelo Monti, Gianluca Rossi, Riccardo Silvestri
2007 B conf
An Equivalent Version of the Caccetta-Häggkvist Conjecture in an Online Load Balancing Problem.
WG
Angelo Monti, Paolo Penna, Riccardo Silvestri
2007 A* conf
Communication in dynamic radio networks.
PODC
Andrea E. F. Clementi, Francesco Pasquale, Angelo Monti, Riccardo Silvestri
2007 J jnl
On the bounded-hop MST problem on random Euclidean instances.
Theor. Comput. Sci.
Andrea E. F. Clementi, Miriam Di Ianni, Massimo Lauria, Angelo Monti, Gianluca Rossi, Riccardo Silvestri
2007 B conf
Optimal Gossiping in Directed Geometric Radio Networks in Presence of Dynamical Faults.
MFCS
Andrea E. F. Clementi, Angelo Monti, Francesco Pasquale, Riccardo Silvestri
2007 B conf
Spanning Trees with Many Leaves in Regular Bipartite Graphs.
ISAAC
Emanuele G. Fusco, Angelo Monti
2006 — conf
A Distributed Protocol for the Bounded-Hops Converge-Cast in Ad-Hoc Networks.
ADHOC-NOW
Andrea E. F. Clementi, Miriam Di Ianni, Massimo Lauria, Angelo Monti, Gianluca Rossi, Riccardo Silvestri
2006 B conf
Minimum Energy Broadcast and Disk Cover in Grid Wireless Networks.
SIROCCO
Tiziana Calamoneri, Andrea E. F. Clementi, Miriam Di Ianni, Massimo Lauria, Angelo Monti, Riccardo Silvestri
2005 B conf
Divide and Conquer Is Almost Optimal for the Bounded-Hop MST Problem on Random Euclidean Instances.
SIROCCO
Andrea E. F. Clementi, Miriam Di Ianni, Angelo Monti, Massimo Lauria, Gianluca Rossi, Riccardo Silvestri
2005 A conf
Experimental Analysis of Practically Efficient Algorithms for Bounded-Hop Accumulation in Ad-Hoc Wireless Networks.
IPDPS
Andrea E. F. Clementi, Miriam Di Ianni, Angelo Monti, Gianluca Rossi, Riccardo Silvestri
2004 A conf
Efficient Algorithms for Low-Energy Bounded-Hop Broadcast in Ad-Hoc Wireless Networks.
STACS
Christoph Ambühl, Andrea E. F. Clementi, Miriam Di Ianni, Nissan Lev-Tov, Angelo Monti, David Peleg, Gianluca Rossi, Riccardo Silvestri
2004 J jnl
Round Robin is optimal for fault-tolerant broadcasting on wireless networks.
J. Parallel Distributed Comput.
Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri
2004 A conf
The Range Assignment Problem in Non-Homogeneous Static Ad-Hoc Networks.
IPDPS
Christoph Ambühl, Andrea E. F. Clementi, Miriam Di Ianni, Gianluca Rossi, Angelo Monti, Riccardo Silvestri
2003 J jnl
Distributed broadcast in radio networks of unknown topology.
Theor. Comput. Sci.
Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri
2002 J jnl
Delta-Systems and Qualitative (In)Dependence.
J. Comb. Theory A
János Körner, Angelo Monti
2002 B conf
Optimal F-Reliable Protocols for the Do-All Problem on Single-Hop Wireless Networks.
ISAAC
Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri
2001 J jnl
A Better Bound for Locally Thin Set Families.
J. Comb. Theory A
Emanuela Fachini, János Körner, Angelo Monti
2001 J jnl
Compact Representations of the Intersection Structure of Families of Finite Sets.
SIAM J. Discret. Math.
János Körner, Angelo Monti
2001 J jnl
Delta-systems and qualitative (in)dependence.
Electron. Notes Discret. Math.
János Körner, Angelo Monti
2001 J jnl
Distributed Broadcast in Wireless Networks with Unknown Topology
CoRR
Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri
2001 A* conf
Distributed multi-broadcast in unknown radio networks.
PODC
Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri
2001 J jnl
Logical definability of Y-tree and trellis systolic omega-languages.
Acta Cybern.
Angelo Monti, Adriano Peron
2001 — conf
On Computing Ad-hoc Selective Families.
RANDOM-APPROX
Andrea E. F. Clementi, Pierluigi Crescenzi, Angelo Monti, Paolo Penna, Riccardo Silvestri
2001 A conf
Round Robin Is Optimal for Fault-Tolerant Broadcasting on Wireless Networks.
ESA
Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri
2001 A* conf
Selective families, superimposed codes, and broadcasting on unknown radio networks.
SODA
Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri
2001 J jnl
Self-Similarity Bounds for Locally Thin Set Families.
Comb. Probab. Comput.
Emanuela Fachini, János Körner, Angelo Monti
2000 J jnl
String Quartets In Binary.
Comb. Probab. Comput.
Noga Alon, János Körner, Angelo Monti
2000 J jnl
Systolic tree omega-Languages: the operational and the logical view.
Theor. Comput. Sci.
Angelo Monti, Adriano Peron
2000 J jnl
The Shuffled Mesh: a flexible and efficient model for parallel computing.
Telecommun. Syst.
G. Bongiovanni, Giuseppe A. De Biase, Annalisa Massini, Angelo Monti
1999 J jnl
A Linear-Time Algorithm for the Feasibility of Pebble Motion on Trees.
Algorithmica
Vincenzo Auletta, Angelo Monti, Mimmo Parente, Pino Persiano
1998 A conf
A Logical Characterization of Systolic Languages.
STACS
Angelo Monti, Adriano Peron
1998 J jnl
Testing and Reconfiguration of VLSI Linear Arrays.
Theor. Comput. Sci.
Roberto De Prisco, Angelo Monti, Linda Pagli
1997 J jnl
Chomsky Hierarchy and Systolic Y-Tree Automata.
Fundam. Informaticae
Emanuela Fachini, Angelo Monti
1997 J jnl
Succinctness of Descriptions of SBTA-Languages.
Theor. Comput. Sci.
Jozef Gruska, Angelo Monti, Margherita Napoli, Domenico Parente
1996 J jnl
A Gap Theorem for the Anonymous Torus.
Inf. Process. Lett.
Angelo Monti, Alessandro Roncato
1996 — conf
A Linear Time Algorithm for the Feasibility of Pebble Motion on Trees.
SWAT
Vincenzo Auletta, Angelo Monti, Domenico Parente, Giuseppe Persiano
1996 J jnl
On the Computational Complexity of Graph Closures.
Inf. Process. Lett.
Angelo Monti
1995 J jnl
Completeness Results Concerning Systolic Tree Automata and EOL Languages.
Inf. Process. Lett.
Angelo Monti, Alessandro Roncato
1995 B conf
State Complexity of SBTA Languages.
LATIN
Jozef Gruska, Angelo Monti, Margherita Napoli, Domenico Parente
1995 A conf
Systolic Tree Omega-Languages.
STACS
Angelo Monti, Adriano Peron
1994 J jnl
A Kleene-like Characterization of Languages Accepted by Systolic Tree Automata.
J. Comput. Syst. Sci.
Emanuela Fachini, Angelo Monti
1994 C conf
On the Complexity of Some Reachability Problems.
CIAC
Angelo Monti, Alessandro Roncato
1994 B conf
Trade-off Between Computational Power and Common Knowledge in Anonymous Rings.
SIROCCO
Paolo Ferragina, Angelo Monti, Alessandro Roncato
1993 B conf
On Reconfigurability of VLSI Linear Arrays.
WADS
Roberto De Prisco, Angelo Monti
1992 J jnl
Languages Accepted by Systolic Y-Tree Automata: Structural Characterizations.
Acta Informatica
Emanuela Fachini, Angelo Monti, Margherita Napoli, Domenico Parente
1991 J jnl
Systolic Tree with Base Automata.
Int. J. Found. Comput. Sci.
Angelo Monti, Domenico Parente
1991 B conf
Systolic Y-Tree Automata: Closure Properties and Decision Problems.
FCT
Emanuela Fachini, Angelo Monti, Margherita Napoli, Domenico Parente