Gabriele Di Stefano

Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, Vinicio Maurizio: Engineering a New Algorithm for Distributed Shortest Paths on Dynamic Networks. Algorithmica 66(1): 51-86 (2013)

Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra: Minimize the Maximum Duty in Multi-interface Networks. Algorithmica 63(1-2): 274-295 (2012)

Marc Demange, Gabriele Di Stefano, Benjamin Leroy-Beaulieu: On the online track assignment problem. Discrete Applied Mathematics 160(7-8): 1072-1093 (2012)

Gabriele Di Stefano: Distance-hereditary comparability graphs. Discrete Applied Mathematics 160(18): 2669-2680 (2012)

Serafino Cicerone, Gabriele Di Stefano, Michael Schachtebeck, Anita Schöbel: Multi-stage recovery robustness for optimization problems: A new concept for planning under disturbances. Inf. Sci. 190: 107-126 (2012)

Gabriele Di Stefano, Alfredo Navarra: Scintillae: How to Approach Computing Systems by Means of Cellular Automata. ACRI 2012: 534-543

Gianlorenzo D'Angelo, Gabriele Di Stefano, Ralf Klasing, Alfredo Navarra: Gathering of Robots on Anonymous Grids without Multiplicity Detection. SIROCCO 2012: 327-338

Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra: How to Gather Asynchronous Oblivious Robots on Anonymous Rings. DISC 2012: 326-340

Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra, Maria Cristina Pinotti: Recoverable Robust Timetables: An Algorithmic Approach on Trees. IEEE Trans. Computers 60(3): 433-446 (2011)

Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra: Maximum flow and minimum-cost flow in multi-interface networks. ICUIMC 2011: 19

Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra: Gathering of Six Robots on Anonymous Symmetric Rings. SIROCCO 2011: 174-185

Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra: Min-Max Coverage in Multi-interface Networks. SOFSEM 2011: 190-201

Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra: Bandwidth Constrained Multi-interface Networks. SOFSEM 2011: 202-213

Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni: Partially dynamic efficient algorithms for distributed shortest paths. Theor. Comput. Sci. 411(7-9): 1013-1037 (2010)

Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra: Minimizing the Maximum Duty for Connectivity in Multi-Interface Networks. COCOA (2) 2010: 254-267

Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, Vinicio Maurizio: A New Fully Dynamic Algorithm for Distributed Shortest Paths and Its Experimental Evaluation. SEA 2010: 59-70

Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, Alfredo Navarra: Recoverable Robustness for Train Shunting Problems. Algorithmic Operations Research 4(2): 102-116 (2009)

Sabine Cornelsen, Gabriele Di Stefano: Treelike comparability graphs. Discrete Applied Mathematics 157(8): 1711-1722 (2009)

Gabriele Di Stefano: Distance-Hereditary Comparability Graphs. Electronic Notes in Discrete Mathematics 35: 227-233 (2009)

Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, Alfredo Navarra: Recoverable robust timetabling for single delay: Complexity and polynomial algorithms for special cases. J. Comb. Optim. 18(3): 229-257 (2009)

Jens Clausen, Gabriele Di Stefano: ATMOS 2009 Preface -- 9th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems. ATMOS 2009

Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra, Maria Cristina Pinotti: Recoverable Robust Timetables on Trees. COCOA 2009: 451-462

Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra: Evaluation of Recoverable-Robust Timetables on Tree Networks. IWOCA 2009: 24-35

Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, Alfredo Navarra, Michael Schachtebeck, Anita Schöbel: Recoverable Robustness in Shunting and Timetabling. Robust and Online Large-Scale Optimization 2009: 28-60

Jens Clausen, Gabriele Di Stefano (Eds.): ATMOS 2009 - 9th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems, IT University of Copenhagen, Denmark, September 10, 2009. OASICS 12, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany 2009

Marc Demange, Gabriele Di Stefano, Benjamin Leroy-Beaulieu: Online Bounded Coloring of Permutation and Overlap Graphs. Electronic Notes in Discrete Mathematics 30: 213-218 (2008)

Gabriele Di Stefano, Alberto Petricola: A Distributed AOA Based Localization Algorithm for Wireless Sensor Networks. JCP 3(4): 1-8 (2008)

Gabriele Di Stefano, Stefan Krause, Marco E. Lübbecke, Uwe T. Zimmermann: On minimum k-modal partitions of permutations. J. Discrete Algorithms 6(3): 381-392 (2008)

Francesco Bruera, Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni: Dynamic Multi-level Overlay Graphs for Shortest Paths. Mathematics in Computer Science 1(4): 709-736 (2008)

Serafino Cicerone, Gabriele Di Stefano, Michael Schachtebeck, Anita Schöbel: Dynamic Algorithms for Recoverable Robustness Problems. ATMOS 2008

Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, Alfredo Navarra: Delay Management Problem: Complexity Results and Robust Algorithms. COCOA 2008: 458-468

Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, Alberto Petricola: Partially Dynamic Algorithms for Distributed Shortest Paths and their Experimental Evaluation. JCP 2(9): 16-26 (2007)

