Algorithms and hardness for diameter in dynamic graphs
B. Ancona, M.H. Henzinger, L. Roditty, V.V. Williams, N. Wein, in:, 46th International Colloquium on Automata, Languages, and Programming, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.
LibreCat: https://research-explorer.ista.ac.at/record/11826
DOI: 10.4230/LIPICS.ICALP.2019.13
arXiv: 811.12527

Efficient distributed workload (re-)embedding
M.H. Henzinger, S. Neumann, S. Schmid, in:, SIGMETRICS’19: International Conference on Measurement and Modeling of Computer Systems, Association for Computing Machinery, 2019, pp. 43–44.
LibreCat: https://research-explorer.ista.ac.at/record/11850
DOI: 10.1145/3309697.3331503
arXiv: 1904.05474

A new deterministic algorithm for dynamic set cover
S. Bhattacharya, M.H. Henzinger, D. Nanongkai, in:, 60th Annual Symposium on Foundations of Computer Science, Institute of Electrical and Electronics Engineers, 2019, pp. 406–423.
LibreCat: https://research-explorer.ista.ac.at/record/11853
DOI: 10.1109/focs.2019.00033
arXiv: 1909.11600

Distributed edge connectivity in sublinear time
M. Daga, M.H. Henzinger, D. Nanongkai, T. Saranurak, in:, Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, Association for Computing Machinery, 2019, pp. 343–354.
LibreCat: https://research-explorer.ista.ac.at/record/11865
DOI: 10.1145/3313276.3316346
arXiv: 1904.04341

A deamortization approach for dynamic spanner and dynamic maximal matching
A. Bernstein, S. Forster, M.H. Henzinger, in:, 30th Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2019, pp. 1899–1918.
LibreCat: https://research-explorer.ista.ac.at/record/11871
DOI: 10.1137/1.9781611975482.115
arXiv: 1810.10932