Follow
Serafino Cicerone
Serafino Cicerone
Verified email at univaq.it - Homepage
Title
Cited by
Cited by
Year
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
902009
Cardinal directions between spatial objects: the pairwise-consistency problem
S Cicerone, P Di Felice
Information Sciences 164 (1-4), 165-188, 2004
902004
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
602007
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
592009
Asynchronous arbitrary pattern formation: the effects of a rigorous approach
S Cicerone, G Di Stefano, A Navarra
Distributed Computing 32, 91-132, 2019
562019
Asynchronous arbitrary pattern formation: the effects of a rigorous approach
S Cicerone, G Di Stefano, A Navarra
Distributed Computing 32, 91-132, 2019
542019
Robust and online large-scale optimization: models and techniques for transportation systems
RK Ahuja, RH Möhring, CD Zaroliagis
Springer, 2009
502009
On the extension of bipartite to parity graphs
S Cicerone, G Di Stefano
Discrete Applied Mathematics 95 (1-3), 181-195, 1999
471999
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
432003
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
382012
Embedded pattern formation by asynchronous robots without chirality
S Cicerone, G Di Stefano, A Navarra
Distributed Computing 32, 291-315, 2019
372019
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
372018
Graph classes between parity and distance-hereditary graphs
S Cicerone, G Di Stefano
Discrete Applied Mathematics 95 (1-3), 197-216, 1999
371999
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
322008
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
312000
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
292023
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
282009
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
282008
Graphs with bounded induced distance
S Cicerone, G Di Stefano
Discrete Applied Mathematics 108 (1-2), 3-21, 2001
252001
Minimum-traveled-distance gathering of oblivious robots over given meeting points
S Cicerone, G Di Stefano, A Navarra
International Symposium on Algorithms and Experiments for Sensor Systems …, 2014
232014
The system can't perform the operation now. Try again later.
Articles 1–20