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.
600 Publications
2017 | Conference Paper | IST-REx-ID: 1175 | 
Alwen, Joel F, Susanna De Rezende, Jakob Nordstrom, and Marc Vinyals. “Cumulative Space in Black-White Pebbling and Resolution.” edited by Christos Papadimitriou, 67:38:1-38-21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. https://doi.org/10.4230/LIPIcs.ITCS.2017.38.
[Published Version]
View
| Files available
| DOI
2017 | Conference Paper | IST-REx-ID: 11772
Henzinger, Monika H. “The State of the Art in Dynamic Graph Algorithms.” In 44th International Conference on Current Trends in Theory and Practice of Computer Science, 10706:40–44. Springer Nature, 2017. https://doi.org/10.1007/978-3-319-73117-9_3.
View
| DOI
2017 | Conference Paper | IST-REx-ID: 11829 |
Henzinger, Monika H, Andrea Lincoln, Stefan Neumann, and Virginia Vassilevska Williams. “Conditional Hardness for Sensitivity Problems.” In 8th Innovations in Theoretical Computer Science Conference, Vol. 67. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. 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 |
Goranci, Gramoz, Monika H Henzinger, and Pan Peng. “The Power of Vertex Sparsifiers in Dynamic Graph Algorithms.” In 25th Annual European Symposium on Algorithms, Vol. 87. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. 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 |
Henzinger, Monika H, Dariusz Leniowski, and Claire Mathieu. “Dynamic Clustering to Minimize the Sum of Radii.” In 25th Annual European Symposium on Algorithms, Vol. 87. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. 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 |
Bhattacharya, Sayan, Monika H Henzinger, and Danupon Nanongkai. “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, 0:470–89. Society for Industrial and Applied Mathematics, 2017. https://doi.org/10.1137/1.9781611974782.30.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2017 | Conference Paper | IST-REx-ID: 11873 |
Henzinger, Monika H, Satish Rao, and Di Wang. “Local Flow Partitioning for Faster Edge Connectivity.” In 28th Annual ACM-SIAM Symposium on Discrete Algorithms, 1919–38. Society for Industrial and Applied Mathematics, 2017. https://doi.org/10.1137/1.9781611974782.125.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2017 | Conference Paper | IST-REx-ID: 11831 |
Goranci, Gramoz, Monika H Henzinger, and Pan Peng. “Improved Guarantees for Vertex Sparsification in Planar Graphs.” In 25th Annual European Symposium on Algorithms, Vol. 87. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. https://doi.org/10.4230/LIPICS.ESA.2017.44.
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
| arXiv
2017 | Journal Article | IST-REx-ID: 11903 |
Bhattacharya, Sayan, Wolfgang Dvořák, Monika H Henzinger, and Martin Starnberger. “Welfare Maximization with Friends-of-Friends Network Externalities.” Theory of Computing Systems. Springer Nature, 2017. https://doi.org/10.1007/s00224-017-9759-8.
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
2017 | Journal Article | IST-REx-ID: 1191 |
Kollár, Richard, and Sebastian Novak. “Existence of Traveling Waves for the Generalized F–KPP Equation.” Bulletin of Mathematical Biology. Springer, 2017. https://doi.org/10.1007/s11538-016-0244-3.
[Preprint]
View
| DOI
| Download Preprint (ext.)