Giuseppe F. Italiano
Univ. di Roma “Tor Vergata”, Dip. di Informatica, Sistemi e Produzione
http://www.info.uniroma2.it/~italiano/
italiano@info.uniroma2.it
Author, editor, or reviewer of:
- A software library of dynamic graph algorithms
- An empirical study of dynamic graph algorithms
- CATAI: Concurrent algorithms and data types animation over the Internet
- Data structures and algorithms for disjoint set union problems
- Decremental 2- and 3-connectivity on planar graphs
- Dynamic data structures for graphs
- Dynamic data structures for series parallel digraphs
- Dynamic graph algorithms
- Dynamically switching vertices in planar graphs
- Efficient algorithms for sequence analysis
- Efficient sequential and parallel algorithms for computing recovery points in trees and paths
- Experimental analysis of dynamic minimum spanning tree algorithms
- Fully dynamic algorithms for 2-edge-connectivity
- Fully dynamic planarity testing
- Fully dynamic planarity testing in planar embedded graphs
- Fully dynamic planarity testing with applications
- Improved sparsification
- Incremental algorithms for minimal length paths
- Maintaining biconnected components of dynamic planar graphs
- Maintaining dynamic minimum spanning trees: An experimental study
- Maintaining spanning trees of small diameter
- Maintaining the 3-edge connected components of a graph online
- Maintenance of a minimum spanning forest in a dynamic planar graph
- Preface to Festschrift for Zvi Galil
- Revised version of ”Efficient Cross-Trees for External Memory“
- Separator based sparsification for dynamic planar graph algorithms
- Separator based sparsification I: planarity testing and minimum spanning trees
- Separator based sparsification II: edge and vertex connectivity
- Sparse dynamic programming
- Sparse dynamic programming I: linear cost functions
- Sparse dynamic programming II: convex and concave cost functions
- Sparsification — A technique for speeding up dynamic graph algorithms
- Proc. 6th Eur. Symp. Algorithms (ESA 1998)
