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.
417 Publications
2014 | Conference Paper | IST-REx-ID: 11855 |
M. H. Henzinger, S. Krinninger, and D. Nanongkai, “Decremental single-source shortest paths on undirected graphs in near-linear total update time,” in 55th Annual Symposium on Foundations of Computer Science, Philadelphia, PA, United States, 2014, pp. 146–155.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2014 | Conference Paper | IST-REx-ID: 11870 |
M. H. Henzinger, S. Krinninger, and D. Nanongkai, “Sublinear-time decremental algorithms for single-source reachability and shortest paths on directed graphs,” in 46th Annual ACM Symposium on Theory of Computing, New York, NY, United States, 2014.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2014 | Conference Paper | IST-REx-ID: 11876 |
M. H. Henzinger, S. Krinninger, and D. Nanongkai, “A subquadratic-time algorithm for decremental single-source shortest paths,” in 25th Annual ACM-SIAM Symposium on Discrete Algorithms, Portland, OR, United States, 2014, pp. 1053–1072.
[Published Version]
View
| DOI
| Download Published Version (ext.)
2014 | Conference Paper | IST-REx-ID: 11875 |
S. Bhattacharya, M. H. Henzinger, and G. F. Italiano, “Deterministic fully dynamic data structures for vertex cover and matching,” in 26th Annual ACM-SIAM Symposium on Discrete Algorithms, San Diego, CA, United States, 2014, pp. 785–804.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv