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 | 
Goranci, G., Henzinger, M. H., Räcke, H., Sachdeva, S., & Sricharan, A. R. (2024). Electrical flows for polylogarithmic competitive oblivious routing. In 15th Innovations in Theoretical Computer Science Conference (Vol. 287). Berkeley, CA, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ITCS.2024.55
[Published Version]
View
| Files available
| DOI
| arXiv
2024 | Conference Paper | IST-REx-ID: 14769 |
Henzinger, M. H., Saulpic, D., & Sidl, L. (2024). Experimental evaluation of fully dynamic k-means via coresets. In 2024 Proceedings of the Symposium on Algorithm Engineering and Experiments (pp. 220–233). Alexandria, VA, United States: Society for Industrial & Applied Mathematics. https://doi.org/10.1137/1.9781611977929.17
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2024 | Journal Article | IST-REx-ID: 15121 |
Zheng, D. W., & Henzinger, M. H. (2024). Multiplicative auction algorithm for approximate maximum weight bipartite matching. Mathematical Programming. Springer Nature. https://doi.org/10.1007/s10107-024-02066-3
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2024 | Conference Paper | IST-REx-ID: 15093 |
Cultrera di Montesano, S., Edelsbrunner, H., Henzinger, M. H., & Ost, L. (2024). Dynamically maintaining the persistent homology of time series. In D. P. Woodruff (Ed.), Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) (pp. 243–295). Alexandria, VA, USA: Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611977912.11
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2024 | Conference Paper | IST-REx-ID: 15253 |
Henzinger, M. H., Upadhyay, J., & Upadhyay, S. (2024). A unifying framework for differentially private sums under continual observation. In Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (Vol. 2024, pp. 995–1018). Alexandria, VA, United States: Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611977912.38
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2023 | Conference Paper | IST-REx-ID: 12760 |
Henzinger, M. H., Neumann, S., Räcke, H., & Schmid, S. (2023). Dynamic maintenance of monotone dynamic programs and applications. In 40th International Symposium on Theoretical Aspects of Computer Science (Vol. 254). Hamburg, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.STACS.2023.36
[Published Version]
View
| Files available
| DOI
| arXiv
2023 | Conference Paper | IST-REx-ID: 14085 |
Goranci, G., & Henzinger, M. H. (2023). Efficient data structures for incremental exact and approximate maximum flow. In 50th International Colloquium on Automata, Languages, and Programming (Vol. 261). Paderborn, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ICALP.2023.69
[Published Version]
View
| Files available
| DOI
2023 | Conference Paper | IST-REx-ID: 14086 |
Henzinger, M. H., Liu, P., Vondrák, J., & Zheng, D. W. (2023). Faster submodular maximization for several classes of matroids. In 50th International Colloquium on Automata, Languages, and Programming (Vol. 261). Paderborn, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ICALP.2023.74
[Published Version]
View
| Files available
| DOI
| arXiv
2023 | Conference Paper | IST-REx-ID: 14462 |
Fichtenberger, H., Henzinger, M. H., & Upadhyay, J. (2023). Constant matters: Fine-grained error bound on differentially private continual observation. In Proceedings of the 40th International Conference on Machine Learning (Vol. 202, pp. 10072–10092). Honolulu, Hawaii, HI, United States: ML Research Press.
[Published Version]
View
| Download Published Version (ext.)
2023 | Journal Article | IST-REx-ID: 14558
Bhattacharya, S., Henzinger, M. H., Nanongkai, D., & Wu, X. (2023). Deterministic near-optimal approximation algorithms for dynamic set cover. SIAM Journal on Computing. Society for Industrial and Applied Mathematics. https://doi.org/10.1137/21M1428649
View
| DOI
2023 | Conference Paper | IST-REx-ID: 14768 |
Cohen-Addad, V., Saulpic, D., & Schwiegelshohn, C. (2023). Deterministic clustering in high dimensional spaces: Sketches and approximation. In 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (pp. 1105–1130). Santa Cruz, CA, United States: IEEE. https://doi.org/10.1109/focs57990.2023.00066
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2023 | Journal Article | IST-REx-ID: 14043 |
Henzinger, M. H., Jin, B., Peng, R., & Williamson, D. P. (2023). A combinatorial cut-toggling algorithm for solving Laplacian linear systems. Algorithmica. Springer Nature. https://doi.org/10.1007/s00453-023-01154-8
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2023 | Conference Paper | IST-REx-ID: 13236 |
Zheng, D. W., & Henzinger, M. H. (2023). Multiplicative auction algorithm for approximate maximum weight bipartite matching. In International Conference on Integer Programming and Combinatorial Optimization (Vol. 13904, pp. 453–465). Madison, WI, United States: Springer Nature. https://doi.org/10.1007/978-3-031-32726-1_32
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv