フォロー
Gabriele Di Stefano
Gabriele Di Stefano
Professor of Computer Science, University of L'Aquila, Italy
確認したメール アドレス: univaq.it
タイトル
引用先
引用先
Recoverable robustness in shunting and timetabling
S Cicerone, G D’Angelo, GD Stefano, D Frigioni, A Navarra, ...
Robust and online large-scale optimization, 28-60, 2009
872009
A graph theoretical approach to the shunting problem
G Di Stefano, ML Koči
Electronic Notes in Theoretical Computer Science 92, 16-33, 2004
792004
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
A Distributed AOA Based Localization Algorithm for Wireless Sensor Networks.
G Di Stefano, A Petricola
J. Comput. 3 (4), 1-8, 2008
592008
Gathering on rings under the look–compute–move model
G D’Angelo, G Di Stefano, A Navarra
Distributed Computing 27 (4), 255-285, 2014
552014
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-257, 2009
552009
Track assignment
S Cornelsen, G Di Stefano
Journal of Discrete Algorithms 5 (2), 250-261, 2007
482007
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
442016
On the extension of bipartite to parity graphs
S Cicerone, G Di Stefano
Discrete Applied Mathematics 95 (1-3), 181-195, 1999
441999
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
422003
Asynchronous arbitrary pattern formation: the effects of a rigorous approach
S Cicerone, G Di Stefano, A Navarra
Distributed Computing 32 (2), 91-132, 2019
402019
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
382017
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
352012
Gathering of oblivious robots on infinite grids with minimum traveled distance
G Di Stefano, A Navarra
Information and Computation 254, 377-391, 2017
342017
Gathering of robots on anonymous grids without multiplicity detection
G d’Angelo, GD Stefano, R Klasing, A Navarra
International Colloquium on Structural Information and Communication …, 2012
312012
Gathering of six robots on anonymous symmetric rings
G d’Angelo, GD Stefano, A Navarra
International Colloquium on Structural Information and Communication …, 2011
302011
Distributed positioning algorithm for ad-hoc networks
G Di Stefano, F Graziosi, F Santucci
International Workshop on Ultra Wideband Systems (IWUWBS), 2003
302003
Graph classes between parity and distance-hereditary graphs
S Cicerone, G Di Stefano
Discrete Applied Mathematics 95 (1-3), 197-216, 1999
291999
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
282008
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
282008
現在システムで処理を実行できません。しばらくしてからもう一度お試しください。
論文 1–20