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.
9087 Publications
2020 | Journal Article | IST-REx-ID: 11675 | 
S. Bhattacharya, D. Chakrabarty, and M. H. Henzinger, “Deterministic dynamic matching in O(1) update time,” Algorithmica, vol. 82, no. 4. Springer Nature, pp. 1057–1080, 2020.
[Published Version]
View
| DOI
| Download Published Version (ext.)
2020 | Journal Article | IST-REx-ID: 11674 |
M. H. Henzinger, D. Leniowski, and C. Mathieu, “Dynamic clustering to minimize the sum of radii,” Algorithmica, vol. 82, no. 11. Springer Nature, pp. 3183–3194, 2020.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2020 | Conference Paper | IST-REx-ID: 11818 |
M. H. Henzinger and S. Kale, “Fully-dynamic coresets,” 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: 11816 |
M. H. Henzinger, K. Shahbaz, R. Paul, and C. Schulz, “Dynamic matching algorithms in practice,” in 8th 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: 11824 |
M. H. Henzinger, S. Neumann, and A. Wiese, “Dynamic approximate maximum independent set of intervals, hypercubes and hyperrectangles,” in 36th International Symposium on Computational Geometry, Zurich, Switzerland, 2020, vol. 164.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
2020 | Conference Paper | IST-REx-ID: 11822 |
K. Hanauer, M. H. Henzinger, and C. Schulz, “Faster fully dynamic transitive closure in practice,” in 18th International Symposium on Experimental Algorithms, Pisa, Italy, 2020, vol. 160.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
2020 | Conference Paper | IST-REx-ID: 11825 |
M. H. Henzinger and P. Peng, “Constant-time dynamic (Δ+1)-coloring,” in 37th International Symposium on Theoretical Aspects of Computer Science, Montpellier, France, 2020, vol. 154.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
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