ISTA Research Explorer

We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.

2005 | Journal Article | IST-REx-ID: 11763 |

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.

[Published Version] View | Files available | DOI | Download Published Version (ext.)

2003 | Journal Article | IST-REx-ID: 11764

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.

View | DOI

2000 | Journal Article | IST-REx-ID: 11683

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

View | DOI

1999 | Conference Paper | IST-REx-ID: 11691

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.

View | DOI

1997 | Journal Article | IST-REx-ID: 11765

View | DOI

1987 | Journal Article | IST-REx-ID: 4102

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

View | DOI | Download None (ext.)

1985 | Journal Article | IST-REx-ID: 4112

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

View | DOI

1985 | Journal Article | IST-REx-ID: 4115

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

View | DOI