Systolic Y-Tree Automata: Closure Properties and Decision Problems. - Emanuela Fachini; Angelo Monti; Margherita Napoli; Domenico Parente (FCT, 1991)

Systolic Tree with Base Automata. - Angelo Monti; Domenico Parente (Int. J. Found. Comput. Sci., 1991)

Languages Accepted by Systolic Y-Tree Automata: Structural Characterizations. - Emanuela Fachini; Angelo Monti; Margherita Napoli; Domenico Parente (Acta Informatica, 1992)

On Reconfigurability of VLSI Linear Arrays. - Roberto De Prisco; Angelo Monti (WADS, 1993)

On the Complexity of Some Reachability Problems. - Angelo Monti; Alessandro Roncato (CIAC, 1994)

Trade-off Between Computational Power and Common Knowledge in Anonymous Rings. - Paolo Ferragina; Angelo Monti; Alessandro Roncato (SIROCCO, 1994)

A Kleene-like Characterization of Languages Accepted by Systolic Tree Automata. - Emanuela Fachini; Angelo Monti (J. Comput. Syst. Sci., 1994)

State Complexity of SBTA Languages. - Jozef Gruska; Angelo Monti; Margherita Napoli; Domenico Parente (LATIN, 1995)

Systolic Tree Omega-Languages. - Angelo Monti; Adriano Peron (STACS, 1995)

Completeness Results Concerning Systolic Tree Automata and EOL Languages. - Angelo Monti; Alessandro Roncato (Inf. Process. Lett., 1995)

On the Computational Complexity of Graph Closures. - Angelo Monti (Inf. Process. Lett., 1996)

A Gap Theorem for the Anonymous Torus. - Angelo Monti; Alessandro Roncato (Inf. Process. Lett., 1996)

Chomsky Hierarchy and Systolic Y-Tree Automata. - Emanuela Fachini; Angelo Monti (Fundam. Informaticae, 1997)

Succinctness of Descriptions of SBTA-Languages. - Jozef Gruska; Angelo Monti; Margherita Napoli; Domenico Parente (Theor. Comput. Sci., 1997)

A Logical Characterization of Systolic Languages. - Angelo Monti; Adriano Peron (STACS, 1998)

Testing and Reconfiguration of VLSI Linear Arrays. - Roberto De Prisco; Angelo Monti; Linda Pagli (Theor. Comput. Sci., 1998)

A Linear-Time Algorithm for the Feasibility of Pebble Motion on Trees. - Vincenzo Auletta; Angelo Monti; Mimmo Parente; Pino Persiano (Algorithmica, 1999)

String Quartets In Binary. - Noga Alon; János Körner; Angelo Monti (Comb. Probab. Comput., 2000)

Systolic tree omega-Languages: the operational and the logical view. - Angelo Monti; Adriano Peron (Theor. Comput. Sci., 2000)

The Shuffled Mesh: a flexible and efficient model for parallel computing. - G. Bongiovanni; Giuseppe A. De Biase; Annalisa Massini; Angelo Monti (Telecommun. Syst., 2000)

Distributed multi-broadcast in unknown radio networks. - Andrea E. F. Clementi; Angelo Monti; Riccardo Silvestri (PODC, 2001)

On Computing Ad-hoc Selective Families. - Andrea E. F. Clementi; Pierluigi Crescenzi; Angelo Monti; Paolo Penna; Riccardo Silvestri (RANDOM-APPROX, 2001)

Selective families, superimposed codes, and broadcasting on unknown radio networks. - Andrea E. F. Clementi; Angelo Monti; Riccardo Silvestri (SODA, 2001)

Logical definability of Y-tree and trellis systolic omega-languages. - Angelo Monti; Adriano Peron (Acta Cybern., 2001)

Distributed Broadcast in Wireless Networks with Unknown Topology - Andrea E. F. Clementi; Angelo Monti; Riccardo Silvestri (CoRR, 2001)

Self-Similarity Bounds for Locally Thin Set Families. - Emanuela Fachini; János Körner; Angelo Monti (Comb. Probab. Comput., 2001)

A Better Bound for Locally Thin Set Families. - Emanuela Fachini; János Körner; Angelo Monti (J. Comb. Theory A, 2001)

Compact Representations of the Intersection Structure of Families of Finite Sets. - János Körner; Angelo Monti (SIAM J. Discret. Math., 2001)

Optimal F-Reliable Protocols for the Do-All Problem on Single-Hop Wireless Networks. - Andrea E. F. Clementi; Angelo Monti; Riccardo Silvestri (ISAAC, 2002)

