Constant-time Dynamic ( +1)-Coloring
M.H. Henzinger, P. Peng, ACM Transactions on Algorithms 18 (2022).

A deamortization approach for dynamic spanner and dynamic maximal matching
A. Bernstein, S. Forster, M.H. Henzinger, ACM Transactions on Algorithms 17 (2021).

Graph sparsification for derandomizing massively parallel computation with low space
A. Czumaj, P. Davies, M. Parter, ACM Transactions on Algorithms 17 (2021).

Incremental exact min-cut in polylogarithmic amortized update time
G. Goranci, M.H. Henzinger, M. Thorup, ACM Transactions on Algorithms 14 (2018).

Sublinear-time maintenance of breadth-first spanning trees in partially dynamic networks
M.H. Henzinger, S. Krinninger, D. Nanongkai, ACM Transactions on Algorithms 13 (2017).