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

Chazelle, Bernard, et al. “Lines in Space: Combinatorics and Algorithms.”10.1007/BF01955043__Algorithmica, vol. 15, no. 5, Springer, 1996, pp. 428–47, doi: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.”10.1007/BF01975867__Algorithmica, vol. 15, no. 3, Springer, 1996, pp. 223–41, doi:10.1007/BF01975867.
LibreCat: https://research-explorer.ista.ac.at/record/4026
DOI: 10.1007/BF01975867

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

Chazelle, Bernard, et al. “Ray Shooting in Polygons Using Geodesic Triangulations.”10.1007/BF01377183__Algorithmica, vol. 12, no. 1, Springer, 1994, pp. 54–68, doi:10.1007/BF01377183.
LibreCat: https://research-explorer.ista.ac.at/record/4039
DOI: 10.1007/BF01377183

Chazelle, Bernard, et al. “Algorithms for Bichromatic Line-Segment Problems and Polyhedral Terrains.”10.1007/BF01182771__Algorithmica, vol. 11, no. 2, Springer, 1994, pp. 116–32, doi:10.1007/BF01182771.
LibreCat: https://research-explorer.ista.ac.at/record/4038
DOI: 10.1007/BF01182771

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