Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Stefano, Gabriele di"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A fully dynamic algorithm for distributed shortest paths
Serafino Cicerone
,
Gabriele Di Stefano
,
Daniele Frigioni
,
Umberto Nanni
Theoretical Computer Science
297
(1-3), 2003, pp. 83-102
Static and dynamic low-congested interval routing schemes
Serafino Cicerone
,
Gabriele Di Stefano
,
Michele Flammini
Theoretical Computer Science
276
(1-2), 2002, pp. 315-354
(k,+)
-distance-hereditary graphs
Serafino Cicerone
,
Gianluca D'Ermiliis
,
Gabriele di Stefano
Lecture Notes in Computer Science
2204
, 2001, pp. 66-77
Graphs with bounded induced distance
Serafino Cicerone
,
Gabriele Di Stefano
Discrete Applied Mathematics
108
(1-2), 2001, pp. 3-21
Compact-port routing models and applications to distance-hereditary graphs
Serafino Cicerone
,
Gabriele di Stefano
Journal Parallel Distributed Computing
61
(10), 2001, pp. 1472-1488
Networks with small stretch number
Serafino Cicerone
,
Gabriele di Stefano
Lecture Notes in Computer Science
1928
, 2000, pp. 95-106
Survivable networks with bounded delay: The edge failure case
Serafino Cicerone
,
Gabriele di Stefano
,
Dagmar Handke
Lecture Notes in Computer Science
1741
, 1999, pp. 205-214
On the extension of bipartite to parity graphs
Serafino Cicerone
,
Gabriele di Stefano
Discrete Applied Mathematics
95
(1-3), 1999, pp. 181-195
Graph classes between parity and distance-hereditary graphs
Serafino Cicerone
,
Gabriele di Stefano
Discrete Applied Mathematics
95
(1-3), 1999, pp. 197-216
Static and dynamic low-congested interval routing schemes
Serafino Cicerone
,
Gabriele di Stefano
,
Michele Flammini
Lecture Notes in Computer Science
1443
, 1998, pp. 592-603
Graphs with bounded induced distance
Serafino Cicerone
,
Gabriele di Stefano
Lecture Notes in Computer Science
1517
, 1998, pp. 177-191
On the equivalence in complexity among basic problems on bipartite and parity graphs
Serafino Cicerone
,
Gabriele di Stefano
Lecture Notes in Computer Science
1350
, 1997, pp. 354-363