Goel A, Henzinger MH, Plotkin S. 2005. An online throughput-competitive algorithm for multicast routing and admission control. Journal of Algorithms. 55(1), 1–20.

Goel A, Henzinger MH, Plotkin S, Tardos E. 2003. Scheduling data transfers in a network and the set scheduling problem. Journal of Algorithms. 48(2), 314–332.

Henzinger MH, Rao S, Gabow HN. 2000. Computing vertex connectivity: New bounds from old techniques. Journal of Algorithms. 34(2), 222–250.

Goel A, Henzinger MH, Plotkin S, Tardos E. 1999. Scheduling data transfers in a network and the set scheduling problem. Proceedings of the 31st annual ACM symposium on Theory of computing. STOC: Symposium on Theory of Computing, 189–197.

Henzinger MH. 1997. A static 2-approximation algorithm for vertex connectivity and incremental approximation algorithms for edge and vertex connectivity. Journal of Algorithms. 24(1), 194–220.

Dobkin D, Edelsbrunner H. 1987. Space searching for intersecting objects. Journal of Algorithms. 8(3), 348–361.

Edelsbrunner H, Overmars M. 1985. Batched dynamic solutions to decomposable searching problems. Journal of Algorithms. 6(4), 515–542.

Edelsbrunner H. 1985. Computing the extreme distances between two convex polygons. Journal of Algorithms. 6(2), 213–224.