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.
8 Publications
2005 | Published | Journal Article | IST-REx-ID: 11763 | 
Goel, Ashish, Monika Henzinger, and Serge Plotkin. “An Online Throughput-Competitive Algorithm for Multicast Routing and Admission Control.” Journal of Algorithms. Elsevier, 2005. https://doi.org/10.1016/j.jalgor.2004.11.001.
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
2003 | Published | Journal Article | IST-REx-ID: 11764
Goel, Ashish, Monika Henzinger, Serge Plotkin, and Eva Tardos. “Scheduling Data Transfers in a Network and the Set Scheduling Problem.” Journal of Algorithms. Elsevier, 2003. https://doi.org/10.1016/s0196-6774(03)00054-3.
View
| DOI
2000 | Published | Journal Article | IST-REx-ID: 11683
Henzinger, Monika, Satish Rao, and Harold N. Gabow. “Computing Vertex Connectivity: New Bounds from Old Techniques.” Journal of Algorithms. Elsevier, 2000. https://doi.org/10.1006/jagm.1999.1055.
View
| DOI
1999 | Published | Conference Paper | IST-REx-ID: 11691
Goel, Ashish, Monika Henzinger, Serge Plotkin, and Eva Tardos. “Scheduling Data Transfers in a Network and the Set Scheduling Problem.” In Proceedings of the 31st Annual ACM Symposium on Theory of Computing, 189–97. Association for Computing Machinery, 1999. https://doi.org/10.1145/301250.301300.
View
| DOI
1997 | Published | Journal Article | IST-REx-ID: 11765
Henzinger, Monika. “A Static 2-Approximation Algorithm for Vertex Connectivity and Incremental Approximation Algorithms for Edge and Vertex Connectivity.” Journal of Algorithms. Elsevier, 1997. https://doi.org/10.1006/jagm.1997.0855.
View
| DOI
1987 | Published | Journal Article | IST-REx-ID: 4102
Dobkin, David, and Herbert Edelsbrunner. “Space Searching for Intersecting Objects.” Journal of Algorithms. Academic Press, 1987. https://doi.org/10.1016/0196-6774(87)90015-0.
View
| DOI
| Download None (ext.)
1985 | Published | Journal Article | IST-REx-ID: 4112
Edelsbrunner, Herbert, and Mark Overmars. “Batched Dynamic Solutions to Decomposable Searching Problems.” Journal of Algorithms. Elsevier, 1985. https://doi.org/10.1016/0196-6774(85)90030-6.
View
| DOI
1985 | Published | Journal Article | IST-REx-ID: 4115
Edelsbrunner, Herbert. “Computing the Extreme Distances between Two Convex Polygons.” Journal of Algorithms. Academic Press, 1985. https://doi.org/10.1016/0196-6774(85)90039-2.
View
| DOI