Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
13 Publications
2024 | Conference Paper | IST-REx-ID: 15008 | 
G. Goranci, M. H. Henzinger, H. Räcke, S. Sachdeva, and A. R. Sricharan, “Electrical flows for polylogarithmic competitive oblivious routing,” in 15th Innovations in Theoretical Computer Science Conference, Berkeley, CA, United States, 2024, vol. 287.
[Published Version]
View
| Files available
| DOI
| arXiv
2024 | Conference Paper | IST-REx-ID: 14769 |
M. H. Henzinger, D. Saulpic, and L. Sidl, “Experimental evaluation of fully dynamic k-means via coresets,” in 2024 Proceedings of the Symposium on Algorithm Engineering and Experiments, Alexandria, VA, United States, 2024, pp. 220–233.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2024 | Journal Article | IST-REx-ID: 15121 |
D. W. Zheng and M. H. Henzinger, “Multiplicative auction algorithm for approximate maximum weight bipartite matching,” Mathematical Programming. Springer Nature, 2024.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2024 | Conference Paper | IST-REx-ID: 15093 |
S. Cultrera di Montesano, H. Edelsbrunner, M. H. Henzinger, and L. Ost, “Dynamically maintaining the persistent homology of time series,” in Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Alexandria, VA, USA, 2024, pp. 243–295.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2024 | Conference Paper | IST-REx-ID: 15253 |
M. H. Henzinger, J. Upadhyay, and S. Upadhyay, “A unifying framework for differentially private sums under continual observation,” in Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms, Alexandria, VA, United States, 2024, vol. 2024, pp. 995–1018.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2023 | Conference Paper | IST-REx-ID: 12760 |
M. H. Henzinger, S. Neumann, H. Räcke, and S. Schmid, “Dynamic maintenance of monotone dynamic programs and applications,” in 40th International Symposium on Theoretical Aspects of Computer Science, Hamburg, Germany, 2023, vol. 254.
[Published Version]
View
| Files available
| DOI
| arXiv
2023 | Conference Paper | IST-REx-ID: 14085 |
G. Goranci and M. H. Henzinger, “Efficient data structures for incremental exact and approximate maximum flow,” in 50th International Colloquium on Automata, Languages, and Programming, Paderborn, Germany, 2023, vol. 261.
[Published Version]
View
| Files available
| DOI
2023 | Conference Paper | IST-REx-ID: 14086 |
M. H. Henzinger, P. Liu, J. Vondrák, and D. W. Zheng, “Faster submodular maximization for several classes of matroids,” in 50th International Colloquium on Automata, Languages, and Programming, Paderborn, Germany, 2023, vol. 261.
[Published Version]
View
| Files available
| DOI
| arXiv
2023 | Conference Paper | IST-REx-ID: 14462 |
H. Fichtenberger, M. H. Henzinger, and J. Upadhyay, “Constant matters: Fine-grained error bound on differentially private continual observation,” in Proceedings of the 40th International Conference on Machine Learning, Honolulu, Hawaii, HI, United States, 2023, vol. 202, pp. 10072–10092.
[Published Version]
View
| Download Published Version (ext.)
2023 | Journal Article | IST-REx-ID: 14558
S. Bhattacharya, M. H. Henzinger, D. Nanongkai, and X. Wu, “Deterministic near-optimal approximation algorithms for dynamic set cover,” SIAM Journal on Computing, vol. 52, no. 5. Society for Industrial and Applied Mathematics, pp. 1132–1192, 2023.
View
| DOI