| Time-varying graphs and dynamic networks A Casteigts, P Flocchini, W Quattrociocchi, N Santoro International Journal of Parallel, Emergent and Distributed Systems 27 (5 …, 2012 | 1123 | 2012 |
| Gathering of asynchronous robots with limited visibility P Flocchini, G Prencipe, N Santoro, P Widmayer Theoretical Computer Science 337 (1-3), 147-168, 2005 | 461 | 2005 |
| Distributed computing by oblivious mobile robots P Flocchini, G Prencipe, N Santoro Morgan & Claypool Publishers, 2012 | 357 | 2012 |
| Arbitrary pattern formation by asynchronous, anonymous, oblivious robots P Flocchini, G Prencipe, N Santoro, P Widmayer Theoretical Computer Science 407 (1-3), 412-447, 2008 | 290 | 2008 |
| Distributed computing by mobile robots: Gathering M Cieliebak, P Flocchini, G Prencipe, N Santoro SIAM Journal on Computing 41 (4), 829-879, 2012 | 266 | 2012 |
| Capture of an intruder by mobile agents L Barriere, P Flocchini, P Fraigniaud, N Santoro Proceedings of the fourteenth annual ACM symposium on Parallel algorithms …, 2002 | 236 | 2002 |
| Solving the robots gathering problem M Cieliebak, P Flocchini, G Prencipe, N Santoro International Colloquium on Automata, Languages, and Programming, 1181-1196, 2003 | 231 | 2003 |
| Distributed computing by mobile entities P Flocchini, G Prencipe, N Santoro Current Research in Moving and Computing 11340 (1), 2019 | 229 | 2019 |
| Hard tasks for weak robots: The role of common knowledge in pattern formation by autonomous mobile robots P Flocchini, G Prencipe, N Santoro, P Widmayer International Symposium on Algorithms and Computation, 93-102, 1999 | 205 | 1999 |
| Autonomous mobile robots with lights S Das, P Flocchini, G Prencipe, N Santoro, M Yamashita Theoretical Computer Science 609, 171-184, 2016 | 193 | 2016 |
| Time-varying graphs and social network analysis: Temporal indicators and metrics N Santoro, W Quattrociocchi, P Flocchini, A Casteigts, F Amblard arXiv preprint arXiv:1102.0629, 2011 | 183 | 2011 |
| Computing without communicating: Ring exploration by asynchronous oblivious robots P Flocchini, D Ilcinkas, A Pelc, N Santoro Algorithmica 65 (3), 562-583, 2013 | 173* | 2013 |
| On the exploration of time-varying networks P Flocchini, B Mans, N Santoro Theoretical Computer Science 469, 53-68, 2013 | 168* | 2013 |
| Mobile search for a black hole in an anonymous ring S Dobrev, P Flocchini, G Prencipe, N Santoro Algorithmica 48 (1), 67-90, 2007 | 151* | 2007 |
| Gathering of asynchronous oblivious robots with limited visibility P Flocchini, G Prencipe, N Santoro, P Widmayer Annual Symposium on Theoretical Aspects of Computer Science, 247-258, 2001 | 145 | 2001 |
| Cellular automata in fuzzy backgrounds G Cattaneo, P Flocchini, G Mauri, CQ Vogliotti, N Santoro Physica D: Nonlinear Phenomena 105 (1-3), 105-120, 1997 | 125 | 1997 |
| Mutual visibility by luminous robots without collisions GA Di Luna, P Flocchini, SG Chaudhuri, F Poloni, N Santoro, G Viglietta Information and Computation 254, 392-418, 2017 | 124 | 2017 |
| Self-deployment of mobile sensors on a ring P Flocchini, G Prencipe, N Santoro Theoretical Computer Science 402 (1), 67-80, 2008 | 123* | 2008 |
| Remembering without memory: Tree exploration by asynchronous oblivious robots P Flocchini, D Ilcinkas, A Pelc, N Santoro Theoretical Computer Science 411 (14-15), 1583-1598, 2010 | 122 | 2010 |
| Searching for a black hole in arbitrary networks: Optimal mobile agents protocols S Dobrev, P Flocchini, G Prencipe, N Santoro Distributed Computing 19 (1), 1-99999, 2006 | 116 | 2006 |
