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 | Journal Article | IST-REx-ID: 11763 | 
Goel A, Henzinger MH, Plotkin S. An online throughput-competitive algorithm for multicast routing and admission control. Journal of Algorithms. 2005;55(1):1-20. doi:10.1016/j.jalgor.2004.11.001
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
2003 | Journal Article | IST-REx-ID: 11764
Goel A, Henzinger MH, Plotkin S, Tardos E. Scheduling data transfers in a network and the set scheduling problem. Journal of Algorithms. 2003;48(2):314-332. doi:10.1016/s0196-6774(03)00054-3
View
| DOI
2000 | Journal Article | IST-REx-ID: 11683
Henzinger MH, Rao S, Gabow HN. Computing vertex connectivity: New bounds from old techniques. Journal of Algorithms. 2000;34(2):222-250. doi:10.1006/jagm.1999.1055
View
| DOI
1999 | Conference Paper | IST-REx-ID: 11691
Goel A, Henzinger MH, Plotkin S, Tardos E. Scheduling data transfers in a network and the set scheduling problem. In: Proceedings of the 31st Annual ACM Symposium on Theory of Computing. Association for Computing Machinery; 1999:189-197. doi:10.1145/301250.301300
View
| DOI
1997 | Journal Article | IST-REx-ID: 11765
Henzinger MH. A static 2-approximation algorithm for vertex connectivity and incremental approximation algorithms for edge and vertex connectivity. Journal of Algorithms. 1997;24(1):194-220. doi:10.1006/jagm.1997.0855
View
| DOI
1987 | Journal Article | IST-REx-ID: 4102
Dobkin D, Edelsbrunner H. Space searching for intersecting objects. Journal of Algorithms. 1987;8(3):348-361. doi:10.1016/0196-6774(87)90015-0
View
| DOI
| Download None (ext.)
1985 | Journal Article | IST-REx-ID: 4112
Edelsbrunner H, Overmars M. Batched dynamic solutions to decomposable searching problems. Journal of Algorithms. 1985;6(4):515-542. doi:10.1016/0196-6774(85)90030-6
View
| DOI
1985 | Journal Article | IST-REx-ID: 4115
Edelsbrunner H. Computing the extreme distances between two convex polygons. Journal of Algorithms. 1985;6(2):213-224. doi:10.1016/0196-6774(85)90039-2
View
| DOI