Lower bounds for fully dynamic connectivity problems in graphs
M.H. Henzinger, M.L. Fredman, Algorithmica 22 (1998) 351–362.
LibreCat: https://research-explorer.ista.ac.at/record/11681
DOI: 10.1007/pl00009228

Average-case analysis of dynamic graph algorithms
D. Alberts, M.H. Henzinger, Algorithmica 20 (1998) 31–60.
LibreCat: https://research-explorer.ista.ac.at/record/11680
DOI: 10.1007/pl00009186