Delta-Systems and Qualitative (In)Dependence. - János Körner; Angelo Monti (J. Comb. Theory A, 2002)

Distributed broadcast in radio networks of unknown topology. - Andrea E. F. Clementi; Angelo Monti; Riccardo Silvestri (Theor. Comput. Sci., 2003)

The Range Assignment Problem in Non-Homogeneous Static Ad-Hoc Networks. - Christoph Ambühl; Andrea E. F. Clementi; Miriam Di Ianni; Gianluca Rossi; Angelo Monti; Riccardo Silvestri (IPDPS, 2004)

Efficient Algorithms for Low-Energy Bounded-Hop Broadcast in Ad-Hoc Wireless Networks. - Christoph Ambühl; Andrea E. F. Clementi; Miriam Di Ianni; Nissan Lev-Tov; Angelo Monti; David Peleg; Gianluca Rossi; Riccardo Silvestri (STACS, 2004)

Round Robin is optimal for fault-tolerant broadcasting on wireless networks. - Andrea E. F. Clementi; Angelo Monti; Riccardo Silvestri (J. Parallel Distributed Comput., 2004)

Experimental Analysis of Practically Efficient Algorithms for Bounded-Hop Accumulation in Ad-Hoc Wireless Networks. - Andrea E. F. Clementi; Miriam Di Ianni; Angelo Monti; Gianluca Rossi; Riccardo Silvestri (IPDPS, 2005)

Divide and Conquer Is Almost Optimal for the Bounded-Hop MST Problem on Random Euclidean Instances. - Andrea E. F. Clementi; Miriam Di Ianni; Angelo Monti; Massimo Lauria; Gianluca Rossi; Riccardo Silvestri (SIROCCO, 2005)

A Distributed Protocol for the Bounded-Hops Converge-Cast in Ad-Hoc Networks. - Andrea E. F. Clementi; Miriam Di Ianni; Massimo Lauria; Angelo Monti; Gianluca Rossi; Riccardo Silvestri (ADHOC-NOW, 2006)

Spanning Trees with Many Leaves in Regular Bipartite Graphs. - Emanuele G. Fusco; Angelo Monti (ISAAC, 2007)

Optimal Gossiping in Directed Geometric Radio Networks in Presence of Dynamical Faults. - Andrea E. F. Clementi; Angelo Monti; Francesco Pasquale; Riccardo Silvestri (MFCS, 2007)

Communication in dynamic radio networks. - Andrea E. F. Clementi; Francesco Pasquale; Angelo Monti; Riccardo Silvestri (PODC, 2007)

An Equivalent Version of the Caccetta-Häggkvist Conjecture in an Online Load Balancing Problem. - Angelo Monti; Paolo Penna; Riccardo Silvestri (WG, 2007)

On the bounded-hop MST problem on random Euclidean instances. - Andrea E. F. Clementi; Miriam Di Ianni; Massimo Lauria; Angelo Monti; Gianluca Rossi; Riccardo Silvestri (Theor. Comput. Sci., 2007)

Minimum-energy broadcast in random-grid ad-hoc networks: approximation and distributed algorithms. - Tiziana Calamoneri; Andrea E. F. Clementi; Angelo Monti; Gianluca Rossi; Riccardo Silvestri (MSWiM, 2008)

Flooding time in edge-Markovian dynamic graphs. - Andrea E. F. Clementi; Claudio Macci; Angelo Monti; Francesco Pasquale; Riccardo Silvestri (PODC, 2008)

Minimum-Energy Broadcast and disk cover in grid wireless networks. - Tiziana Calamoneri; Andrea E. F. Clementi; Miriam Di Ianni; Massimo Lauria; Angelo Monti; Riccardo Silvestri (Theor. Comput. Sci., 2008)

Broadcasting in dynamic radio networks. - Andrea E. F. Clementi; Angelo Monti; Francesco Pasquale; Riccardo Silvestri (J. Comput. Syst. Sci., 2009)

Modelling Mobility: A Discrete Revolution. - Andrea E. F. Clementi; Angelo Monti; Riccardo Silvestri (ICALP (2), 2010)

Flooding Time of Edge-Markovian Evolving Graphs. - Andrea E. F. Clementi; Claudio Macci; Angelo Monti; Francesco Pasquale; Riccardo Silvestri (SIAM J. Discret. Math., 2010)

Modelling mobility: A discrete revolution. - Andrea Clementi; Angelo Monti; Riccardo Silvestri (Ad Hoc Networks, 2011)

