An online throughput-competitive algorithm for multicast routing and admission control
A. Goel, M.H. Henzinger, S. Plotkin, Journal of Algorithms 55 (2005) 1–20.
LibreCat: https://research-explorer.ista.ac.at/record/11763
DOI: 10.1016/j.jalgor.2004.11.001

Scheduling data transfers in a network and the set scheduling problem
A. Goel, M.H. Henzinger, S. Plotkin, E. Tardos, Journal of Algorithms 48 (2003) 314–332.
LibreCat: https://research-explorer.ista.ac.at/record/11764
DOI: 10.1016/s0196-6774(03)00054-3

Computing vertex connectivity: New bounds from old techniques
M.H. Henzinger, S. Rao, H.N. Gabow, Journal of Algorithms 34 (2000) 222–250.
LibreCat: https://research-explorer.ista.ac.at/record/11683
DOI: 10.1006/jagm.1999.1055

Scheduling data transfers in a network and the set scheduling problem
A. Goel, M.H. Henzinger, S. Plotkin, E. Tardos, in:, Proceedings of the 31st Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, 1999, pp. 189–197.
LibreCat: https://research-explorer.ista.ac.at/record/11691
DOI: 10.1145/301250.301300

A static 2-approximation algorithm for vertex connectivity and incremental approximation algorithms for edge and vertex connectivity
M.H. Henzinger, Journal of Algorithms 24 (1997) 194–220.
LibreCat: https://research-explorer.ista.ac.at/record/11765
DOI: 10.1006/jagm.1997.0855

Space searching for intersecting objects
D. Dobkin, H. Edelsbrunner, Journal of Algorithms 8 (1987) 348–361.
LibreCat: https://research-explorer.ista.ac.at/record/4102
DOI: 10.1016/0196-6774(87)90015-0

Batched dynamic solutions to decomposable searching problems
H. Edelsbrunner, M. Overmars, Journal of Algorithms 6 (1985) 515–542.
LibreCat: https://research-explorer.ista.ac.at/record/4112
DOI: 10.1016/0196-6774(85)90030-6

Computing the extreme distances between two convex polygons
H. Edelsbrunner, Journal of Algorithms 6 (1985) 213–224.
LibreCat: https://research-explorer.ista.ac.at/record/4115
DOI: 10.1016/0196-6774(85)90039-2