Follow
Gabriele Di Stefano
Gabriele Di Stefano
Professor of Computer Science, University of L'Aquila, Italy
Verified email at univaq.it
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
A graph theoretical approach to the shunting problem
G Di Stefano, ML Koči
Electronic Notes in Theoretical Computer Science 92, 16-33, 2004
782004
A Distributed AOA Based Localization Algorithm for Wireless Sensor Networks.
G Di Stefano, A Petricola
J. Comput. 3 (4), 1-8, 2008
622008
Gathering on rings under the look–compute–move model
G D’angelo, G Di Stefano, A Navarra
Distributed Computing 27, 255-285, 2014
612014
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
602016
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
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
592007
Asynchronous arbitrary pattern formation: the effects of a rigorous approach
S Cicerone, G Di Stefano, A Navarra
Distributed Computing 32, 91-132, 2019
552019
Track assignment
S Cornelsen, G Di Stefano
Journal of Discrete Algorithms 5 (2), 250-261, 2007
512007
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
462017
On the extension of bipartite to parity graphs
S Cicerone, G Di Stefano
Discrete Applied Mathematics 95 (1-3), 181-195, 1999
461999
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
Gathering of oblivious robots on infinite grids with minimum traveled distance
G Di Stefano, A Navarra
Information and Computation 254, 377-391, 2017
422017
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
Graph classes between parity and distance-hereditary graphs
S Cicerone, G Di Stefano
Discrete Applied Mathematics 95 (1-3), 197-216, 1999
371999
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
362018
Embedded pattern formation by asynchronous robots without chirality
S Cicerone, G Di Stefano, A Navarra
Distributed Computing 32, 291-315, 2019
352019
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
332012
Computing on rings by oblivious robots: a unified approach for different tasks
G d’Angelo, G Di Stefano, A Navarra, N Nisse, K Suchan
Algorithmica 72, 1055-1096, 2015
322015
Gathering of six robots on anonymous symmetric rings
G d’Angelo, G Di Stefano, A Navarra
Structural Information and Communication Complexity: 18th Internationalá…, 2011
322011
The system can't perform the operation now. Try again later.
Articles 1–20