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.
646 Publications
2020 | Conference Paper | IST-REx-ID: 11819 | 
M. H. Henzinger, A. Noe, C. Schulz, and D. Strash, “Finding all global minimum cuts in practice,” in 28th Annual European Symposium on Algorithms, Pisa, Italy, 2020, vol. 173.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
2020 | Conference Paper | IST-REx-ID: 11852 |
L. Chen, G. Goranci, M. H. Henzinger, R. Peng, and T. Saranurak, “Fast dynamic cuts, distances and effective resistances via vertex sparsifiers,” in 61st Annual Symposium on Foundations of Computer Science, Durham, NC, United States, 2020, pp. 1135–1146.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2020 | Conference Paper | IST-REx-ID: 11880 |
K. Hanauer, M. H. Henzinger, and C. Schulz, “Fully dynamic single-source reachability in practice: An experimental study,” in 2020 Symposium on Algorithm Engineering and Experiments, Salt Lake City, UT, United States, 2020, pp. 106–119.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2020 | Conference Paper | IST-REx-ID: 11881 |
M. H. Henzinger, A. Noe, and C. Schulz, “Shared-memory branch-and-reduce for multiterminal cuts,” in 2020 Symposium on Algorithm Engineering and Experiments, Salt Lake City, UT, United States, 2020, pp. 42–55.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2020 | Journal Article | IST-REx-ID: 11889
M. H. Henzinger, S. Rao, and D. Wang, “Local flow partitioning for faster edge connectivity,” SIAM Journal on Computing, vol. 49, no. 1. Society for Industrial & Applied Mathematics, pp. 1–36, 2020.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv