dblp.uni-trier.dewww.dagstuhl.dewww.uni-trier.de

Gabriele Di Stefano (Selection)

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo


54Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSerafino 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)
47Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSerafino 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
46Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSerafino 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)
41Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSerafino 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
40Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSerafino 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)
37Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSerafino 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)
36Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSerafino Cicerone, Gabriele Di Stefano, Michael Schachtebeck, Anita Schöbel: Dynamic Algorithms for Recoverable Robustness Problems. ATMOS 2008
35Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSerafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, Alfredo Navarra: Delay Management Problem: Complexity Results and Robust Algorithms. COCOA 2008: 458-468
31Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrancesco 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)
30Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrancesco Bruera, Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni: Maintenance of Multi-level Overlay Graphs for Timetable Queries. ATMOS 2007
29Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSerafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, Alfredo Navarra: Robust Algorithms and Price of Robustness in Shunting Problems. ATMOS 2007
28Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGianlorenzo D'Angelo, Serafino Cicerone, Gabriele Di Stefano, Daniele Frigioni: Partially Dynamic Concurrent Update of Distributed Shortest Paths. ICCTA 2007: 32-38
26Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSerafino 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)
23Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSerafino Cicerone, Gabriele Di Stefano, Dagmar Handke: Self-spanner graphs. Discrete Applied Mathematics 150(1-3): 99-120 (2005)
19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSerafino Cicerone, Gabriele Di Stefano: Networks with small stretch number. J. Discrete Algorithms 2(4): 383-405 (2004)
18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSerafino Cicerone, Gabriele Di Stefano: (k, +)-distance-hereditary graphs. J. Discrete Algorithms 1(3-4): 281-302 (2003)
17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSerafino 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)
16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSerafino Cicerone, Gabriele Di Stefano, Michele Flammini: Static and dynamic low-congested interval routing schemes. Theor. Comput. Sci. 276(1-2): 315-354 (2002)
15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSerafino Cicerone, Gianluca D'Ermiliis, Gabriele Di Stefano: (k, +)-Distance-Hereditary Graphs. WG 2001: 66-77
14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSerafino Cicerone, Gabriele Di Stefano: Graphs with bounded induced distance. Discrete Applied Mathematics 108(1-2): 3-21 (2001)
13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSerafino 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)
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSerafino Cicerone, Gabriele Di Stefano, Daniele Frigioni, Umberto Nanni: A Fully Dynamic Algorithm for Distributed Shortest Paths. LATIN 2000: 247-257
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSerafino Cicerone, Gabriele Di Stefano: Networks with Small Stretch Number. WG 2000: 95-106
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSerafino Cicerone, Gabriele Di Stefano, Michele Flammini: Low-congested interval routing schemes for hypercubelike networks. Networks 36(3): 191-201 (2000)
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSerafino Cicerone, Gabriele Di Stefano, Dagmar Handke: Survivable Networks with Bounded Delay: The Edge Failure Case. ISAAC 1999: 205-214
8no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSerafino Cicerone, Gabriele Di Stefano, Michele Flammini: Compact-Port Routing Models and Applications to Distance-Hereditary Graphs. SIROCCO 1999: 62-77
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSerafino Cicerone, Gabriele Di Stefano: On the Extension of Bipartite to Parity Graphs. Discrete Applied Mathematics 95(1-3): 181-195 (1999)
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSerafino Cicerone, Gabriele Di Stefano: Graph Classes Between Parity and Distance-hereditary Graphs. Discrete Applied Mathematics 95(1-3): 197-216 (1999)
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSerafino Cicerone, Gabriele Di Stefano, Michele Flammini: Static and Dynamic Low-Congested Interval Routing Schemes. ICALP 1998: 592-603
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSerafino Cicerone, Gabriele Di Stefano: Graphs with Bounded Induced Distance. WG 1998: 177-191
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSerafino Cicerone, Gabriele Di Stefano: On the Equivalence in Complexity among Basic Problems on Bipartite and Parity Graphs. ISAAC 1997: 354-363

Selection of 31 from 57 records - Gabriele Di Stefano has 26 coauthors

Last update 2012-09-10 CET by the DBLP TeamThis material is Open Data Content released under the ODC-BY 1.0 license — See also our legal information page