| On the complexity of computing minimum energy consumption broadcast subgraphs A Clementi, P Crescenzi, P Penna, G Rossi, P Vocca STACS 2001, 121-131, 2001 | 309* | 2001 |
| Some recent theoretical advances and open questions on energy consumption in ad-hoc wireless networks AEF Clementi, G Huiban, P Penna, G Rossi, YC Verhoeven Proceedings of the 3rd Workshop on Approximation and Randomization …, 2002 | 100 | 2002 |
| 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, ... Annual Symposium on Theoretical Aspects of Computer Science, 418-427, 2004 | 44 | 2004 |
| On the approximation ratio of the MST based heuristic for the energy-efficient broadcast problem in static ad-hoc radio networks AK Clementi, G Huiban, G Rossi, YC Verhoeven, P Penna Proceedings International Parallel and Distributed Processing Symposium, 8 pp., 2003 | 30 | 2003 |
| On the Hamming distance of constraint satisfaction problems P Crescenzi, G Rossi Theoretical Computer Science 288 (1), 85-100, 2002 | 30 | 2002 |
| Energy consumption in radio networks: Selfish agents and rewarding mechanisms C Ambühl, AEF Clementi, P Penna, G Rossi, R Silvestri International Workshop on Approximation and Online Algorithms, 248-251, 2003 | 28 | 2003 |
| 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 | 24 | 2004 |
| On the complexity of approximating colored-graph problems extended abstract AEF Clementi, P Crescenzi, G Rossi International Computing and Combinatorics Conference, 281-290, 1999 | 18 | 1999 |
| 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 | 17 | 2005 |
| Momose: A mobility model simulation environment for mobile wireless ad-hoc networks S Boschi, M Di lanni, P Crescenzi, G Rossi, P Vocca Proceedings of the 1st international conference on Simulation tools and …, 2008 | 15 | 2008 |
| TWITTER TEMPORAL EVOLUTION ANALYSIS: COMPARING EVENT AND TOPIC DRIVEN RETWEET GRAPHS. G Amati, S Angelini, F Capri, G Gambosi, G Rossi, P Vocca IADIS International Journal on Computer Science & Information Systems 11 (2), 2016 | 12 | 2016 |
| Spatial node distribution of manhattan path based random waypoint mobility models with applications P Crescenzi, M Di Ianni, A Marino, G Rossi, P Vocca International Colloquium on Structural Information and Communication …, 2009 | 11 | 2009 |
| On the approximability of the range assignment problem on radio networks in presence of selfish agents C Ambühl, AEF Clementi, P Penna, G Rossi, R Silvestri Theoretical computer science 343 (1-2), 27-41, 2005 | 11 | 2005 |
| The range assignment problem in static ad-hoc wireless networks G Rossi Ph. D. Thesis, 2003 | 10 | 2003 |
| Modelling the temporal evolution of the retweet graph G Amati, S Angelini, F Capri, G Gambosi, G Rossi, P Vocca IADIS International Journal on Computer Science & Information Systems 11 (2), 2016 | 9 | 2016 |
| Moving beyond the Twitter follow graph G Amati, S Angelini, M Bianchi, G Fusco, G Gambosi, G Gaudino, ... 2015 7th International Joint Conference on Knowledge Discovery, Knowledge …, 2015 | 8 | 2015 |
| Optimal covering designs: complexity results and new bounds P Crescenzi, F Montecalvo, G Rossi Discrete applied mathematics 144 (3), 281-290, 2004 | 8 | 2004 |
| A self-organizing group management middleware for mobile ad-hoc networks D Bottazi, R Montanari, G Rossi Computer Communications 31 (13), 3040-3048, 2008 | 7 | 2008 |
| Divide and conquer is almost optimal for the bounded-hop MST problem on random Euclidean instances A Clementi, M Di Ianni, A Monti, M Lauria, G Rossi, R Silvestri Structural Information and Communication Complexity, 565-565, 2005 | 7 | 2005 |
| Optimal head-driven parsing complexity for linear context-free rewriting systems P Crescenzi, D Gildea, A Marino, G De Rossi, G Satta Proceedings of the 49th Annual Meeting of the Association for Computational …, 2011 | 6 | 2011 |
