Linear-time MaxCut in multigraphs parameterized above the Poljak-Turzík bound

A combinatorial cut-toggling algorithm for solving Laplacian linear systems
M. Henzinger, B. Jin, R. Peng, D.P. Williamson, Algorithmica 85 (2023) 2680–3716.

A simple algorithm for higher-order Delaunay mosaics and alpha shapes
H. Edelsbrunner, G.F. Osang, Algorithmica 85 (2023) 277–295.

Dynamic averaging load balancing on cycles

Dynamic clustering to minimize the sum of radii
M. Henzinger, D. Leniowski, C. Mathieu, Algorithmica 82 (2020) 3183–3194.

Deterministic dynamic matching in O(1) update time
S. Bhattacharya, D. Chakrabarty, M. Henzinger, Algorithmica 82 (2020) 1057–1080.

Maximizing a submodular function with viability constraints
W. Dvoák, M. Henzinger, D.P. Williamson, Algorithmica 77 (2017) 152–172.

Constructing a tree from homeomorphic subtrees, with applications to computational evolutionary biology
M. Henzinger, V. King, T. Warnow, Algorithmica 24 (1999) 1–13.

Average-case analysis of dynamic graph algorithms
D. Alberts, M. Henzinger, Algorithmica 20 (1998) 31–60.

Lower bounds for fully dynamic connectivity problems in graphs
M. Henzinger, M.L. Fredman, Algorithmica 22 (1998) 351–362.

Fully dynamic biconnectivity in graphs
M. Henzinger, Algorithmica 13 (1995) 503–538.

Searching for empty convex polygons
D. Dobkin, H. Edelsbrunner, M. Overmars, Algorithmica 5 (1990) 561–571.

Edge-skeletons in arrangements with applications
H. Edelsbrunner, Algorithmica 1 (1986) 93–109.