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 .

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 .

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 .

Henzinger, Monika H. “Fully Dynamic Biconnectivity in Graphs.”https://doi.org/10.1007/bf01189067__Algorithmica. Springer Nature, 1995.https://doi.org/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 .

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 .

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 .