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.
3 Publications
2018 | Published | Journal Article | IST-REx-ID: 11768 | 
Henzinger, M. H., Krinninger, S., & Nanongkai, D. (2018). Decremental single-source shortest paths on undirected graphs in near-linear total update time. Journal of the ACM. Association for Computing Machinery. https://doi.org/10.1145/3218657
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
1999 | Published | Journal Article | IST-REx-ID: 11769
Henzinger, M. H., & King, V. (1999). Randomized fully dynamic graph algorithms with polylogarithmic time per operation. Journal of the ACM. Association for Computing Machinery. https://doi.org/10.1145/320211.320215
View
| DOI
1992 | Published | Journal Article | IST-REx-ID: 4046
Chazelle, B., & Edelsbrunner, H. (1992). An optimal algorithm for intersecting line segments in the plane. Journal of the ACM. ACM. https://doi.org/10.1145/147508.147511
View
| DOI
| Download None (ext.)