| 2025 | SOFSEM | Disjoint Covering of Bipartite Graphs with s-clubs. | Angelo Monti, Blerina Sinaimeri |
| 2023 | WALCOM | On Star-Multi-interval Pairwise Compatibility Graphs. | Angelo Monti, Blerina Sinaimeri |
| 2018 | IWOCA | Graphs that Are Not Pairwise Compatible: A New Proof Technique (Extended Abstract). | Pierluigi Baiocchi, Tiziana Calamoneri, Angelo Monti, Rossella Petreschi |
| 2016 | WALCOM | Fully Dynamically Maintaining Minimal Integral Separator for Threshold and Difference Graphs. | Tiziana Calamoneri, Angelo Monti, Rossella Petreschi |
| 2010 | ICALP | Modelling Mobility: A | Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri |
| 2010 | PODC | Fast flooding over Manhattan. | Andrea Clementi, Angelo Monti, Riccardo Silvestri |
| 2008 | MSWIM | 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 |
| 2008 | PODC | Flooding time in edge-Markovian dynamic graphs. | Andrea E. F. Clementi, Claudio Macci, Angelo Monti, Francesco Pasquale, Riccardo Silvestri |
| 2007 | ISAAC | Spanning Trees with Many Leaves in Regular Bipartite Graphs. | Emanuele G. Fusco, Angelo Monti |
| 2007 | MFCS | Optimal Gossiping in Directed Geometric Radio Networks in Presence of Dynamical Faults. | Andrea E. F. Clementi, Angelo Monti, Francesco Pasquale, Riccardo Silvestri |
| 2007 | PODC | Communication in dynamic radio networks. | Andrea E. F. Clementi, Francesco Pasquale, Angelo Monti, Riccardo Silvestri |
| 2007 | WG | An Equivalent Version of the Caccetta-Hggkvist Conjecture in an Online Load Balancing Problem. | Angelo Monti, Paolo Penna, Riccardo Silvestri |
| 2006 | SIROCCO | 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 |
| 2005 | SIROCCO | 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 |
| 2004 | STACS | Efficient Algorithms for Low-Energy Bounded-Hop Broadcast in Ad-Hoc Wireless Networks. | Christoph Ambhl, Andrea E. F. Clementi, Miriam Di Ianni, Nissan Lev-Tov, Angelo Monti, David Peleg, Gianluca Rossi, Riccardo Silvestri |
| 2002 | ISAAC | Optimal F-Reliable Protocols for the Do-All Problem on Single-Hop Wireless Networks. | Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri |
| 2001 | ESA | Round Robin Is Optimal for Fault-Tolerant Broadcasting on Wireless Networks. | Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri |
| 2001 | PODC | Distributed multi-broadcast in unknown radio networks. | Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri |
| 2001 | SODA | Selective families, superimposed codes, and broadcasting on unknown radio networks. | Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri |
| 1998 | STACS | A Logical Characterization of Systolic Languages. | Angelo Monti, Adriano Peron |
| 1995 | LATIN | State Complexity of SBTA Languages. | Jozef Gruska, Angelo Monti, Margherita Napoli, Domenico Parente |
| 1995 | STACS | Systolic Tree Omega-Languages. | Angelo Monti, Adriano Peron |
| 1994 | CIAC | On the Complexity of Some Reachability Problems. | Angelo Monti, Alessandro Roncato |
| 1994 | SIROCCO | Trade-off Between Computational Power and Common Knowledge in Anonymous Rings. | Paolo Ferragina, Angelo Monti, Alessandro Roncato |
| 1993 | WADS | On Reconfigurability of VLSI Linear Arrays. | Roberto De Prisco, Angelo Monti |
| 1991 | FCT | Systolic Y-Tree Automata: Closure Properties and Decision Problems. | Emanuela Fachini, Angelo Monti, Margherita Napoli, Domenico Parente |