| 2008 |
|---|
| 36 | EE | Serafino Cicerone,
Gabriele Di Stefano,
Michael Schachtebeck,
Anita Schöbel:
Dynamic Algorithms for Recoverable Robustness Problems.
ATMOS 2008 |
| 35 | EE | Serafino Cicerone,
Gianlorenzo D'Angelo,
Gabriele Di Stefano,
Daniele Frigioni,
Alfredo Navarra:
Delay Management Problem: Complexity Results and Robust Algorithms.
COCOA 2008: 458-468 |
| 34 | EE | 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) |
| 33 | EE | 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) |
| 32 | EE | Gabriele Di Stefano,
Alberto Petricola:
A Distributed AOA Based Localization Algorithm for Wireless Sensor Networks.
JCP 3(4): 1-8 (2008) |
| 31 | EE | 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) |
| 2007 |
|---|
| 30 | EE | Francesco Bruera,
Serafino Cicerone,
Gianlorenzo D'Angelo,
Gabriele Di Stefano,
Daniele Frigioni:
Maintenance of Multi-level Overlay Graphs for Timetable Queries.
ATMOS 2007 |
| 29 | EE | Serafino Cicerone,
Gianlorenzo D'Angelo,
Gabriele Di Stefano,
Daniele Frigioni,
Alfredo Navarra:
Robust Algorithms and Price of Robustness in Shunting Problems.
ATMOS 2007 |
| 28 | EE | Gianlorenzo D'Angelo,
Serafino Cicerone,
Gabriele Di Stefano,
Daniele Frigioni:
Partially Dynamic Concurrent Update of Distributed Shortest Paths.
ICCTA 2007: 32-38 |
| 27 | EE | Sabine Cornelsen,
Gabriele Di Stefano:
Track assignment.
J. Discrete Algorithms 5(2): 250-261 (2007) |
| 26 | EE | 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) |
| 2006 |
|---|
| 25 | EE | Gabriele Di Stefano,
Alberto Petricola,
Christos D. Zaroliagis:
On the Implementation of Parallel Shortest Path Algorithms on a Supercomputer.
ISPA 2006: 406-417 |
| 24 | EE | Gabriele Di Stefano,
Stefan Krause,
Marco E. Lübbecke,
Uwe T. Zimmermann:
On Minimum k-Modal Partitions of Permutations.
LATIN 2006: 374-385 |
| 2005 |
|---|
| 23 | EE | Serafino Cicerone,
Gabriele Di Stefano,
Dagmar Handke:
Self-spanner graphs.
Discrete Applied Mathematics 150(1-3): 99-120 (2005) |
| 2004 |
|---|
| 22 | EE | Sabine Cornelsen,
Gabriele Di Stefano:
Platform Assignment.
ATMOS 2004: 233-245 |
| 21 | EE | Sabine Cornelsen,
Gabriele Di Stefano:
Treelike Comparability Graphs: Characterization, Recognition, and Applications.
WG 2004: 46-57 |
| 20 | EE | Gabriele Di Stefano,
Magnus Love Koci:
A Graph Theoretical Approach To The Shunting Problem.
Electr. Notes Theor. Comput. Sci. 92: 16-33 (2004) |
| 19 | EE | Serafino Cicerone,
Gabriele Di Stefano:
Networks with small stretch number.
J. Discrete Algorithms 2(4): 383-405 (2004) |
| 2003 |
|---|
| 18 | EE | Serafino Cicerone,
Gabriele Di Stefano:
(k, +)-distance-hereditary graphs.
J. Discrete Algorithms 1(3-4): 281-302 (2003) |
| 17 | EE | 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) |
| 2002 |
|---|
| 16 | EE | Serafino Cicerone,
Gabriele Di Stefano,
Michele Flammini:
Static and dynamic low-congested interval routing schemes.
Theor. Comput. Sci. 276(1-2): 315-354 (2002) |
| 2001 |
|---|
| 15 | EE | Serafino Cicerone,
Gianluca D'Ermiliis,
Gabriele Di Stefano:
(k, +)-Distance-Hereditary Graphs.
WG 2001: 66-77 |
| 14 | | Serafino Cicerone,
Gabriele Di Stefano:
Graphs with bounded induced distance.
Discrete Applied Mathematics 108(1-2): 3-21 (2001) |
| 13 | EE | 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) |
| 2000 |
|---|
| 12 | | Serafino Cicerone,
Gabriele Di Stefano,
Daniele Frigioni,
Umberto Nanni:
A Fully Dynamic Algorithm for Distributed Shortest Paths.
LATIN 2000: 247-257 |
| 11 | EE | Serafino Cicerone,
Gabriele Di Stefano:
Networks with Small Stretch Number.
WG 2000: 95-106 |
| 10 | EE | Serafino Cicerone,
Gabriele Di Stefano,
Michele Flammini:
Low-congested interval routing schemes for hypercubelike networks.
Networks 36(3): 191-201 (2000) |
| 1999 |
|---|
| 9 | EE | Serafino Cicerone,
Gabriele Di Stefano,
Dagmar Handke:
Survivable Networks with Bounded Delay: The Edge Failure Case.
ISAAC 1999: 205-214 |
| 8 | | Serafino Cicerone,
Gabriele Di Stefano,
Michele Flammini:
Compact-Port Routing Models and Applications to Distance-Hereditary Graphs.
SIROCCO 1999: 62-77 |
| 7 | EE | Serafino Cicerone,
Gabriele Di Stefano:
On the Extension of Bipartite to Parity Graphs.
Discrete Applied Mathematics 95(1-3): 181-195 (1999) |
| 6 | EE | Serafino Cicerone,
Gabriele Di Stefano:
Graph Classes Between Parity and Distance-hereditary Graphs.
Discrete Applied Mathematics 95(1-3): 197-216 (1999) |
| 1998 |
|---|
| 5 | EE | Serafino Cicerone,
Gabriele Di Stefano,
Michele Flammini:
Static and Dynamic Low-Congested Interval Routing Schemes.
ICALP 1998: 592-603 |
| 4 | | Serafino Cicerone,
Gabriele Di Stefano:
Graphs with Bounded Induced Distance.
WG 1998: 177-191 |
| 1997 |
|---|
| 3 | | Serafino Cicerone,
Gabriele Di Stefano:
On the Equivalence in Complexity among Basic Problems on Bipartite and Parity Graphs.
ISAAC 1997: 354-363 |
| 1996 |
|---|
| 2 | | Gabriele Di Stefano:
A Routing Algorithm for Networks Based on Distance-Hereditary Topologies.
SIROCCO 1996: 141-151 |
| 1993 |
|---|
| 1 | | 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 |
