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, Ashish, et al. “An Online Throughput-Competitive Algorithm for Multicast Routing and Admission Control.” Journal of Algorithms, vol. 55, no. 1, Elsevier, 2005, pp. 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, Ashish, et al. “Scheduling Data Transfers in a Network and the Set Scheduling Problem.” Journal of Algorithms, vol. 48, no. 2, Elsevier, 2003, pp. 314–32, doi:10.1016/s0196-6774(03)00054-3.
View
| DOI
2000 | Journal Article | IST-REx-ID: 11683
Henzinger, Monika H., et al. “Computing Vertex Connectivity: New Bounds from Old Techniques.” Journal of Algorithms, vol. 34, no. 2, Elsevier, 2000, pp. 222–50, doi:10.1006/jagm.1999.1055.
View
| DOI
1999 | Conference Paper | IST-REx-ID: 11691
Goel, Ashish, et al. “Scheduling Data Transfers in a Network and the Set Scheduling Problem.” Proceedings of the 31st Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, 1999, pp. 189–97, doi:10.1145/301250.301300.
View
| DOI
1997 | Journal Article | IST-REx-ID: 11765
Henzinger, Monika H. “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, 1997, pp. 194–220, doi:10.1006/jagm.1997.0855.
View
| DOI
1987 | Journal Article | IST-REx-ID: 4102
Dobkin, David, and Herbert Edelsbrunner. “Space Searching for Intersecting Objects.” Journal of Algorithms, vol. 8, no. 3, Academic Press, 1987, pp. 348–61, doi:10.1016/0196-6774(87)90015-0.
View
| DOI
| Download None (ext.)
1985 | Journal Article | IST-REx-ID: 4112
Edelsbrunner, Herbert, and Mark Overmars. “Batched Dynamic Solutions to Decomposable Searching Problems.” Journal of Algorithms, vol. 6, no. 4, Elsevier, 1985, pp. 515–42, doi:10.1016/0196-6774(85)90030-6.
View
| DOI
1985 | Journal Article | IST-REx-ID: 4115
Edelsbrunner, Herbert. “Computing the Extreme Distances between Two Convex Polygons.” Journal of Algorithms, vol. 6, no. 2, Academic Press, 1985, pp. 213–24, doi:10.1016/0196-6774(85)90039-2.
View
| DOI