| Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring R Klasing, A Kosowski, A Navarra Theoretical Computer Science 411 (34-36), 3235-3246, 2010 | 103 | 2010 |
| An Unequal Clustering Algorithm for Wireless Sensor Networks E Ever, R Luchmun, L Mostarda, A Navarra, P Shah Proceedings of international conference on sensor networks, 85-193, 2012 | 102 | 2012 |
| Recoverable robustness in shunting and timetabling S Cicerone, G D’Angelo, G Di Stefano, D Frigioni, A Navarra, ... Robust and Online Large-Scale Optimization: Models and Techniques for …, 2009 | 92 | 2009 |
| SYNTHESIS: a tool for automatically assembling correct and distributed component-based systems M Autili, P Inverardi, A Navarra, M Tivoli 29th International Conference on Software Engineering (ICSE'07), 784-787, 2007 | 87 | 2007 |
| Gathering of robots on anonymous grids and trees without multiplicity detection G d'Angelo, G Di Stefano, R Klasing, A Navarra Theoretical Computer Science 610, 158-168, 2016 | 64 | 2016 |
| Gathering on rings under the look–compute–move model G D’angelo, G Di Stefano, A Navarra Distributed Computing 27, 255-285, 2014 | 64 | 2014 |
| Asynchronous arbitrary pattern formation: the effects of a rigorous approach S Cicerone, G Di Stefano, A Navarra Distributed Computing 32, 91-132, 2019 | 61 | 2019 |
| Recoverable robust timetabling for single delay: Complexity and polynomial algorithms for special cases S Cicerone, G D’Angelo, G Di Stefano, D Frigioni, A Navarra Journal of Combinatorial Optimization 18, 229-257, 2009 | 59 | 2009 |
| 12. Robust algorithms and price of robustness in shunting problems S Cicerone, G D'Angelo, G Di Stefano, D Frigioni, A Navarra 7th Workshop on Algorithmic Methods and Models for Optimization of Railways …, 2007 | 59 | 2007 |
| Improved approximation results for the minimum energy broadcasting problem M Flammini, A Navarra, R Klasing, S Pérennes Proceedings of the 2004 joint workshop on Foundations of mobile computing, 85-91, 2004 | 55 | 2004 |
| A unified approach for gathering and exclusive searching on rings under weak assumptions G D’angelo, A Navarra, N Nisse Distributed Computing 30, 17-48, 2017 | 50 | 2017 |
| Adaptive Broadcast Consumption (ABC), a new heuristic and new bounds for the minimum energy broadcast routing problem R Klasing, A Navarra, A Papadopoulos, S Pérennes International conference on research in networking, 866-877, 2004 | 50 | 2004 |
| Optimal gathering of oblivious robots in anonymous graphs and its application on trees and rings G Di Stefano, A Navarra Distributed Computing 30 (2), 75-86, 2017 | 49 | 2017 |
| Fast periodic graph exploration with constant memory L Gąsieniec, R Klasing, R Martin, A Navarra, X Zhang Journal of Computer and System Sciences 74 (5), 808-822, 2008 | 48 | 2008 |
| Energetic performance of service-oriented multi-radio networks: issues and perspectives M Caporuscio, D Charlet, V Issarny, A Navarra Proceedings of the 6th International Workshop on Software and Performance, 42-45, 2007 | 47 | 2007 |
| VIBE: An energy efficient routing protocol for dense and mobile sensor networks A Papadopoulos, A Navarra, JA McCann, CM Pinotti Journal of Network and Computer Applications 35 (4), 1177-1190, 2012 | 46 | 2012 |
| Gathering of oblivious robots on infinite grids with minimum traveled distance G Di Stefano, A Navarra Information and Computation 254, 377-391, 2017 | 45 | 2017 |
| Embedded pattern formation by asynchronous robots without chirality S Cicerone, G Di Stefano, A Navarra Distributed Computing 32, 291-315, 2019 | 39 | 2019 |
| Gathering of robots on meeting-points: feasibility and optimal resolution algorithms S Cicerone, G Di Stefano, A Navarra Distributed Computing 31 (1), 1-50, 2018 | 39 | 2018 |
| Taking advantage of symmetries: Gathering of asynchronous oblivious robots on a ring R Klasing, A Kosowski, A Navarra International Conference On Principles Of Distributed Systems, 446-462, 2008 | 38 | 2008 |
Gabriele Di StefanoProfessor of Computer Science, University of L'Aquila, ItalyVerified email at univaq.it
