Dvoák W, Henzinger MH, Williamson DP. 2017. Maximizing a submodular function with viability constraints. Algorithmica. 77(1), 152–172.
LibreCat: https://research-explorer.ista.ac.at/record/11676
DOI: 10.1007/s00453-015-0066-y
arXiv: 1611.05753

Henzinger MH, King V, Warnow T. 1999. Constructing a tree from homeomorphic subtrees, with applications to computational evolutionary biology. Algorithmica. 24, 1–13.
LibreCat: https://research-explorer.ista.ac.at/record/11679
DOI: 10.1007/pl00009268

Henzinger MH, Fredman ML. 1998. Lower bounds for fully dynamic connectivity problems in graphs. Algorithmica. 22(3), 351–362.
LibreCat: https://research-explorer.ista.ac.at/record/11681
DOI: 10.1007/pl00009228

Alberts D, Henzinger MH. 1998. Average-case analysis of dynamic graph algorithms. Algorithmica. 20, 31–60.
LibreCat: https://research-explorer.ista.ac.at/record/11680
DOI: 10.1007/pl00009186

Chazelle B, Edelsbrunner H, Guibas L, Sharir M, Stolfi J. 1996. Lines in space: Combinatorics and algorithms. Algorithmica. 15(5), 428–447.
LibreCat: https://research-explorer.ista.ac.at/record/4027
DOI: 10.1007/BF01955043

Edelsbrunner H, Shah N. 1996. Incremental topological flipping works for regular triangulations. Algorithmica. 15(3), 223–241.
LibreCat: https://research-explorer.ista.ac.at/record/4026
DOI: 10.1007/BF01975867

Henzinger MH. 1995. Fully dynamic biconnectivity in graphs. Algorithmica. 13(6), 503–538.
LibreCat: https://research-explorer.ista.ac.at/record/11677
DOI: 10.1007/bf01189067

Chazelle B, Edelsbrunner H, Grigni M, Guibas L, Hershberger J, Sharir M, Snoeyink J. 1994. Ray shooting in polygons using geodesic triangulations. Algorithmica. 12(1), 54–68.
LibreCat: https://research-explorer.ista.ac.at/record/4039
DOI: 10.1007/BF01377183

Chazelle B, Edelsbrunner H, Guibas L, Sharir M. 1994. Algorithms for bichromatic line-segment problems and polyhedral terrains. Algorithmica. 11(2), 116–132.
LibreCat: https://research-explorer.ista.ac.at/record/4038
DOI: 10.1007/BF01182771

Dobkin D, Edelsbrunner H, Overmars M. 1990. Searching for empty convex polygons. Algorithmica. 5(4), 561–571.
LibreCat: https://research-explorer.ista.ac.at/record/4075
DOI: 10.1007/BF01840404

Edelsbrunner H. 1986. Edge-skeletons in arrangements with applications. Algorithmica. 1(1–4), 93–109.
LibreCat: https://research-explorer.ista.ac.at/record/3580
DOI: 10.1007/BF01840438