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="Italiano, G.F."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Does path cleaning help in dynamic all-pairs shortest paths?
C. Demetrescu
,
P. Faruolo
,
G.F. Italiano
,
M. Thorup
Lecture Notes in Computer Science
4168
, 2006, pp. 732-743
Dynamically switching vertices in planar graphs
D. Frigioni
,
G.F. Italiano
Algorithmica
28
(1), 2000, pp. 76-103
Maintaining spanning trees of small diameter
G.F. Italiano
,
R. Ramaswami
Algorithmica
22
(3), 1998, pp. 275-304
Decremental 2- and 3-connectivity on planar graphs
D. Giammarresi
,
G.F. Italiano
Algorithmica
16
, 1996, pp. 263-287
Sparse dynamic programming I: Linear cost functions
D. Eppstein
,
Z. Galil
,
R. Giancarlo
,
G.F. Italiano
Journal of the ACM
39
(3), 1992, July, pp. 519-545
Sparse dynamic programming II: Convex and concave cost functions
D. Eppstein
,
Z. Galil
,
R. Giancarlo
,
G.F. Italiano
Journal of the ACM
39
(3), 1992, July, pp. 546-567
Maintaining biconnected components of dynamic planar graphs
Z. Galil
,
G.F. Italiano
Lecture Notes in Computer Science
510
, 1991, pp. 339-350
Getting back to the past in the union-find problem
G. Gambosi
,
G.F. Italiano
,
M. Talamo
Lecture Notes in Computer Science
294
, 1988, pp. 8-17
Finding paths and deleting edges in directed acyclic graphs
G.F. Italiano
Information Processing Letters
28
(1), 1988, May, pp. 5-11
Amortized efficiency of a path retrieval data structure
G.F. Italiano
Theoretical Computer Science
48
(2-3), 1986, pp. 273-281