| Efficient collective communication in optical networks JC Bermond, L Gargano, S Perennes, AA Rescigno, U Vaccaro Automata, Languages and Programming: 23rd International Colloquium, ICALP'96 …, 1996 | 137 | 1996 |
| Embedding graphs onto the supercube L Auletta, AA Rescigno, V Scarano IEEE Transactions on Computers 44 (4), 593-597, 1995 | 82 | 1995 |
| Fast gossiping by short messages JC Bermond, L Gargano, AA Rescigno, U Vaccaro SIAM Journal on Computing 27 (4), 917-941, 1998 | 66 | 1998 |
| Vertex-disjoint spanning trees of the star network with applications to fault-tolerance and security AA Rescigno Information Sciences 137 (1-4), 259-276, 2001 | 59 | 2001 |
| Efficient collective communication in optical networks JC Bermond, L Gargano, S Perennes, AA Rescigno, U Vaccaro Theoretical computer science 233 (1-2), 165-189, 2000 | 59 | 2000 |
| Complexity of conflict-free colorings of graphs L Gargano, AA Rescigno Theoretical Computer Science 566, 39-49, 2015 | 52 | 2015 |
| Performance of the CDF online silicon vertex tracker W Ashmanskas, A Barchiesi, A Bardi, M Bari, M Baumgart, S Belforte, ... IEEE Transactions on Nuclear Science 49 (3), 1177-1184, 2002 | 42 | 2002 |
| Optimally fast data gathering in sensor networks L Gargano, AA Rescigno Mathematical Foundations of Computer Science 2006: 31st International …, 2006 | 39 | 2006 |
| Fast gossiping by short messages JC Bermond, L Gargano, AA Rescigno, U Vaccaro Automata, Languages and Programming: 22nd International Colloquium, ICALP 95 …, 1995 | 39* | 1995 |
| Optimizing spread of influence in social networks via partial incentives G Cordasco, L Gargano, AA Rescigno, U Vaccaro Structural Information and Communication Complexity: 22nd International …, 2015 | 30 | 2015 |
| Optimal polling in communication networks AA Rescigno IEEE Transactions on Parallel and Distributed Systems 8 (5), 449-461, 1997 | 29 | 1997 |
| Evangelism in social networks: Algorithms and complexity G Cordasco, L Gargano, AA Rescigno, U Vaccaro Networks 71 (4), 346-357, 2018 | 28 | 2018 |
| Discovering small target sets in social networks: a fast and effective algorithm G Cordasco, L Gargano, M Mecchia, AA Rescigno, U Vaccaro Algorithmica 80, 1804-1833, 2018 | 28 | 2018 |
| Strong conflict-free coloring for intervals P Cheilaris, L Gargano, AA Rescigno, S Smorodinsky Algorithmica 70 (4), 732-749, 2014 | 27 | 2014 |
| Active influence spreading in social networks G Cordasco, L Gargano, AA Rescigno Theoretical Computer Science 764, 15-29, 2019 | 25 | 2019 |
| Fault—tolerant hypercube broadcasting via information dispersal L Gargano, AA Rescigno, U Vaccaro Networks 23 (4), 271-282, 1993 | 24 | 1993 |
| Influence propagation over large scale social networks G Cordasco, L Gargano, AA Rescigno Proceedings of the 2015 IEEE/ACM International Conference on Advances in …, 2015 | 23 | 2015 |
| Collision-free path coloring with application to minimum-delay gathering in sensor networks L Gargano, AA Rescigno Discrete Applied Mathematics 157 (8), 1858-1872, 2009 | 21 | 2009 |
| On finding small sets that influence large networks G Cordasco, L Gargano, AA Rescigno Social Network Analysis and Mining 6, 1-20, 2016 | 20 | 2016 |
| A fast and effective heuristic for discovering small target sets in social networks G Cordasco, L Gargano, M Mecchia, AA Rescigno, U Vaccaro Combinatorial Optimization and Applications: 9th International Conference …, 2015 | 19 | 2015 |
