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 W, Henzinger MH, Williamson DP. Maximizing a submodular function with viability constraints. Algorithmica. 2017;77(1):152-172. doi:10.1007/s00453-015-0066-y
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
1999 | Journal Article | IST-REx-ID: 11679
Henzinger MH, King V, Warnow T. Constructing a tree from homeomorphic subtrees, with applications to computational evolutionary biology. Algorithmica. 1999;24:1-13. doi:10.1007/pl00009268
View
| Files available
| DOI
1998 | Journal Article | IST-REx-ID: 11681
Henzinger MH, Fredman ML. Lower bounds for fully dynamic connectivity problems in graphs. Algorithmica. 1998;22(3):351-362. doi:10.1007/pl00009228
View
| DOI
1998 | Journal Article | IST-REx-ID: 11680
Alberts D, Henzinger MH. Average-case analysis of dynamic graph algorithms. Algorithmica. 1998;20:31-60. doi:10.1007/pl00009186
View
| Files available
| DOI
1995 | Journal Article | IST-REx-ID: 11677
Henzinger MH. Fully dynamic biconnectivity in graphs. Algorithmica. 1995;13(6):503-538. doi:10.1007/bf01189067
View
| DOI
1990 | Journal Article | IST-REx-ID: 4075
Dobkin D, Edelsbrunner H, Overmars M. Searching for empty convex polygons. Algorithmica. 1990;5(4):561-571. doi:10.1007/BF01840404
View
| DOI
| Download None (ext.)
1986 | Journal Article | IST-REx-ID: 3580
Edelsbrunner H. Edge-skeletons in arrangements with applications. Algorithmica. 1986;1(1-4):93-109. doi:10.1007/BF01840438
View
| DOI