| Simple dynamics for plurality consensus | 8 | 0.52 | 2014 |
| Plurality consensus in the gossip model | 17 | 0.81 | 2014 |
| Fast Flooding over Manhattan | 8 | 0.54 | 2013 |
| Distributed Community Detection in Dynamic Graphs - (Extended Abstract). | 0 | 0.34 | 2013 |
| Distributed Community Detection in Dynamic Graphs | 6 | 0.47 | 2013 |
| Opportunistic MANETs: mobility can make up for low transmission power | 15 | 0.73 | 2013 |
| Rumor Spreading in Random Evolving Graphs | 4 | 0.49 | 2013 |
| Optimal gossiping in geometric radio networks in the presence of dynamical faults | 2 | 0.36 | 2012 |
| Information spreading in dynamic graphs | 10 | 0.50 | 2011 |
| Information Spreading in Stationary Markovian Evolving Graphs | 41 | 1.42 | 2011 |
| Parsimonious Flooding in Geometric Random-Walks - (Extended Abstract). | 0 | 0.34 | 2011 |
| Information spreading in stationary Markovian evolving graphs | 49 | 1.85 | 2011 |
| Information Spreading in Opportunistic Networks is Fast | 4 | 0.42 | 2011 |
| Modelling mobility: A discrete revolution | 6 | 0.49 | 2011 |
| Maximizing the Number of Broadcast Operations in Random Geometric Ad Hoc Wireless Networks | 2 | 0.37 | 2011 |
| Flooding Time of Edge-Markovian Evolving Graphs | 35 | 1.40 | 2010 |
| Modelling Mobility: A Discrete Revolution. | 0 | 0.34 | 2010 |
| MANETS: High Mobility Can Make Up for Low Transmission Power. | 27 | 1.40 | 2009 |
| Pseudonyms in Cost-Sharing Games | 4 | 0.49 | 2009 |
| Broadcasting in dynamic radio networks | 29 | 1.19 | 2009 |
| Flooding time in edge-Markovian dynamic graphs | 61 | 2.77 | 2008 |
| Minimum-Energy Broadcast and disk cover in grid wireless networks | 7 | 0.77 | 2008 |
| Minimum-energy broadcast in random-grid ad-hoc networks: approximation and distributed algorithms | 5 | 0.48 | 2008 |
| An equivalent version of the Caccetta-Häggkvist conjecture in an online load balancing problem | 1 | 0.36 | 2007 |
| Maximizing the number of broadcast operations in static random geometric ad-hoc networks | 1 | 0.35 | 2007 |
| Communication in dynamic radio networks | 23 | 1.29 | 2007 |
| On the bounded-hop MST problem on random Euclidean instances | 2 | 0.38 | 2007 |
| Minimum energy broadcast and disk cover in grid wireless networks | 2 | 0.36 | 2006 |
| A distributed protocol for the bounded-hops converge-cast in ad-hoc networks | 2 | 0.40 | 2006 |
| On the Importance of Having an Identity or is Consensus Really Universal? | 22 | 1.07 | 2006 |
| Experimental Analysis of Practically Efficient Algorithms for Bounded-Hop Accumulation in Ad-Hoc Wireless Networks | 6 | 0.50 | 2005 |
| On the approximability of the range assignment problem on radio networks in presence of selfish agents | 8 | 0.57 | 2005 |
| Divide and conquer is almost optimal for the bounded-hop MST problem on random euclidean instances | 4 | 0.49 | 2005 |
| An Experimental Analysis of Simple, Distributed Vertex Coloring Algorithms | 10 | 0.66 | 2004 |
| The range assignment problem in non-homogeneous static ad-hoc networks | 10 | 0.48 | 2004 |
| Efficient Algorithms for Low-Energy Bounded-Hop Broadcast in Ad-Hoc Wireless Networks | 17 | 0.74 | 2004 |
| Polynomial Time Introreducibility | 3 | 0.53 | 2003 |
| The minimum broadcast range assignment problem on linear multi-hop wireless networks | 26 | 1.18 | 2003 |
| Algorithms and Complexity, 5th Italian Conference, CIAC 2003, Rome, Italy, May 28-30, 2003, Proceedings | 27 | 2.92 | 2003 |
| Energy Consumption in Radio Networks: Selfish Agents and Rewarding Mechanisms. | 9 | 0.60 | 2003 |
| The Minimum Range Assignment Problem on Linear Radio Networks | 42 | 2.71 | 2003 |
| Distributed broadcast in radio networks of unknown topology | 68 | 2.44 | 2003 |
| Experimental analysis of simple, distributed vertex coloring algorithms | 28 | 1.99 | 2002 |
| A Note On The Spatiality Degree Of Graphs | 0 | 0.34 | 2002 |
| Optimal F-Reliable Protocols for the Do-All Problem on Single-Hop Wireless Networks | 12 | 0.68 | 2002 |
| Dot operators | 1 | 0.35 | 2001 |
| On Weighted vs Unweighted Versions of Combinatorial Optimization Problems | 17 | 1.26 | 2001 |
| The Helping Hierarchy | 0 | 0.34 | 2001 |
| Distributed multi-broadcast in unknown radio networks | 16 | 1.15 | 2001 |
| Round Robin Is Optimal for Fault-Tolerant Broadcasting on Wireless Networks | 34 | 1.48 | 2001 |
