| 2010 | ICALP | Modelling Mobility: A | Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri |
| 2009 | ICALP | MANETS: High Mobility Can Make Up for Low Transmission Power. | Andrea E. F. Clementi, Francesco Pasquale, 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 | MFCS | Optimal Gossiping in Directed Geometric Radio Networks in Presence of Dynamical Faults. | Andrea E. F. Clementi, Angelo Monti, Francesco Pasquale, Riccardo Silvestri |
| 2007 | OPODIS | Maximizing the Number of Broadcast Operations in Static Random Geometric Ad-Hoc Networks. | Tiziana Calamoneri, Andrea E. F. Clementi, Emanuele G. Fusco, Riccardo Silvestri |
| 2007 | PODC | Communication in dynamic radio networks. | Andrea E. F. Clementi, Francesco Pasquale, Angelo Monti, 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 |
| 2003 | SIROCCO | Energy Consumption in Radio Networks: Selfish Agents and Rewarding Mechanisms. | Christoph Ambhl, Andrea E. F. Clementi, Paolo Penna, Gianluca Rossi, Riccardo Silvestri |
| 2003 | WAOA | Energy Consumption in Radio Networks: Selfish Agents and Rewarding Mechanisms. | Christoph Ambhl, Andrea E. F. Clementi, Paolo Penna, 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 |
| 2001 | STACS | On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs. | Andrea E. F. Clementi, Pierluigi Crescenzi, Paolo Penna, Gianluca Rossi, Paola Vocca |
| 2000 | ESA | The Minimum Range Assignment Problem on Linear Radio Networks. | Andrea E. F. Clementi, Afonso Ferreira, Paolo Penna, Stephane Perennes, Riccardo Silvestri |
| 2000 | ICALP | A Note on Parallel Read Operations on Large Public Databases. | Gian Carlo Bongiovanni, Andrea E. F. Clementi, Paolo Penna |
| 2000 | STACS | The Power Range Assignment Problem in Radio Networks on the Plane. | Andrea E. F. Clementi, Paolo Penna, Riccardo Silvestri |
| 1999 | COCOON | On the Complexity of Approximating Colored-Graph Problems. | Andrea E. F. Clementi, Pierluigi Crescenzi, Gianluca Rossi |
| 1999 | ICALP | Small Pseudo-Random Sets Yield Hard Functions: New Tight Explict Lower Bounds for Branching Programs. | Alexander E. Andreev, Juri L. Baskakov, Andrea E. F. Clementi, Jos D. P. Rolim |
| 1999 | STACS | Memory Organization Schemes for Large Shared Data: A Randomized Solution for Distributed Memory Machines. | Alexander E. Andreev, Andrea E. F. Clementi, Paolo Penna, Jos D. P. Rolim |
| 1997 | FOCS | Weak Random Sources, Hitting Sets, and BPP Simulations. | Alexander E. Andreev, Andrea E. F. Clementi, Jos D. P. Rolim, Luca Trevisan |
| 1997 | ICALP | Worst-Case Hardness Suffices for Derandomization: A New Method for Hardness-Randomness Trade-Offs. | Alexander E. Andreev, Andrea E. F. Clementi, Jos D. P. Rolim |
| 1997 | STACS | Efficient Construction of Hitting Sets for Systems of Linear Functions. | Alexander E. Andreev, Andrea E. F. Clementi, Jos D. P. Rolim |
| 1996 | COCOON | Improved Non-approximability Results for Vertex Cover with Density Constraints. | Andrea E. F. Clementi, Luca Trevisan |
| 1996 | ICALP | Hitting Sets Derandomize BPP. | Alexander E. Andreev, Andrea E. F. Clementi, Jos D. P. Rolim |
| 1996 | STACS | Optimal Bounds on the Approximation of Boolean Functions with Consequences on the Concept of Hardware. | Alexander E. Andreev, Andrea E. F. Clementi, Jos D. P. Rolim |
| 1994 | INFOCOM | Optimum Schedule Problems in Store and Forward Networks. | Andrea E. F. Clementi, Miriam Di Ianni |