Sabine Cornelsen, Gabriele Di Stefano: Track assignment. J. Discrete Algorithms 5(2): 250-261 (2007)

Francesco Bruera, Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni: Maintenance of Multi-level Overlay Graphs for Timetable Queries. ATMOS 2007

Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, Alfredo Navarra: Robust Algorithms and Price of Robustness in Shunting Problems. ATMOS 2007

Gianlorenzo D'Angelo, Serafino Cicerone, Gabriele Di Stefano, Daniele Frigioni: Partially Dynamic Concurrent Update of Distributed Shortest Paths. ICCTA 2007: 32-38

Gabriele Di Stefano, Alberto Petricola, Christos D. Zaroliagis: On the Implementation of Parallel Shortest Path Algorithms on a Supercomputer. ISPA 2006: 406-417

Gabriele Di Stefano, Stefan Krause, Marco E. Lübbecke, Uwe T. Zimmermann: On Minimum k-Modal Partitions of Permutations. LATIN 2006: 374-385

Serafino Cicerone, Gabriele Di Stefano, Dagmar Handke: Self-spanner graphs. Discrete Applied Mathematics 150(1-3): 99-120 (2005)

Gabriele Di Stefano, Magnus Love Koci: A Graph Theoretical Approach To The Shunting Problem. Electr. Notes Theor. Comput. Sci. 92: 16-33 (2004)

Serafino Cicerone, Gabriele Di Stefano: Networks with small stretch number. J. Discrete Algorithms 2(4): 383-405 (2004)

Sabine Cornelsen, Gabriele Di Stefano: Platform Assignment. ATMOS 2004: 233-245

Sabine Cornelsen, Gabriele Di Stefano: Treelike Comparability Graphs: Characterization, Recognition, and Applications. WG 2004: 46-57

Serafino Cicerone, Gabriele Di Stefano: (k, +)-distance-hereditary graphs. J. Discrete Algorithms 1(3-4): 281-302 (2003)

Serafino Cicerone, Gabriele Di Stefano, Daniele Frigioni, Umberto Nanni: A fully dynamic algorithm for distributed shortest paths. Theor. Comput. Sci. 297(1-3): 83-102 (2003)

Serafino Cicerone, Gabriele Di Stefano, Michele Flammini: Static and dynamic low-congested interval routing schemes. Theor. Comput. Sci. 276(1-2): 315-354 (2002)

Serafino Cicerone, Gabriele Di Stefano: Graphs with bounded induced distance. Discrete Applied Mathematics 108(1-2): 3-21 (2001)

Serafino Cicerone, Gabriele Di Stefano, Michele Flammini: Compact-Port Routing Models and Applications to Distance-Hereditary Graphs. J. Parallel Distrib. Comput. 61(10): 1472-1488 (2001)

Serafino Cicerone, Gianluca D'Ermiliis, Gabriele Di Stefano: (k, +)-Distance-Hereditary Graphs. WG 2001: 66-77

Serafino Cicerone, Gabriele Di Stefano, Michele Flammini: Low-congested interval routing schemes for hypercubelike networks. Networks 36(3): 191-201 (2000)

Serafino Cicerone, Gabriele Di Stefano, Daniele Frigioni, Umberto Nanni: A Fully Dynamic Algorithm for Distributed Shortest Paths. LATIN 2000: 247-257

Serafino Cicerone, Gabriele Di Stefano: Networks with Small Stretch Number. WG 2000: 95-106

Serafino Cicerone, Gabriele Di Stefano: On the Extension of Bipartite to Parity Graphs. Discrete Applied Mathematics 95(1-3): 181-195 (1999)

Serafino Cicerone, Gabriele Di Stefano: Graph Classes Between Parity and Distance-hereditary Graphs. Discrete Applied Mathematics 95(1-3): 197-216 (1999)

Serafino Cicerone, Gabriele Di Stefano, Dagmar Handke: Survivable Networks with Bounded Delay: The Edge Failure Case. ISAAC 1999: 205-214

Serafino Cicerone, Gabriele Di Stefano, Michele Flammini: Compact-Port Routing Models and Applications to Distance-Hereditary Graphs. SIROCCO 1999: 62-77

Serafino Cicerone, Gabriele Di Stefano, Michele Flammini: Static and Dynamic Low-Congested Interval Routing Schemes. ICALP 1998: 592-603

Serafino Cicerone, Gabriele Di Stefano: Graphs with Bounded Induced Distance. WG 1998: 177-191

Serafino Cicerone, Gabriele Di Stefano: On the Equivalence in Complexity among Basic Problems on Bipartite and Parity Graphs. ISAAC 1997: 354-363

Gabriele Di Stefano: A Routing Algorithm for Networks Based on Distance-Hereditary Topologies. SIROCCO 1996: 141-151

Gabriele Di Stefano, M. V. Marabello, Alessandro D'Atri: An Application of the MILFORD System to Handle Radiological Data. CISM - Advances in Database Systems 1993: 181-200