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 | 96 | 2009 |
Cardinal directions between spatial objects: the pairwise-consistency problem S Cicerone, P Di Felice Information Sciences 164 (1-4), 165-188, 2004 | 90 | 2004 |
Asynchronous arbitrary pattern formation: the effects of a rigorous approach S Cicerone, G Di Stefano, A Navarra Distributed Computing 32, 91-132, 2019 | 67 | 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 | 61 | 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 | 60 | 2007 |
Robust and online large-scale optimization: models and techniques for transportation systems RK Ahuja, RH Möhring, CD Zaroliagis Springer Science & Business Media, 2009 | 51 | 2009 |
On the extension of bipartite to parity graphs S Cicerone, G Di Stefano Discrete Applied Mathematics 95 (1-3), 181-195, 1999 | 49 | 1999 |
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 | 44 | 2018 |
Embedded pattern formation by asynchronous robots without chirality S Cicerone, G Di Stefano, A Navarra Distributed Computing 32, 291-315, 2019 | 42 | 2019 |
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 | 42 | 2003 |
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 | 40 | 2012 |
Graph classes between parity and distance-hereditary graphs S Cicerone, G Di Stefano Discrete Applied Mathematics 95 (1-3), 197-216, 1999 | 38 | 1999 |
Arbitrary pattern formation on infinite regular tessellation graphs S Cicerone, A Di Fonso, G Di Stefano, A Navarra Theoretical Computer Science 942, 1-20, 2023 | 35 | 2023 |
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 | 33 | 2008 |
Cardinal relations between regions with a broad boundary S Cicerone, P Di Felice Proceedings of the 8th ACM international symposium on Advances in geographic …, 2000 | 32 | 2000 |
On the mutual visibility in Cartesian products and triangle-free graphs S Cicerone, G Di Stefano, S Klavžar Applied Mathematics and Computation 438, 127619, 2023 | 30 | 2023 |
Recoverable robustness for train shunting problems S Cicerone, G D’Angelo, G Di Stefano, D Frigioni, A Navarra Algorithmic Operations Research 4 (2), 102-116, 2009 | 30 | 2009 |
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, 709-736, 2008 | 29 | 2008 |
Graphs with bounded induced distance S Cicerone, G Di Stefano Discrete Applied Mathematics 108 (1-2), 3-21, 2001 | 27 | 2001 |
Asynchronous robots on graphs: Gathering S Cicerone, G Di Stefano, A Navarra Distributed Computing by Mobile Entities: Current Research in Moving and …, 2019 | 25 | 2019 |