| The minimum broadcast range assignment problem on linear multi-hop wireless networks AEF Clementi, M Di Ianni, R Silvestri Theoretical Computer Science 299 (1-3), 751-761, 2003 | 58 | 2003 |
| Efficient algorithms for low-energy bounded-hop broadcast in ad-hoc wireless networks C Ambühl, AEF Clementi, M Di Ianni, N Lev-Tov, A Monti, D Peleg, ... STACS 2004: 21st Annual Symposium on Theoretical Aspects of Computer Science …, 2004 | 45 | 2004 |
| Distributed community detection in dynamic graphs A Clementi, M Di Ianni, G Gambosi, E Natale, R Silvestri Theoretical Computer Science 584, 19-41, 2015 | 40 | 2015 |
| Parameterized parallel complexity M Cesati, M Di Ianni Euro-Par’98 Parallel Processing: 4th International Euro-Par Conference …, 1998 | 37 | 1998 |
| The range assignment problem in non-homogeneous static ad-hoc networks C Ambuhl, AEF Clementi, M Di Ianni, G Rossi, A Monti, R Silvestri 18th International Parallel and Distributed Processing Symposium, 2004 …, 2004 | 26 | 2004 |
| On the hardness of approximating optimum schedule problems in store and forward networks AEF Clementi, M Di Ianni IEEE/ACM transactions on networking 4 (2), 272-280, 1996 | 23 | 1996 |
| Efficient delay routing M Di Ianni Theoretical Computer Science 196 (1-2), 131-151, 1998 | 22 | 1998 |
| Experimental analysis of practically efficient algorithms for bounded-hop accumulation in ad-hoc wireless networks AEF Clementi, M Di Ianni, A Monti, G Rossi, R Silvestri 19th IEEE International Parallel and Distributed Processing Symposium, 8 pp., 2005 | 21 | 2005 |
| Momose: A mobility model simulation environment for mobile wireless ad-hoc networks S Boschi, P Crescenzi, M Di Ianni, G Rossi, P Vocca 1st International ICST Conference on Simulation Tools and Techniques for …, 2010 | 18 | 2010 |
| Complexity of minimum length scheduling for precedence constrained messages in distributed systems P Barcaccia, MA Bonuccelli, M Di Ianni IEEE transactions on Parallel and Distributed Systems 11 (10), 1090-1102, 2000 | 15 | 2000 |
| Minimum-energy broadcast and disk cover in grid wireless networks T Calamoneri, AEF Clementi, M Di Ianni, M Lauria, A Monti, R Silvestri Theoretical Computer Science 399 (1-2), 38-53, 2008 | 14 | 2008 |
| Minimum-energy broadcast and disk cover in grid wireless networks T Calamoneri, AEF Clementi, M Di Ianni, M Lauria, A Monti, R Silvestri Theoretical Computer Science 399 (1-2), 38-53, 2008 | 14 | 2008 |
| Spatial node distribution of manhattan path based random waypoint mobility models with applications P Crescenzi, M Di Ianni, A Marino, G Rossi, P Vocca Structural Information and Communication Complexity: 16th International …, 2010 | 13 | 2010 |
| Distributed community detection in dynamic graphs A Clementi, M Di Ianni, G Gambosi, E Natale, R Silvestri Structural Information and Communication Complexity: 20th International …, 2013 | 11 | 2013 |
| Minimum length scheduling of precedence constrained messages in distributed systems P Barcaccia, MA Bonuccelli, M Di Ianni Euro-Par'96 Parallel Processing: Second International Euro-Par Conference …, 1996 | 11 | 1996 |
| Approximation algorithms for routing and call scheduling in all-optical chains and rings L Becchetti, M Di Ianni, A Marchetti-Spaccamela Theoretical computer science 287 (2), 429-448, 2002 | 9 | 2002 |
| Optimum schedule problems in store and forward networks A Clementi, M Di Ianni Proceedings of INFOCOM'94 Conference on Computer Communications, 1336-1343, 1994 | 9 | 1994 |
| Divide and conquer is almost optimal for the bounded-hop MST problem on random Euclidean instances AEF Clementi, M Di Ianni, A Monti, M Lauria, G Rossi, R Silvestri Structural Information and Communication Complexity: 12 International …, 2005 | 8 | 2005 |
| Min–max communities in graphs: Complexity and computational properties M Di Ianni, G Gambosi, G Rossi, P Vocca Theoretical Computer Science 613, 94-114, 2016 | 7 | 2016 |
| Wormhole deadlock prediction M Di Ianni Euro-Par'97 Parallel Processing: Third International Euro-Par Conference …, 1997 | 7 | 1997 |
