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

Henzinger MH, Jin B, Peng R, Williamson DP. 2023. A combinatorial cut-toggling algorithm for solving Laplacian linear systems. Algorithmica. 85, 2680–3716.

Alistarh D-A, Nadiradze G, Sabour A. 2022. Dynamic averaging load balancing on cycles. Algorithmica. 84(4), 1007–1029.

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

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

Dvoák W, Henzinger MH, Williamson DP. 2017. Maximizing a submodular function with viability constraints. Algorithmica. 77(1), 152–172.

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

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

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

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

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

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