1. D. Alberts, G. Cattaneo, G. F. Italiano, “An empirical study of dynamic graph algorithms”, ACM Journal on Experimental Algorithmics, vol. 2 (1997).
2. D. Alberts, G. Cattaneo, G. F. Italiano, U. Nanni, C. D. Zaroliagis “A Software Library of Dynamic Graph Algorithms”. Proc. Algorithms and Experiments (ALEX 98), Trento, Italy, February 9–11, 1998, R. Battiti and A. A. Bertossi (Eds), pp. 129–136.
3. D. Alberts, M. R. Henzinger, “Average Case Analysis of Dynamic Graph Algorithms”, Proc. 6th Symp. on Discrete Algorithms (1995), 312–321.
4. C.R. Aragon, R. Seidel, “Randomized search trees”, Proc. 30th Annual Symp. on Foundations of Computer Science (FOCS 89), 1989, pp. 540–545.
5. G. Amato, G. Cattaneo, G. F. Italiano, “Experimental Analysis of Dynamic Minimum Spanning Tree Algorithms”, Proc. 8th Annual ACM-SIAM Symposium on Discrete Algorithms, (1997), 5–7.