Reverse-free codes and permutations. - Zoltán Füredi; Ida Kantor; Angelo Monti; Blerina Sinaimeri (Electron. Notes Discret. Math., 2011)

Rainbow graph splitting. - Angelo Monti; Blerina Sinaimeri (Theor. Comput. Sci., 2011)

Information Spreading in Stationary Markovian Evolving Graphs. - Andrea Clementi; Angelo Monti; Francesco Pasquale; Riccardo Silvestri (IEEE Trans. Parallel Distributed Syst., 2011)

Optimal gossiping in geometric radio networks in the presence of dynamical faults. - Andrea Clementi; Angelo Monti; Francesco Pasquale; Riccardo Silvestri (Networks, 2012)

Fast flooding over Manhattan. - Andrea Clementi; Angelo Monti; Riccardo Silvestri (Distributed Comput., 2013)

Deciding the winner in k rounds for DISJOINT ARROWS, a new combinatorial partizan game. - Angelo Monti (Theor. Comput. Sci., 2013)

Dynamically Operating on Threshold Graphs and Related Classes (Extended Abstract). - Tiziana Calamoneri; Angelo Monti; Rossella Petreschi (CTW, 2015)

A Locally Connected Spanning Tree Can Be Found in Polynomial Time on Simple Clique 3-Trees. - Tiziana Calamoneri; Matteo Dell'Orefice; Angelo Monti (ICTCS, 2016)

Fully Dynamically Maintaining Minimal Integral Separator for Threshold and Difference Graphs. - Tiziana Calamoneri; Angelo Monti; Rossella Petreschi (WALCOM, 2016)

Graphs that Are Not Pairwise Compatible: A New Proof Technique (Extended Abstract). - Pierluigi Baiocchi; Tiziana Calamoneri; Angelo Monti; Rossella Petreschi (IWOCA, 2018)

On variants of Vertex Geography on undirected graphs. - Angelo Monti; Blerina Sinaimeri (Discret. Appl. Math., 2018)

Families of locally separated Hamilton paths. - János Körner; Angelo Monti (J. Graph Theory, 2018)

On dynamic threshold graphs and related classes. - Tiziana Calamoneri; Angelo Monti; Rossella Petreschi (Theor. Comput. Sci., 2018)

Some classes of graphs that are not PCGs. - Pierluigi Baiocchi; Tiziana Calamoneri; Angelo Monti; Rossella Petreschi (Theor. Comput. Sci., 2019)

A simple linear time algorithm for the locally connected spanning tree problem on maximal planar chordal graphs. - Tiziana Calamoneri; Matteo Dell'Orefice; Angelo Monti (Theor. Comput. Sci., 2019)

String factorisations with maximum or minimum dimension. - Angelo Monti; Blerina Sinaimeri (Theor. Comput. Sci., 2020)

On Generalizations of Pairwise Compatibility Graphs. - Tiziana Calamoneri; Angelo Monti; Blerina Sinaimeri (CoRR, 2021)

On the domination number of $t$-constrained de Bruijn graphs. - Tiziana Calamoneri; Angelo Monti; Blerina Sinaimeri (Discret. Math. Theor. Comput. Sci., 2022)

On Graphs that are not Star-k-PCGs (short paper). - Angelo Monti; Blerina Sinaimeri (ICTCS, 2023)

On Star-Multi-interval Pairwise Compatibility Graphs. - Angelo Monti; Blerina Sinaimeri (WALCOM, 2023)

Disjoint covering of bipartite graphs with s-clubs. - Angelo Monti; Blerina Sinaimeri (CoRR, 2024)

Effects of graph operations on star pairwise compatibility graphs. - Angelo Monti; Blerina Sinaimeri (CoRR, 2024)

On Generalizations of Pairwise Compatibility Graphs. - Tiziana Calamoneri; Manuel Lafond; Angelo Monti; Blerina Sinaimeri (Discret. Math. Theor. Comput. Sci., 2024)

Disjoint Covering of Bipartite Graphs with s-clubs. - Angelo Monti; Blerina Sinaimeri (SOFSEM (2), 2025)

All Graphs with at Most 8 Nodes are 2-interval-PCGs. - Tiziana Calamoneri; Angelo Monti; Fabrizio Petroni (Fundam. Informaticae, 2025)

On star-k-PCGs: exploring class boundaries for small k values. - Angelo Monti; Blerina Sinaimeri (Acta Informatica, 2025)