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.

8979 Publications


2021 | Journal Article | IST-REx-ID: 11663 | OA
A deamortization approach for dynamic spanner and dynamic maximal matching
A. Bernstein, S. Forster, M.H. Henzinger, ACM Transactions on Algorithms 17 (2021).
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2021 | Journal Article | IST-REx-ID: 11756 | OA
Constant-time dynamic weight approximation for minimum spanning forest
M.H. Henzinger, P. Peng, Information and Computation 281 (2021).
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2021 | Conference Paper | IST-REx-ID: 11771 | OA
Upper and lower bounds for fully retroactive graph problems
M.H. Henzinger, X. Wu, in:, 17th International Symposium on Algorithms and Data Structures, Springer Nature, 2021, pp. 471–484.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2021 | Conference Paper | IST-REx-ID: 11814 | OA
Differentially private algorithms for graphs under continual observation
H. Fichtenberger, M.H. Henzinger, W. Ost, in:, 29th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 

2021 | Journal Article | IST-REx-ID: 11886 | OA
A deterministic almost-tight distributed algorithm for approximating single-source shortest paths
M.H. Henzinger, S. Krinninger, D. Nanongkai, SIAM Journal on Computing 50 (2021) STOC16-98-STOC16-137.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2021 | Conference Paper | IST-REx-ID: 11919 | OA
New techniques and fine-grained hardness for dynamic near-additive spanners
T. Bergamaschi, M.H. Henzinger, M.P. Gutenberg, V.V. Williams, N. Wein, in:, 32nd Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2021, pp. 1836–1855.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2021 | Conference Paper | IST-REx-ID: 11923 | OA
Tight bounds for online graph partitioning
M.H. Henzinger, S. Neumann, H. Räcke, S. Schmid, in:, 32nd Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2021, pp. 2799–2818.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2021 | Conference Paper | IST-REx-ID: 11920 | OA
Dynamic set cover: Improved amortized and worst-case update time
S. Bhattacharya, M.H. Henzinger, D. Nanongkai, X. Wu, in:, 32nd Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2021, pp. 2537–2549.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2021 | Conference Paper | IST-REx-ID: 11931 | OA
Fully dynamic k-center clustering in low dimensional metrics
G. Goranci, M.H. Henzinger, D. Leniowski, C. Schulz, A. Svozil, in:, 2021 Proceedings of the Workshop on Algorithm Engineering and Experiments, Society for Industrial and Applied Mathematics, 2021, pp. 143–153.
[Published Version] View | DOI | Download Published Version (ext.)
 

2021 | Journal Article | IST-REx-ID: 11956 | OA
Chromoselective photocatalysis enables stereocomplementary biocatalytic pathways
L. Schmermund, S. Reischauer, S. Bierbaumer, C.K. Winkler, A. Diaz‐Rodriguez, L.J. Edwards, S. Kara, T. Mielke, J. Cartwright, G. Grogan, B. Pieber, W. Kroutil, Angewandte Chemie International Edition 60 (2021) 6965–6969.
[Published Version] View | DOI | Download Published Version (ext.)
 

Search

Filter Publications