Edelsbrunner, Herbert, and Georg F. Osang. “A Simple Algorithm for Higher-Order Delaunay Mosaics and Alpha Shapes.”10.1007/s00453-022-01027-6__Algorithmica, vol. 85, Springer Nature, 2023, pp. 277–95, doi:10.1007/s00453-022-01027-6.
LibreCat: https://research-explorer.ista.ac.at/record/12086
DOI: 10.1007/s00453-022-01027-6
WoS: 000846967100001

Henzinger, Monika H., et al. “A Combinatorial Cut-Toggling Algorithm for Solving Laplacian Linear Systems.”10.1007/s00453-023-01154-8__Algorithmica, vol. 85, Springer Nature, 2023, pp. 2680–3716, doi:10.1007/s00453-023-01154-8.
LibreCat: https://research-explorer.ista.ac.at/record/14043
DOI: 10.1007/s00453-023-01154-8
WoS: 001041254900002
arXiv: 2010.16316

Alistarh, Dan-Adrian, et al. “Dynamic Averaging Load Balancing on Cycles.”10.1007/s00453-021-00905-9__Algorithmica, vol. 84, no. 4, Springer Nature, 2022, pp. 1007–29, doi:10.1007/s00453-021-00905-9.
LibreCat: https://research-explorer.ista.ac.at/record/8286
DOI: 10.1007/s00453-021-00905-9
WoS: 000734004600001
arXiv: 2003.09297

Bhattacharya, Sayan, et al. “Deterministic Dynamic Matching in O(1) Update Time.”10.1007/s00453-019-00630-4__Algorithmica, vol. 82, no. 4, Springer Nature, 2020, pp. 1057–80, doi:10.1007/s00453-019-00630-4.
LibreCat: https://research-explorer.ista.ac.at/record/11675
DOI: 10.1007/s00453-019-00630-4

Henzinger, Monika H., et al. “Dynamic Clustering to Minimize the Sum of Radii.”10.1007/s00453-020-00721-7__Algorithmica, vol. 82, no. 11, Springer Nature, 2020, pp. 3183–94, doi:10.1007/s00453-020-00721-7.
LibreCat: https://research-explorer.ista.ac.at/record/11674
DOI: 10.1007/s00453-020-00721-7
arXiv: 1707.02577

Dvoák, Wolfgang, et al. “Maximizing a Submodular Function with Viability Constraints.”10.1007/s00453-015-0066-y__Algorithmica, vol. 77, no. 1, Springer Nature, 2017, pp. 152–72, doi:10.1007/s00453-015-0066-y.
LibreCat: https://research-explorer.ista.ac.at/record/11676
DOI: 10.1007/s00453-015-0066-y
arXiv: 1611.05753

Henzinger, Monika H., et al. “Constructing a Tree from Homeomorphic Subtrees, with Applications to Computational Evolutionary Biology.”10.1007/pl00009268__Algorithmica, vol. 24, Springer Nature, 1999, pp. 1–13, doi:10.1007/pl00009268.
LibreCat: https://research-explorer.ista.ac.at/record/11679
DOI: 10.1007/pl00009268

Henzinger, Monika H., and M. L. Fredman. “Lower Bounds for Fully Dynamic Connectivity Problems in Graphs.”10.1007/pl00009228__Algorithmica, vol. 22, no. 3, Springer Nature, 1998, pp. 351–62, doi:10.1007/pl00009228.
LibreCat: https://research-explorer.ista.ac.at/record/11681
DOI: 10.1007/pl00009228

Alberts, D., and Monika H. Henzinger. “Average-Case Analysis of Dynamic Graph Algorithms.”10.1007/pl00009186__Algorithmica, vol. 20, Springer Nature, 1998, pp. 31–60, doi:10.1007/pl00009186.
LibreCat: https://research-explorer.ista.ac.at/record/11680
DOI: 10.1007/pl00009186

Henzinger, Monika H. “Fully Dynamic Biconnectivity in Graphs.”10.1007/bf01189067__Algorithmica, vol. 13, no. 6, Springer Nature, 1995, pp. 503–38, doi:10.1007/bf01189067.
LibreCat: https://research-explorer.ista.ac.at/record/11677
DOI: 10.1007/bf01189067

Dobkin, David, et al. “Searching for Empty Convex Polygons.”10.1007/BF01840404__Algorithmica, vol. 5, no. 4, Springer, 1990, pp. 561–71, doi:10.1007/BF01840404.
LibreCat: https://research-explorer.ista.ac.at/record/4075
DOI: 10.1007/BF01840404

Edelsbrunner, Herbert. “Edge-Skeletons in Arrangements with Applications.”10.1007/BF01840438__Algorithmica, vol. 1, no. 1–4, Springer, 1986, pp. 93–109, doi:10.1007/BF01840438.
LibreCat: https://research-explorer.ista.ac.at/record/3580
DOI: 10.1007/BF01840438