The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Gabriele Di Stefano: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Gabriele Di Stefano, M. V. Marabello, Alessandro D'Atri
    An Application of the MILFORD System to Handle Radiological Data. [Citation Graph (0, 0)][DBLP]
    CISM - Advances in Database Systems, 1993, pp:181-200 [Conf]
  2. Serafino Cicerone, Gabriele Di Stefano, Michele Flammini
    Static and Dynamic Low-Congested Interval Routing Schemes. [Citation Graph (0, 0)][DBLP]
    ICALP, 1998, pp:592-603 [Conf]
  3. Serafino Cicerone, Gabriele Di Stefano
    On the Equivalence in Complexity among Basic Problems on Bipartite and Parity Graphs. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1997, pp:354-363 [Conf]
  4. Serafino Cicerone, Gabriele Di Stefano, Dagmar Handke
    Survivable Networks with Bounded Delay: The Edge Failure Case. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1999, pp:205-214 [Conf]
  5. Gabriele Di Stefano, Alberto Petricola, Christos D. Zaroliagis
    On the Implementation of Parallel Shortest Path Algorithms on a Supercomputer. [Citation Graph (0, 0)][DBLP]
    ISPA, 2006, pp:406-417 [Conf]
  6. Serafino Cicerone, Gabriele Di Stefano, Daniele Frigioni, Umberto Nanni
    A Fully Dynamic Algorithm for Distributed Shortest Paths. [Citation Graph (0, 0)][DBLP]
    LATIN, 2000, pp:247-257 [Conf]
  7. Gabriele Di Stefano, Stefan Krause, Marco E. Lübbecke, Uwe T. Zimmermann
    On Minimum k-Modal Partitions of Permutations. [Citation Graph (0, 0)][DBLP]
    LATIN, 2006, pp:374-385 [Conf]
  8. Serafino Cicerone, Gabriele Di Stefano, Michele Flammini
    Compact-Port Routing Models and Applications to Distance-Hereditary Graphs. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 1999, pp:62-77 [Conf]
  9. Gabriele Di Stefano
    A Routing Algorithm for Networks Based on Distance-Hereditary Topologies. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 1996, pp:141-151 [Conf]
  10. Serafino Cicerone, Gianluca D'Ermiliis, Gabriele Di Stefano
    (k, +)-Distance-Hereditary Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 2001, pp:66-77 [Conf]
  11. Serafino Cicerone, Gabriele Di Stefano
    Networks with Small Stretch Number. [Citation Graph (0, 0)][DBLP]
    WG, 2000, pp:95-106 [Conf]
  12. Serafino Cicerone, Gabriele Di Stefano
    Graphs with Bounded Induced Distance. [Citation Graph (0, 0)][DBLP]
    WG, 1998, pp:177-191 [Conf]
  13. Sabine Cornelsen, Gabriele Di Stefano
    Treelike Comparability Graphs: Characterization, Recognition, and Applications. [Citation Graph (0, 0)][DBLP]
    WG, 2004, pp:46-57 [Conf]
  14. Gianlorenzo D'Angelo, Serafino Cicerone, Gabriele Di Stefano, Daniele Frigioni
    Partially Dynamic Concurrent Update of Distributed Shortest Paths. [Citation Graph (0, 0)][DBLP]
    ICCTA, 2007, pp:32-38 [Conf]
  15. Serafino Cicerone, Gabriele Di Stefano
    Graphs with bounded induced distance. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:108, n:1-2, pp:3-21 [Journal]
  16. Serafino Cicerone, Gabriele Di Stefano
    On the Extension of Bipartite to Parity Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:95, n:1-3, pp:181-195 [Journal]
  17. Serafino Cicerone, Gabriele Di Stefano
    Graph Classes Between Parity and Distance-hereditary Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:95, n:1-3, pp:197-216 [Journal]
  18. Serafino Cicerone, Gabriele Di Stefano, Dagmar Handke
    Self-spanner graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:150, n:1-3, pp:99-120 [Journal]
  19. Gabriele Di Stefano, Magnus Love Koci
    A Graph Theoretical Approach To The Shunting Problem. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2004, v:92, n:, pp:16-33 [Journal]
  20. Serafino Cicerone, Gabriele Di Stefano
    (k, +)-distance-hereditary graphs. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2003, v:1, n:3-4, pp:281-302 [Journal]
  21. Serafino Cicerone, Gabriele Di Stefano
    Networks with small stretch number. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2004, v:2, n:4, pp:383-405 [Journal]
  22. Sabine Cornelsen, Gabriele Di Stefano
    Track assignment. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2007, v:5, n:2, pp:250-261 [Journal]
  23. Serafino Cicerone, Gabriele Di Stefano, Michele Flammini
    Compact-Port Routing Models and Applications to Distance-Hereditary Graphs. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2001, v:61, n:10, pp:1472-1488 [Journal]
  24. Serafino Cicerone, Gabriele Di Stefano, Michele Flammini
    Low-congested interval routing schemes for hypercubelike networks. [Citation Graph (0, 0)][DBLP]
    Networks, 2000, v:36, n:3, pp:191-201 [Journal]
  25. Serafino Cicerone, Gabriele Di Stefano, Michele Flammini
    Static and dynamic low-congested interval routing schemes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:276, n:1-2, pp:315-354 [Journal]
  26. Serafino Cicerone, Gabriele Di Stefano, Daniele Frigioni, Umberto Nanni
    A fully dynamic algorithm for distributed shortest paths. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:297, pp:83-102 [Journal]

  27. A New Fully Dynamic Algorithm for Distributed Shortest Paths and Its Experimental Evaluation. [Citation Graph (, )][DBLP]


  28. Delay Management Problem: Complexity Results and Robust Algorithms. [Citation Graph (, )][DBLP]


  29. Recoverable Robust Timetables on Trees. [Citation Graph (, )][DBLP]


  30. Maintenance of Multi-level Overlay Graphs for Timetable Queries. [Citation Graph (, )][DBLP]


  31. Robust Algorithms and Price of Robustness in Shunting Problems. [Citation Graph (, )][DBLP]


  32. ATMOS 2009 Preface -- 9th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems. [Citation Graph (, )][DBLP]


  33. Platform Assignment. [Citation Graph (, )][DBLP]


  34. Dynamic Algorithms for Recoverable Robustness Problems. [Citation Graph (, )][DBLP]


  35. Evaluation of Recoverable-Robust Timetables on Tree Networks. [Citation Graph (, )][DBLP]


  36. Treelike comparability graphs. [Citation Graph (, )][DBLP]


Search in 0.018secs, Finished in 0.020secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002