Edelsbrunner, Herbert, and Georg F Osang. “A Simple Algorithm for Higher-Order Delaunay Mosaics and Alpha Shapes.”https://doi.org/10.1007/s00453-022-01027-6__Algorithmica. Springer Nature, 2023.https://doi.org/10.1007/s00453-022-01027-6 .

Henzinger, Monika H, Billy Jin, Richard Peng, and David P. Williamson. “A Combinatorial Cut-Toggling Algorithm for Solving Laplacian Linear Systems.”https://doi.org/10.1007/s00453-023-01154-8__Algorithmica. Springer Nature, 2023.https://doi.org/10.1007/s00453-023-01154-8 .

Alistarh, Dan-Adrian, Giorgi Nadiradze, and Amirmojtaba Sabour. “Dynamic Averaging Load Balancing on Cycles.”https://doi.org/10.1007/s00453-021-00905-9__Algorithmica. Springer Nature, 2021.https://doi.org/10.1007/s00453-021-00905-9 .

Bhattacharya, Sayan, Deeparnab Chakrabarty, and Monika H Henzinger. “Deterministic Dynamic Matching in O(1) Update Time.”https://doi.org/10.1007/s00453-019-00630-4__Algorithmica. Springer Nature, 2020.https://doi.org/10.1007/s00453-019-00630-4 .

Henzinger, Monika H, Dariusz Leniowski, and Claire Mathieu. “Dynamic Clustering to Minimize the Sum of Radii.”https://doi.org/10.1007/s00453-020-00721-7__Algorithmica. Springer Nature, 2020.https://doi.org/10.1007/s00453-020-00721-7 .

Dvoák, Wolfgang, Monika H Henzinger, and David P. Williamson. “Maximizing a Submodular Function with Viability Constraints.”https://doi.org/10.1007/s00453-015-0066-y__Algorithmica. Springer Nature, 2017.https://doi.org/10.1007/s00453-015-0066-y .

Henzinger, Monika H, V. King, and T. Warnow. “Constructing a Tree from Homeomorphic Subtrees, with Applications to Computational Evolutionary Biology.”https://doi.org/10.1007/pl00009268__Algorithmica. Springer Nature, 1999.https://doi.org/10.1007/pl00009268 .

Henzinger, Monika H, and M. L. Fredman. “Lower Bounds for Fully Dynamic Connectivity Problems in Graphs.”https://doi.org/10.1007/pl00009228__Algorithmica. Springer Nature, 1998.https://doi.org/10.1007/pl00009228 .

Alberts, D., and Monika H Henzinger. “Average-Case Analysis of Dynamic Graph Algorithms.”https://doi.org/10.1007/pl00009186__Algorithmica. Springer Nature, 1998.https://doi.org/10.1007/pl00009186 .

Henzinger, Monika H. “Fully Dynamic Biconnectivity in Graphs.”https://doi.org/10.1007/bf01189067__Algorithmica. Springer Nature, 1995.https://doi.org/10.1007/bf01189067 .

Dobkin, David, Herbert Edelsbrunner, and Mark Overmars. “Searching for Empty Convex Polygons.”https://doi.org/10.1007/BF01840404__Algorithmica. Springer, 1990.https://doi.org/10.1007/BF01840404 .

Edelsbrunner, Herbert. “Edge-Skeletons in Arrangements with Applications.”https://doi.org/10.1007/BF01840438__Algorithmica. Springer, 1986.https://doi.org/10.1007/BF01840438 .