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.
58 Publications
1998 | Conference Paper | IST-REx-ID: 11682
Agarwal, P. K., EppsteinL. J. Guibas, D., & Henzinger, M. H. (1998). Parametric and kinetic minimum spanning trees. In Proceedings of the 39th Annual Symposium on Foundations of Computer Science (pp. 596–605). Palo Alto, CA, United States. https://doi.org/10.1109/SFCS.1998.743510
View
| DOI
1998 | Journal Article | IST-REx-ID: 11681
Henzinger, M. H., & Fredman, M. L. (1998). Lower bounds for fully dynamic connectivity problems in graphs. Algorithmica. Springer Nature. https://doi.org/10.1007/pl00009228
View
| DOI
1998 | Conference Paper | IST-REx-ID: 11926
Goel, A., Henzinger, M. H., & Plotkin, S. (1998). An online throughput-competitive algorithm for multicast routing and admission control. In 9th Annual ACM SIAM Symposium on Discrete Algorithms (pp. 97–106). San Francisco, CA, United States: Society for Industrial and Applied Mathematics.
View
| Files available
1998 | Journal Article | IST-REx-ID: 11680
Alberts, D., & Henzinger, M. H. (1998). Average-case analysis of dynamic graph algorithms. Algorithmica. Springer Nature. https://doi.org/10.1007/pl00009186
View
| Files available
| DOI
1998 | Journal Article | IST-REx-ID: 1450 | 
Hausel, T. (1998). Vanishing of intersection numbers on the moduli space of Higgs bundles. Advances in Theoretical and Mathematical Physics. International Press. https://doi.org/10.4310/ATMP.1998.v2.n5.a3
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv