The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Gabriele Di Stefano" ( http://dblp.L3S.de/Authors/Gabriele_Di_Stefano )

URL (Homepage):  http://gs.ing.univaq.it/~gabriele/  Author page on DBLP  Author page in RDF  Community of Gabriele Di Stefano in ASPL-2

Publication years (Num. hits)
1993-2001 (15) 2002-2007 (15) 2008-2009 (15) 2010-2012 (11)
Publication types (Num. hits)
article(26) incollection(1) inproceedings(28) proceedings(1)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 7 occurrences of 7 keywords

Results
Found 56 publication records. Showing 56 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra Minimize the Maximum Duty in Multi-interface Networks. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Serafino Cicerone, Gabriele Di Stefano, Michael Schachtebeck, Anita Schöbel Multi-stage recovery robustness for optimization problems: A new concept for planning under disturbances. Search on Bibsonomy Inf. Sci. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Marc Demange, Gabriele Di Stefano, Benjamin Leroy-Beaulieu On the online track assignment problem. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra, Maria Cristina Pinotti Recoverable Robust Timetables: An Algorithmic Approach on Trees. Search on Bibsonomy IEEE Trans. Computers The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra Maximum flow and minimum-cost flow in multi-interface networks. Search on Bibsonomy ICUIMC The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra Gathering of Six Robots on Anonymous Symmetric Rings. Search on Bibsonomy SIROCCO The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra Min-Max Coverage in Multi-interface Networks. Search on Bibsonomy SOFSEM The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra Bandwidth Constrained Multi-interface Networks. Search on Bibsonomy SOFSEM The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni Partially dynamic efficient algorithms for distributed shortest paths. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, Vinicio Maurizio A New Fully Dynamic Algorithm for Distributed Shortest Paths and Its Experimental Evaluation. Search on Bibsonomy SEA The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra Minimizing the Maximum Duty for Connectivity in Multi-Interface Networks. Search on Bibsonomy COCOA The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Gabriele Di Stefano Distance-Hereditary Comparability Graphs. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, Alfredo Navarra Recoverable robust timetabling for single delay: Complexity and polynomial algorithms for special cases. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, Alfredo Navarra Recoverable Robustness for Train Shunting Problems. Search on Bibsonomy Algorithmic Operations Research The full citation details ... 2009 DBLP  BibTeX  RDF
1Sabine Cornelsen, Gabriele Di Stefano Treelike comparability graphs. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, Alfredo Navarra, Michael Schachtebeck, Anita Schöbel Recoverable Robustness in Shunting and Timetabling. Search on Bibsonomy Robust and Online Large-Scale Optimization The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Jens Clausen, Gabriele Di Stefano ATMOS 2009 Preface -- 9th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems. Search on Bibsonomy ATMOS The full citation details ... 2009 DBLP  BibTeX  RDF
1Jens 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 Search on Bibsonomy ATMOS The full citation details ... 2009 DBLP  BibTeX  RDF
1Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra, Maria Cristina Pinotti Recoverable Robust Timetables on Trees. Search on Bibsonomy COCOA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra Evaluation of Recoverable-Robust Timetables on Tree Networks. Search on Bibsonomy IWOCA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Marc Demange, Gabriele Di Stefano, Benjamin Leroy-Beaulieu Online Bounded Coloring of Permutation and Overlap Graphs. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Gabriele Di Stefano, Alberto Petricola A Distributed AOA Based Localization Algorithm for Wireless Sensor Networks. Search on Bibsonomy JCP The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Francesco Bruera, Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni Dynamic Multi-level Overlay Graphs for Shortest Paths. Search on Bibsonomy Mathematics in Computer Science The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Shortest paths algorithms, speed-up techniques
1Gabriele Di Stefano, Stefan Krause, Marco E. Lübbecke, Uwe T. Zimmermann On minimum k-modal partitions of permutations. Search on Bibsonomy J. Discrete Algorithms The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Serafino Cicerone, Gabriele Di Stefano, Michael Schachtebeck, Anita Schöbel Dynamic Algorithms for Recoverable Robustness Problems. Search on Bibsonomy ATMOS The full citation details ... 2008 DBLP  BibTeX  RDF
1Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, Alfredo Navarra Delay Management Problem: Complexity Results and Robust Algorithms. Search on Bibsonomy COCOA The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, Alberto Petricola Partially Dynamic Algorithms for Distributed Shortest Paths and their Experimental Evaluation. Search on Bibsonomy JCP The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Sabine Cornelsen, Gabriele Di Stefano Track assignment. Search on Bibsonomy J. Discrete Algorithms The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Francesco Bruera, Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni Maintenance of Multi-level Overlay Graphs for Timetable Queries. Search on Bibsonomy ATMOS The full citation details ... 2007 DBLP  BibTeX  RDF
1Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, Alfredo Navarra Robust Algorithms and Price of Robustness in Shunting Problems. Search on Bibsonomy ATMOS The full citation details ... 2007 DBLP  BibTeX  RDF
1Gianlorenzo D'Angelo, Serafino Cicerone, Gabriele Di Stefano, Daniele Frigioni Partially Dynamic Concurrent Update of Distributed Shortest Paths. Search on Bibsonomy ICCTA The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Gabriele Di Stefano, Alberto Petricola, Christos D. Zaroliagis On the Implementation of Parallel Shortest Path Algorithms on a Supercomputer. Search on Bibsonomy ISPA The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Gabriele Di Stefano, Stefan Krause, Marco E. Lübbecke, Uwe T. Zimmermann On Minimum k-Modal Partitions of Permutations. Search on Bibsonomy LATIN The full citation details ... 2006 DBLP  DOI  BibTeX  RDF monotone sequence, k-modal sequence, cocoloring, approximation algorithm, online algorithm, Mixed integer program, hardness, LP rounding
1Serafino Cicerone, Gabriele Di Stefano, Dagmar Handke Self-spanner graphs. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Gabriele Di Stefano, Magnus Love Koci A Graph Theoretical Approach To The Shunting Problem. Search on Bibsonomy Electr. Notes Theor. Comput. Sci. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Serafino Cicerone, Gabriele Di Stefano Networks with small stretch number. Search on Bibsonomy J. Discrete Algorithms The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Sabine Cornelsen, Gabriele Di Stefano Treelike Comparability Graphs: Characterization, Recognition, and Applications. Search on Bibsonomy WG The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Sabine Cornelsen, Gabriele Di Stefano Platform Assignment. Search on Bibsonomy ATMOS The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Serafino Cicerone, Gabriele Di Stefano, Daniele Frigioni, Umberto Nanni A fully dynamic algorithm for distributed shortest paths. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Serafino Cicerone, Gabriele Di Stefano (k, +)-distance-hereditary graphs. Search on Bibsonomy J. Discrete Algorithms The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Serafino Cicerone, Gabriele Di Stefano, Michele Flammini Static and dynamic low-congested interval routing schemes. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Serafino Cicerone, Gabriele Di Stefano, Michele Flammini Compact-Port Routing Models and Applications to Distance-Hereditary Graphs. Search on Bibsonomy J. Parallel Distrib. Comput. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Serafino Cicerone, Gabriele Di Stefano Graphs with bounded induced distance. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Serafino Cicerone, Gianluca D'Ermiliis, Gabriele Di Stefano (k, +)-Distance-Hereditary Graphs. Search on Bibsonomy WG The full citation details ... 2001 DBLP  BibTeX  RDF
1Serafino Cicerone, Gabriele Di Stefano, Michele Flammini Low-congested interval routing schemes for hypercubelike networks. Search on Bibsonomy Networks The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Serafino Cicerone, Gabriele Di Stefano Networks with Small Stretch Number. Search on Bibsonomy WG The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Serafino Cicerone, Gabriele Di Stefano, Daniele Frigioni, Umberto Nanni A Fully Dynamic Algorithm for Distributed Shortest Paths. Search on Bibsonomy LATIN The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Serafino Cicerone, Gabriele Di Stefano On the Extension of Bipartite to Parity Graphs. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Serafino Cicerone, Gabriele Di Stefano Graph Classes Between Parity and Distance-hereditary Graphs. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Serafino Cicerone, Gabriele Di Stefano, Michele Flammini Compact-Port Routing Models and Applications to Distance-Hereditary Graphs. Search on Bibsonomy SIROCCO The full citation details ... 1999 DBLP  BibTeX  RDF
1Serafino Cicerone, Gabriele Di Stefano, Dagmar Handke Survivable Networks with Bounded Delay: The Edge Failure Case. Search on Bibsonomy ISAAC The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Serafino Cicerone, Gabriele Di Stefano Graphs with Bounded Induced Distance. Search on Bibsonomy WG The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1Serafino Cicerone, Gabriele Di Stefano, Michele Flammini Static and Dynamic Low-Congested Interval Routing Schemes. Search on Bibsonomy ICALP The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1Serafino Cicerone, Gabriele Di Stefano On the Equivalence in Complexity among Basic Problems on Bipartite and Parity Graphs. Search on Bibsonomy ISAAC The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
1Gabriele Di Stefano A Routing Algorithm for Networks Based on Distance-Hereditary Topologies. Search on Bibsonomy SIROCCO The full citation details ... 1996 DBLP  BibTeX  RDF
1Gabriele Di Stefano, M. V. Marabello, Alessandro D'Atri An Application of the MILFORD System to Handle Radiological Data. Search on Bibsonomy CISM - Advances in Database Systems The full citation details ... 1993 DBLP  BibTeX  RDF
Displaying result #1 - #56 of 56 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.