1. D. Alberts and G. Cattaneo and G. F. Italiano. An empirical study of dynamic graph algorithms. Proc. 7th ACM-SIAM Symp. Discrete Algorithms, 1996, 192–201.
2. D. Alberts and M. R. Henzinger. Average case analysis of dynamic graph algorithms. Proc. 6th ACM-SIAM Symp. Discrete Algorithms, 1995, 312–321.
3. G. Amato, G. Cattaneo, G. F. Italiano. Experimental analysis of dynamic minimum spanning tree algorithms. Proc. 8th ACM-SIAM Symp. on Discrete Algorithms, 1997, 314–323.
4. D. Eppstein, Z. Galil, G.F. Italiano, and A. Nissenzweig. Sparsification—A technique for speeding up dynamic graph algorithms. Proc. 93rd IEEE Symp. on Foundations of Computer Science, 1992, 60–69.
5. D. Eppstein, Z. Galil, G. F. Italiano, T. H. Spencer, “Separator based sparsification 1: planarity testing and minimum spanning trees”, Journal of Computer and System Science, Special issue of STOC 93, vol. 52, no. 1 (1996), 3–27.