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.

5760 Publications


2018 | Journal Article | IST-REx-ID: 11757 | OA
S. Bhattacharya, M. H. Henzinger, and G. Italiano, “Dynamic algorithms via the primal-dual method,” Information and Computation, vol. 261, no. 08. Elsevier, pp. 219–239, 2018.
[Published Version] View | DOI | Download Published Version (ext.)
 

2018 | Conference Paper | IST-REx-ID: 11828 | OA
G. Goranci, M. H. Henzinger, and P. Peng, “Dynamic effective resistances and approximate schur complement on separable graphs,” in 26th Annual European Symposium on Algorithms, Helsinki, Finland, 2018, vol. 112.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 

2018 | Conference Paper | IST-REx-ID: 11827 | OA
G. Goranci, M. H. Henzinger, and D. Leniowski, “A tree structure for dynamic facility location,” in 26th Annual European Symposium on Algorithms, Helsinki, Finland, 2018, vol. 112.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 

2018 | Journal Article | IST-REx-ID: 11768 | OA
M. H. Henzinger, S. Krinninger, and D. Nanongkai, “Decremental single-source shortest paths on undirected graphs in near-linear total update time,” Journal of the ACM, vol. 65, no. 6. Association for Computing Machinery, pp. 1–40, 2018.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2018 | Conference Paper | IST-REx-ID: 11872 | OA
S. Bhattacharya, D. Chakrabarty, M. H. Henzinger, and D. Nanongkai, “Dynamic algorithms for graph coloring,” in 29th Annual ACM-SIAM Symposium on Discrete Algorithms, New Orleans, LA, United States, 2018, pp. 1–20.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

Filters and Search Terms

oa=1

Search

Filter Publications