Please note that ISTA Research Explorer no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
12 Publications
2017 | Journal Article | IST-REx-ID: 11676 | 
Dvořák, Wolfgang, Monika H Henzinger, and David P. Williamson. “Maximizing a Submodular Function with Viability Constraints.” Algorithmica. Springer Nature, 2017. https://doi.org/10.1007/s00453-015-0066-y.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
1999 | Journal Article | IST-REx-ID: 11679
Henzinger, Monika H, V. King, and T. Warnow. “Constructing a Tree from Homeomorphic Subtrees, with Applications to Computational Evolutionary Biology.” Algorithmica. Springer Nature, 1999. https://doi.org/10.1007/pl00009268.
View
| Files available
| DOI
1998 | Journal Article | IST-REx-ID: 11681
Henzinger, Monika H, and M. L. Fredman. “Lower Bounds for Fully Dynamic Connectivity Problems in Graphs.” Algorithmica. Springer Nature, 1998. https://doi.org/10.1007/pl00009228.
View
| DOI
1998 | Journal Article | IST-REx-ID: 11680
Alberts, D., and Monika H Henzinger. “Average-Case Analysis of Dynamic Graph Algorithms.” Algorithmica. Springer Nature, 1998. https://doi.org/10.1007/pl00009186.
View
| Files available
| DOI
1995 | Journal Article | IST-REx-ID: 11677
Henzinger, Monika H. “Fully Dynamic Biconnectivity in Graphs.” Algorithmica. Springer Nature, 1995. https://doi.org/10.1007/bf01189067.
View
| DOI
1990 | Journal Article | IST-REx-ID: 4075
Dobkin, David, Herbert Edelsbrunner, and Mark Overmars. “Searching for Empty Convex Polygons.” Algorithmica. Springer, 1990. https://doi.org/10.1007/BF01840404.
View
| DOI
| Download None (ext.)
1986 | Journal Article | IST-REx-ID: 3580
Edelsbrunner, Herbert. “Edge-Skeletons in Arrangements with Applications.” Algorithmica. Springer, 1986. https://doi.org/10.1007/BF01840438.
View
| DOI