Handbook of graph theory JL Gross, J Yellen CRC press, 2003 | 1105 | 2003 |

On the optimal placement of web proxies in the internet B Li, MJ Golin, GF Italiano, X Deng, K Sohraby IEEE INFOCOM'99. Conference on Computer Communications. Proceedings …, 1999 | 573 | 1999 |

Sparsification—a technique for speeding up dynamic graph algorithms D Eppstein, Z Galil, GF Italiano, A Nissenzweig Journal of the ACM (JACM) 44 (5), 669-696, 1997 | 450 | 1997 |

A new approach to dynamic all pairs shortest paths C Demetrescu, GF Italiano Journal of the ACM (JACM) 51 (6), 968-992, 2004 | 357 | 2004 |

Dynamic graphs C Demetrescu, I Finocchi, GF Italiano Handbook on Data Structures and Applications. Boca Raton, FL, USA: Chapman …, 2005 | 300* | 2005 |

Data structures and algorithms for disjoint set union problems Z Galil, GF Italiano ACM Computing Surveys (CSUR) 23 (3), 319-344, 1991 | 221 | 1991 |

Incremental algorithms for minimal length paths G Ausiello, GF Italiano, AM Spaccamela, U Nanni Journal of Algorithms 12 (4), 615-638, 1991 | 219 | 1991 |

Dynamic graph algorithms Z Galil, GF Italiano Springer, 1998 | 207 | 1998 |

Maintenance of a minimum spanning forest in a dynamic plane graph D Eppstein, GF Italiano, R Tamassia, RE Tarjan, J Westbrook, M Yung Journal of algorithms 13 (1), 33-54, 1992 | 200 | 1992 |

Sparse dynamic programming I: linear cost functions D Eppstein, Z Galil, R Giancarlo, GF Italiano Journal of the ACM (JACM) 39 (3), 519-545, 1992 | 197* | 1992 |

Sparse dynamic programming I: linear cost functions D Eppstein, Z Galil, R Giancarlo, GF Italiano Journal of the ACM (JACM) 39 (3), 519-545, 1992 | 167 | 1992 |

Amortized efficiency of a path retrieval data structure GF Italiano Theoretical Computer Science 48, 273-281, 1986 | 150 | 1986 |

New algorithms for examination timetabling M Caramia, P Dell’Olmo, GF Italiano International Workshop on Algorithm Engineering, 230-241, 2000 | 142 | 2000 |

Experimental analysis of dynamic all pairs shortest path algorithms C Demetrescu, GF Italiano ACM Transactions on Algorithms (TALG) 2 (4), 578-601, 2006 | 138 | 2006 |

Finding paths and deleting edges in directed acyclic graphs GF Italiano Information Processing Letters 28 (1), 5-11, 1988 | 127 | 1988 |

Fully dynamic transitive closure: breaking through the O (n/sup 2/) barrier C Demetrescu, GF Italiano Proceedings 41st Annual Symposium on Foundations of Computer Science, 381-389, 2000 | 119 | 2000 |

Improved algorithms for min cut and max flow in undirected planar graphs GF Italiano, Y Nussbaum, P Sankowski, C Wulff-Nilsen Proceedings of the forty-third annual ACM symposium on Theory of computing …, 2011 | 89 | 2011 |

Finding strong bridges and strong articulation points in linear time GF Italiano, L Laura, F Santaroni Theoretical Computer Science 447, 74-84, 2012 | 88 | 2012 |

Restoration algorithms for virtual private networks in the hose model GF Italiano, R Rastogi, B Yener Proceedings. Twenty-First Annual Joint Conference of the IEEE Computer and …, 2002 | 87 | 2002 |

Sparse dynamic programming II: convex and concave cost functions D Eppstein, Z Galil, R Giancarlo, GF Italiano Journal of the ACM (JACM) 39 (3), 546-567, 1992 | 84 | 1992 |