`Travelled to:`

1 × Canada

1 × Czech Republic

1 × Israel

1 × Japan

2 × Italy

2 × Spain

5 × USA

`Collaborated with:`

Z.Galil C.Demetrescu R.Grossi I.Finocchi R.Ramaswami S.Bhattacharya M.Henzinger F.Grandoni N.Sarnak L.Georgiadis L.Laura N.Parotsidis Y.Nussbaum P.Sankowski C.Wulff-Nilsen D.Eppstein T.H.Spencer

`Talks about:`

dynam (7) algorithm (5) planar (4) graph (4) maintain (3) shortest (2) problem (2) presenc (2) connect (2) search (2)

## Person: Giuseppe F. Italiano

### DBLP: Italiano:Giuseppe_F=

### Facilitated 1 volumes:

### Contributed to:

### Wrote 14 papers:

- ICALP-v1-2015-BhattacharyaHI #algorithm #design
- Design of Dynamic Algorithms via Primal-Dual Method (SB, MH, GFI), pp. 206–218.
- ICALP-v1-2015-GeorgiadisILP #graph
- 2-Vertex Connectivity in Directed Graphs (LG, GFI, LL, NP), pp. 605–616.
- STOC-2011-ItalianoNSW #algorithm #graph
- Improved algorithms for min cut and max flow in undirected planar graphs (GFI, YN, PS, CWN), pp. 313–322.
- ICALP-v1-2006-FinocchiGI #fault #memory management #sorting
- Optimal Resilient Sorting and Searching in the Presence of Memory Faults (IF, FG, GFI), pp. 286–298.
- STOC-2004-FinocchiI #fault #memory management #sorting
- Sorting and searching in the presence of memory faults (without redundancy) (IF, GFI), pp. 101–110.
- STOC-2003-DemetrescuI #approach
- A new approach to dynamic all pairs shortest paths (CD, GFI), pp. 159–166.
- ICALP-2002-DemetrescuI #bound #trade-off
- Improved Bounds and New Trade-Offs for Dynamic All Pairs Shortest Paths (CD, GFI), pp. 633–643.
- ICALP-1999-GrossiI #data type #linked data #maintenance #multi #open data #performance
- Efficient Techniques for Maintaining Multidimensional Keys in Linked Data Structures (RG, GFI), pp. 372–381.
- ICALP-1997-GrossiI #algorithm #order #performance #problem
- Efficient Splitting and Merging Algorithms for Order Decomposable Problems (RG, GFI), pp. 605–615.
- ICALP-1994-ItalianoR #maintenance
- Maintaining Spanning Trees of Small Diameter (GFI, RR), pp. 227–238.
- STOC-1993-EppsteinGIS #algorithm #graph
- Separator based sparsification for dynamic planar graph algorithms (DE, ZG, GFI, THS), pp. 208–217.
- STOC-1992-GalilIS #testing
- Fully Dynamic Planarity Testing (ZG, GFI, NS), pp. 495–506.
- ICALP-1991-GalilI #component #graph #maintenance
- Maintaining Biconnected Components of Dynamic Planar Graphs (ZG, GFI), pp. 339–350.
- STOC-1991-GalilI #algorithm #problem
- Fully Dynamic Algorithms for Edge-Connectivity Problems (ZG, GFI), pp. 317–327.