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, Wolfgang, et al. “Maximizing a Submodular Function with Viability Constraints.” Algorithmica, vol. 77, no. 1, Springer Nature, 2017, pp. 152–72, doi:10.1007/s00453-015-0066-y.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
1999 | Journal Article | IST-REx-ID: 11679
Henzinger, Monika H., et al. “Constructing a Tree from Homeomorphic Subtrees, with Applications to Computational Evolutionary Biology.” Algorithmica, vol. 24, Springer Nature, 1999, pp. 1–13, doi: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, vol. 22, no. 3, Springer Nature, 1998, pp. 351–62, doi: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, vol. 20, Springer Nature, 1998, pp. 31–60, doi:10.1007/pl00009186.
View
| Files available
| DOI
1996 | Journal Article | IST-REx-ID: 4027
Chazelle, Bernard, et al. “Lines in Space: Combinatorics and Algorithms.” Algorithmica, vol. 15, no. 5, Springer, 1996, pp. 428–47, doi:10.1007/BF01955043.
View
| DOI