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 .
LibreCat: https://research-explorer.ista.ac.at/record/12086
DOI: 10.1007/s00453-022-01027-6
WoS: 000846967100001

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 .
LibreCat: https://research-explorer.ista.ac.at/record/14043
DOI: 10.1007/s00453-023-01154-8
WoS: 001041254900002
arXiv: 2010.16316

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, 2022.https://doi.org/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, 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 .
LibreCat: https://research-explorer.ista.ac.at/record/11675
DOI: 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 .
LibreCat: https://research-explorer.ista.ac.at/record/11674
DOI: 10.1007/s00453-020-00721-7
arXiv: 1707.02577

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 .
LibreCat: https://research-explorer.ista.ac.at/record/11676
DOI: 10.1007/s00453-015-0066-y
arXiv: 1611.05753

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 .
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.”https://doi.org/10.1007/pl00009228__Algorithmica. Springer Nature, 1998.https://doi.org/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.”https://doi.org/10.1007/pl00009186__Algorithmica. Springer Nature, 1998.https://doi.org/10.1007/pl00009186 .
LibreCat: https://research-explorer.ista.ac.at/record/11680
DOI: 10.1007/pl00009186

Chazelle, Bernard, Herbert Edelsbrunner, Leonidas Guibas, Micha Sharir, and Jorge Stolfi. “Lines in Space: Combinatorics and Algorithms.”https://doi.org/10.1007/BF01955043__Algorithmica. Springer, 1996.https://doi.org/10.1007/BF01955043 .
LibreCat: https://research-explorer.ista.ac.at/record/4027
DOI: 10.1007/BF01955043

Edelsbrunner, Herbert, and Nimish Shah. “Incremental Topological Flipping Works for Regular Triangulations.”https://doi.org/10.1007/BF01975867__Algorithmica. Springer, 1996.https://doi.org/10.1007/BF01975867 .
LibreCat: https://research-explorer.ista.ac.at/record/4026
DOI: 10.1007/BF01975867

Henzinger, Monika H. “Fully Dynamic Biconnectivity in Graphs.”https://doi.org/10.1007/bf01189067__Algorithmica. Springer Nature, 1995.https://doi.org/10.1007/bf01189067 .
LibreCat: https://research-explorer.ista.ac.at/record/11677
DOI: 10.1007/bf01189067

Chazelle, Bernard, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas Guibas, John Hershberger, Micha Sharir, and Jack Snoeyink. “Ray Shooting in Polygons Using Geodesic Triangulations.”https://doi.org/10.1007/BF01377183__Algorithmica. Springer, 1994.https://doi.org/10.1007/BF01377183 .
LibreCat: https://research-explorer.ista.ac.at/record/4039
DOI: 10.1007/BF01377183

Chazelle, Bernard, Herbert Edelsbrunner, Leonidas Guibas, and Micha Sharir. “Algorithms for Bichromatic Line-Segment Problems and Polyhedral Terrains.”https://doi.org/10.1007/BF01182771__Algorithmica. Springer, 1994.https://doi.org/10.1007/BF01182771 .
LibreCat: https://research-explorer.ista.ac.at/record/4038
DOI: 10.1007/BF01182771

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 .
LibreCat: https://research-explorer.ista.ac.at/record/4075
DOI: 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 .
LibreCat: https://research-explorer.ista.ac.at/record/3580
DOI: 10.1007/BF01840438