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.

9114 Publications


2017 | Conference Paper | IST-REx-ID: 11772
Henzinger, M. H. (2017). The state of the art in dynamic graph algorithms. In 44th International Conference on Current Trends in Theory and Practice of Computer Science (Vol. 10706, pp. 40–44). Krems, Austria: Springer Nature. https://doi.org/10.1007/978-3-319-73117-9_3
View | DOI
 

2017 | Conference Paper | IST-REx-ID: 11829 | OA
Henzinger, M. H., Lincoln, A., Neumann, S., & Vassilevska Williams, V. (2017). Conditional hardness for sensitivity problems. In 8th Innovations in Theoretical Computer Science Conference (Vol. 67). Berkley, CA, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.ITCS.2017.26
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 

2017 | Conference Paper | IST-REx-ID: 11833 | OA
Goranci, G., Henzinger, M. H., & Peng, P. (2017). The power of vertex sparsifiers in dynamic graph algorithms. In 25th Annual European Symposium on Algorithms (Vol. 87). Vienna, Austria: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.ESA.2017.45
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 

2017 | Conference Paper | IST-REx-ID: 11832 | OA
Henzinger, M. H., Leniowski, D., & Mathieu, C. (2017). Dynamic clustering to minimize the sum of radii. In 25th Annual European Symposium on Algorithms (Vol. 87). Vienna, Austria: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.ESA.2017.48
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 

2017 | Conference Paper | IST-REx-ID: 11874 | OA
Bhattacharya, S., Henzinger, M. H., & Nanongkai, D. (2017). Fully dynamic approximate maximum matching and minimum vertex cover in o(log3 n) worst case update time. In 28th Annual ACM-SIAM Symposium on Discrete Algorithms (Vol. 0, pp. 470–489). Barcelona, Spain: Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611974782.30
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

Search

Filter Publications