| Recoverable robustness in shunting and timetabling S Cicerone, G D’Angelo, G Di Stefano, D Frigioni, A Navarra, ... Robust and online large-scale optimization, 28-60, 2009 | 72 | 2009 |
| A graph theoretical approach to the shunting problem G Di Stefano, ML Koči Electronic Notes in Theoretical Computer Science 92, 16-33, 2004 | 69 | 2004 |
| A Distributed AOA Based Localization Algorithm for Wireless Sensor Networks. G Di Stefano, A Petricola JCP 3 (4), 1-8, 2008 | 51 | 2008 |
| 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 | 51 | 2007 |
| 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 (3), 229, 2009 | 48 | 2009 |
| Track assignment S Cornelsen, G Di Stefano Journal of Discrete Algorithms 5 (2), 250-261, 2007 | 41 | 2007 |
| Gathering on rings under the look–compute–move model G D’Angelo, G Di Stefano, A Navarra Distributed Computing 27 (4), 255-285, 2014 | 40 | 2014 |
| On the extension of bipartite to parity graphs S Cicerone, G Di Stefano Discrete Applied Mathematics 95 (1-3), 181-195, 1999 | 40 | 1999 |
| Accelerating time-dependent multi-criteria timetable information is harder than expected A Berger, D Delling, A Gebhardt, M Müller-Hannemann 9th Workshop on Algorithmic Approaches for Transportation Modeling …, 2009 | 38 | 2009 |
| A fully dynamic algorithm for distributed shortest paths S Cicerone, G Di Stefano, D Frigioni, U Nanni Theoretical Computer Science 297 (1-3), 83-102, 2003 | 38 | 2003 |
| Distributed Positioning Algorithms for Ad-hoc Networks G DI STEFANO, F Graziosi, F Santucci IEEE IWUWBS 2003, 2003 | 31 | 2003 |
| Gathering of six robots on anonymous symmetric rings G d’Angelo, G Di Stefano, A Navarra International Colloquium on Structural Information and Communication …, 2011 | 30 | 2011 |
| Graph classes between parity and distance-hereditary graphs S Cicerone, G Di Stefano Discrete Applied Mathematics 95 (1-3), 197-216, 1999 | 29 | 1999 |
| 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 | 28 | 2016 |
| Gathering of robots on anonymous grids without multiplicity detection G d’Angelo, G Di Stefano, R Klasing, A Navarra International Colloquium on Structural Information and Communication …, 2012 | 27 | 2012 |
| Multi-stage recovery robustness for optimization problems: A new concept for planning under disturbances S Cicerone, G Di Stefano, M Schachtebeck, A Schöbel Information Sciences 190, 107-126, 2012 | 26 | 2012 |
| How to gather asynchronous oblivious robots on anonymous rings G d’Angelo, G Di Stefano, A Navarra International Symposium on Distributed Computing, 326-340, 2012 | 25 | 2012 |
| Dynamic algorithms for recoverable robustness problems S Cicerone, G Di Stefano, M Schachtebeck, A Schöbel 8th Workshop on Algorithmic Approaches for Transportation Modeling …, 2008 | 24 | 2008 |
| Gathering asynchronous and oblivious robots on basic graph topologies under the look-compute-move model G d’Angelo, G Di Stefano, A Navarra Search Theory, 197-222, 2013 | 23 | 2013 |
| Dynamic multi-level overlay graphs for shortest paths F Bruera, S Cicerone, G D’Angelo, G Di Stefano, D Frigioni Mathematics in Computer Science 1 (4), 709-736, 2008 | 23 | 2008 |
