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.
16 Publications
2017 | Journal Article | IST-REx-ID: 11676 | 
Dvořák, W., Henzinger, M. H., & Williamson, D. P. (2017). Maximizing a submodular function with viability constraints. Algorithmica. Springer Nature. https://doi.org/10.1007/s00453-015-0066-y
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
1999 | Journal Article | IST-REx-ID: 11679
Henzinger, M. H., King, V., & Warnow, T. (1999). Constructing a tree from homeomorphic subtrees, with applications to computational evolutionary biology. Algorithmica. Springer Nature. https://doi.org/10.1007/pl00009268
View
| Files available
| DOI
1998 | Journal Article | IST-REx-ID: 11681
Henzinger, M. H., & Fredman, M. L. (1998). Lower bounds for fully dynamic connectivity problems in graphs. Algorithmica. Springer Nature. https://doi.org/10.1007/pl00009228
View
| DOI
1998 | Journal Article | IST-REx-ID: 11680
Alberts, D., & Henzinger, M. H. (1998). Average-case analysis of dynamic graph algorithms. Algorithmica. Springer Nature. https://doi.org/10.1007/pl00009186
View
| Files available
| DOI
1996 | Journal Article | IST-REx-ID: 4027
Chazelle, B., Edelsbrunner, H., Guibas, L., Sharir, M., & Stolfi, J. (1996). Lines in space: Combinatorics and algorithms. Algorithmica. Springer. https://doi.org/10.1007/BF01955043
View
| DOI
1996 | Journal Article | IST-REx-ID: 4026
Edelsbrunner, H., & Shah, N. (1996). Incremental topological flipping works for regular triangulations. Algorithmica. Springer. https://doi.org/10.1007/BF01975867
View
| DOI
1995 | Journal Article | IST-REx-ID: 11677
Henzinger, M. H. (1995). Fully dynamic biconnectivity in graphs. Algorithmica. Springer Nature. https://doi.org/10.1007/bf01189067
View
| DOI
1994 | Journal Article | IST-REx-ID: 4039
Chazelle, B., Edelsbrunner, H., Grigni, M., Guibas, L., Hershberger, J., Sharir, M., & Snoeyink, J. (1994). Ray shooting in polygons using geodesic triangulations. Algorithmica. Springer. https://doi.org/10.1007/BF01377183
View
| DOI
| Download None (ext.)
1994 | Journal Article | IST-REx-ID: 4038
Chazelle, B., Edelsbrunner, H., Guibas, L., & Sharir, M. (1994). Algorithms for bichromatic line-segment problems and polyhedral terrains. Algorithmica. Springer. https://doi.org/10.1007/BF01182771
View
| DOI
| Download None (ext.)
1990 | Journal Article | IST-REx-ID: 4075
Dobkin, D., Edelsbrunner, H., & Overmars, M. (1990). Searching for empty convex polygons. Algorithmica. Springer. https://doi.org/10.1007/BF01840404
View
| DOI
| Download None (ext.)
1986 | Journal Article | IST-REx-ID: 3580
Edelsbrunner, H. (1986). Edge-skeletons in arrangements with applications. Algorithmica. Springer. https://doi.org/10.1007/BF01840438
View
| DOI