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.
5 Publications
2022 | Published | Journal Article | IST-REx-ID: 11662
Constant-time Dynamic (Δ +1)-Coloring
M. Henzinger, P. Peng, ACM Transactions on Algorithms 18 (2022).
View
| DOI
M. Henzinger, P. Peng, ACM Transactions on Algorithms 18 (2022).
2021 | Published | Journal Article | IST-REx-ID: 11663 | 
A deamortization approach for dynamic spanner and dynamic maximal matching
A. Bernstein, S. Forster, M. Henzinger, ACM Transactions on Algorithms 17 (2021).
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
A. Bernstein, S. Forster, M. Henzinger, ACM Transactions on Algorithms 17 (2021).
2021 | Published | Journal Article | IST-REx-ID: 9541 |
Graph sparsification for derandomizing massively parallel computation with low space
A. Czumaj, P. Davies, M. Parter, ACM Transactions on Algorithms 17 (2021).
[Submitted Version]
View
| Files available
| DOI
| Download Submitted Version (ext.)
| WoS
| arXiv
A. Czumaj, P. Davies, M. Parter, ACM Transactions on Algorithms 17 (2021).
2018 | Published | Journal Article | IST-REx-ID: 11664 |
Incremental exact min-cut in polylogarithmic amortized update time
G. Goranci, M. Henzinger, M. Thorup, ACM Transactions on Algorithms 14 (2018).
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
G. Goranci, M. Henzinger, M. Thorup, ACM Transactions on Algorithms 14 (2018).
2017 | Published | Journal Article | IST-REx-ID: 11665 |
Sublinear-time maintenance of breadth-first spanning trees in partially dynamic networks
M. Henzinger, S. Krinninger, D. Nanongkai, ACM Transactions on Algorithms 13 (2017).
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
M. Henzinger, S. Krinninger, D. Nanongkai, ACM Transactions on Algorithms 13 (2017).