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.
9096 Publications
2020 | Conference Paper | IST-REx-ID: 11818 | 
Henzinger, M. H., & Kale, S. (2020). Fully-dynamic coresets. In 28th Annual European Symposium on Algorithms (Vol. 173). Pisa, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ESA.2020.57
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
2020 | Conference Paper | IST-REx-ID: 11816 |
Henzinger, M. H., Shahbaz, K., Paul, R., & Schulz, C. (2020). Dynamic matching algorithms in practice. In 8th Annual European Symposium on Algorithms (Vol. 173). Pisa, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ESA.2020.58
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
2020 | Conference Paper | IST-REx-ID: 11824 |
Henzinger, M. H., Neumann, S., & Wiese, A. (2020). Dynamic approximate maximum independent set of intervals, hypercubes and hyperrectangles. In 36th International Symposium on Computational Geometry (Vol. 164). Zurich, Switzerland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2020.51
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
2020 | Conference Paper | IST-REx-ID: 11822 |
Hanauer, K., Henzinger, M. H., & Schulz, C. (2020). Faster fully dynamic transitive closure in practice. In 18th International Symposium on Experimental Algorithms (Vol. 160). Pisa, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SEA.2020.14
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
2020 | Conference Paper | IST-REx-ID: 11825 |
Henzinger, M. H., & Peng, P. (2020). Constant-time dynamic (Δ+1)-coloring. In 37th International Symposium on Theoretical Aspects of Computer Science (Vol. 154). Montpellier, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.STACS.2020.53
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
2020 | Conference Paper | IST-REx-ID: 11819 |
Henzinger, M. H., Noe, A., Schulz, C., & Strash, D. (2020). Finding all global minimum cuts in practice. In 28th Annual European Symposium on Algorithms (Vol. 173). Pisa, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ESA.2020.59
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
2020 | Conference Paper | IST-REx-ID: 11852 |
Chen, L., Goranci, G., Henzinger, M. H., Peng, R., & Saranurak, T. (2020). Fast dynamic cuts, distances and effective resistances via vertex sparsifiers. In 61st Annual Symposium on Foundations of Computer Science (pp. 1135–1146). Durham, NC, United States: Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/focs46700.2020.00109
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2020 | Conference Paper | IST-REx-ID: 11880 |
Hanauer, K., Henzinger, M. H., & Schulz, C. (2020). Fully dynamic single-source reachability in practice: An experimental study. In 2020 Symposium on Algorithm Engineering and Experiments (pp. 106–119). Salt Lake City, UT, United States: Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611976007.9
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2020 | Conference Paper | IST-REx-ID: 11881 |
Henzinger, M. H., Noe, A., & Schulz, C. (2020). Shared-memory branch-and-reduce for multiterminal cuts. In 2020 Symposium on Algorithm Engineering and Experiments (pp. 42–55). Salt Lake City, UT, United States: Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611976007.4
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2020 | Journal Article | IST-REx-ID: 11889
Henzinger, M. H., Rao, S., & Wang, D. (2020). Local flow partitioning for faster edge connectivity. SIAM Journal on Computing. Society for Industrial & Applied Mathematics. https://doi.org/10.1137/18m1180335
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv