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
The state of the art in dynamic graph algorithms
M.H. Henzinger, in:, 44th International Conference on Current Trends in Theory and Practice of Computer Science, Springer Nature, 2017, pp. 40–44.
View
| DOI
M.H. Henzinger, in:, 44th International Conference on Current Trends in Theory and Practice of Computer Science, Springer Nature, 2017, pp. 40–44.
2017 | Conference Paper | IST-REx-ID: 11829 |
Conditional hardness for sensitivity problems
M.H. Henzinger, A. Lincoln, S. Neumann, V. Vassilevska Williams, in:, 8th Innovations in Theoretical Computer Science Conference, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
M.H. Henzinger, A. Lincoln, S. Neumann, V. Vassilevska Williams, in:, 8th Innovations in Theoretical Computer Science Conference, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.
2017 | Conference Paper | IST-REx-ID: 11833 |
The power of vertex sparsifiers in dynamic graph algorithms
G. Goranci, M.H. Henzinger, P. Peng, in:, 25th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
G. Goranci, M.H. Henzinger, P. Peng, in:, 25th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.
2017 | Conference Paper | IST-REx-ID: 11832 |
Dynamic clustering to minimize the sum of radii
M.H. Henzinger, D. Leniowski, C. Mathieu, in:, 25th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
M.H. Henzinger, D. Leniowski, C. Mathieu, in:, 25th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.
2017 | Conference Paper | IST-REx-ID: 11874 |
Fully dynamic approximate maximum matching and minimum vertex cover in o(log3 n) worst case update time
S. Bhattacharya, M.H. Henzinger, D. Nanongkai, in:, 28th Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2017, pp. 470–489.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
S. Bhattacharya, M.H. Henzinger, D. Nanongkai, in:, 28th Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2017, pp. 470–489.