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 | OA
A. Goel, M. H. Henzinger, and S. Plotkin, “An online throughput-competitive algorithm for multicast routing and admission control,” Journal of Algorithms, vol. 55, no. 1. Elsevier, pp. 1–20, 2005.
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 

2003 | Published | Journal Article | IST-REx-ID: 11764
A. Goel, M. H. Henzinger, S. Plotkin, and E. Tardos, “Scheduling data transfers in a network and the set scheduling problem,” Journal of Algorithms, vol. 48, no. 2. Elsevier, pp. 314–332, 2003.
View | DOI
 

2000 | Published | Journal Article | IST-REx-ID: 11683
M. H. Henzinger, S. Rao, and H. N. Gabow, “Computing vertex connectivity: New bounds from old techniques,” Journal of Algorithms, vol. 34, no. 2. Elsevier, pp. 222–250, 2000.
View | DOI
 

1999 | Published | Conference Paper | IST-REx-ID: 11691
A. Goel, M. H. Henzinger, S. Plotkin, and E. Tardos, “Scheduling data transfers in a network and the set scheduling problem,” in Proceedings of the 31st annual ACM symposium on Theory of computing, Atlanta, GA, United States, 1999, pp. 189–197.
View | DOI
 

1997 | Published | Journal Article | IST-REx-ID: 11765
M. H. Henzinger, “A static 2-approximation algorithm for vertex connectivity and incremental approximation algorithms for edge and vertex connectivity,” Journal of Algorithms, vol. 24, no. 1. Elsevier, pp. 194–220, 1997.
View | DOI
 

1987 | Published | Journal Article | IST-REx-ID: 4102
D. Dobkin and H. Edelsbrunner, “Space searching for intersecting objects,” Journal of Algorithms, vol. 8, no. 3. Academic Press, pp. 348–361, 1987.
View | DOI | Download None (ext.)
 

1985 | Published | Journal Article | IST-REx-ID: 4112
H. Edelsbrunner and M. Overmars, “Batched dynamic solutions to decomposable searching problems,” Journal of Algorithms, vol. 6, no. 4. Elsevier, pp. 515–542, 1985.
View | DOI
 

1985 | Published | Journal Article | IST-REx-ID: 4115
H. Edelsbrunner, “Computing the extreme distances between two convex polygons,” Journal of Algorithms, vol. 6, no. 2. Academic Press, pp. 213–224, 1985.
View | DOI
 

Filters and Search Terms

issn=0196-6774

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed