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 | 
Maximizing a submodular function with viability constraints
W. Dvořák, M.H. Henzinger, D.P. Williamson, Algorithmica 77 (2017) 152–172.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
W. Dvořák, M.H. Henzinger, D.P. Williamson, Algorithmica 77 (2017) 152–172.
1999 | Journal Article | IST-REx-ID: 11679
Constructing a tree from homeomorphic subtrees, with applications to computational evolutionary biology
M.H. Henzinger, V. King, T. Warnow, Algorithmica 24 (1999) 1–13.
View
| Files available
| DOI
M.H. Henzinger, V. King, T. Warnow, Algorithmica 24 (1999) 1–13.
1998 | Journal Article | IST-REx-ID: 11681
Lower bounds for fully dynamic connectivity problems in graphs
M.H. Henzinger, M.L. Fredman, Algorithmica 22 (1998) 351–362.
View
| DOI
M.H. Henzinger, M.L. Fredman, Algorithmica 22 (1998) 351–362.
1998 | Journal Article | IST-REx-ID: 11680
Average-case analysis of dynamic graph algorithms
D. Alberts, M.H. Henzinger, Algorithmica 20 (1998) 31–60.
View
| Files available
| DOI
D. Alberts, M.H. Henzinger, Algorithmica 20 (1998) 31–60.
1995 | Journal Article | IST-REx-ID: 11677
Fully dynamic biconnectivity in graphs
M.H. Henzinger, Algorithmica 13 (1995) 503–538.
View
| DOI
M.H. Henzinger, Algorithmica 13 (1995) 503–538.