Faster algorithms for all-pairs bounded min-cuts
- Amir Abboud
- Loukas Georgiadis
- et al.
- 2019
- ICALP 2019
Publications
Date
Featured collections
Popular topics
12 results for Giuseppe F. Italiano
Fully Dynamic Planarity Testing with Applications
- Zvi Galil
- Giuseppe F. Italiano
- et al.
- 1999
- Journal of the ACM
Maintaining spanning trees of small diameter
- G.F. Italiano
- Rajiv Ramaswami
- 1998
- Algorithmica (New York)
Decremental 2- and 3-Connectivity on Planar Graphs
- D. Giammarresi
- G.F. Italiano
- 1996
- Algorithmica (New York)
Separator based sparsification for dynamic planar graph algorithms
- David Eppstein
- Zvi Galil
- et al.
- 1993
- STOC 1993
Sparsification-a technique for speeding up dynamic graph algorithms
- David Eppstein
- Zvi Galil
- et al.
- 1992
- FOCS 1992
Fully dynamic planarity testing
- Zvi Galil
- Giuseppe F. Italiano
- et al.
- 1992
- STOC 1992
Sparse Dynamic Programming I: Linear Cost Functions
- David Eppstein
- Zvi Galil
- et al.
- 1992
- Journal of the ACM
Sparse Dynamic Programming II: Convex and Concave Cost Functions
- David Eppstein
- Zvi Galil
- et al.
- 1992
- Journal of the ACM
Maintenance of a minimum spanning forest in a dynamic plane graph
- David Eppstein
- Giuseppe F Italiano
- et al.
- 1992
- Journal of Algorithms