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.
15 Publications
2024 |Published| Conference Paper | IST-REx-ID: 15008 |
Goranci G, Henzinger MH, Räcke H, Sachdeva S, Sricharan AR. Electrical flows for polylogarithmic competitive oblivious routing. In: 15th Innovations in Theoretical Computer Science Conference. Vol 287. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024. doi:10.4230/LIPIcs.ITCS.2024.55
[Published Version]
View
| Files available
| DOI
| arXiv
2024 |Published| Conference Paper | IST-REx-ID: 14769 |
Henzinger MH, Saulpic D, Sidl L. Experimental evaluation of fully dynamic k-means via coresets. In: 2024 Proceedings of the Symposium on Algorithm Engineering and Experiments. Society for Industrial & Applied Mathematics; 2024:220-233. doi:10.1137/1.9781611977929.17
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2024 |Epub ahead of print| Journal Article | IST-REx-ID: 15121 |
Zheng DW, Henzinger MH. Multiplicative auction algorithm for approximate maximum weight bipartite matching. Mathematical Programming. 2024. doi:10.1007/s10107-024-02066-3
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2024 |Published| Conference Paper | IST-REx-ID: 15093 |
Cultrera di Montesano S, Edelsbrunner H, Henzinger MH, Ost L. Dynamically maintaining the persistent homology of time series. In: Woodruff DP, ed. Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). Society for Industrial and Applied Mathematics; 2024:243-295. doi:10.1137/1.9781611977912.11
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2024 |Published| Conference Paper | IST-REx-ID: 15253 |
Henzinger MH, Upadhyay J, Upadhyay S. A unifying framework for differentially private sums under continual observation. In: Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms. Vol 2024. Society for Industrial and Applied Mathematics; 2024:995-1018. doi:10.1137/1.9781611977912.38
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2024 |Epub ahead of print| Journal Article | IST-REx-ID: 17188 |
Braun P, Hahn N, Hoefer M, Schecker C. Delegated online search. Artificial Intelligence. 2024;334. doi:10.1016/j.artint.2024.104171
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
2023 |Published| Conference Paper | IST-REx-ID: 12760 |
Henzinger MH, Neumann S, Räcke H, Schmid S. Dynamic maintenance of monotone dynamic programs and applications. In: 40th International Symposium on Theoretical Aspects of Computer Science. Vol 254. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2023. doi:10.4230/LIPIcs.STACS.2023.36
[Published Version]
View
| Files available
| DOI
| arXiv
2023 |Published| Conference Paper | IST-REx-ID: 14085 |
Goranci G, Henzinger MH. Efficient data structures for incremental exact and approximate maximum flow. In: 50th International Colloquium on Automata, Languages, and Programming. Vol 261. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2023. doi:10.4230/LIPIcs.ICALP.2023.69
[Published Version]
View
| Files available
| DOI
2023 |Published| Conference Paper | IST-REx-ID: 14086 |
Henzinger MH, Liu P, Vondrák J, Zheng DW. Faster submodular maximization for several classes of matroids. In: 50th International Colloquium on Automata, Languages, and Programming. Vol 261. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2023. doi:10.4230/LIPIcs.ICALP.2023.74
[Published Version]
View
| Files available
| DOI
| arXiv
2023 |Published| Conference Paper | IST-REx-ID: 14462 |
Fichtenberger H, Henzinger MH, Upadhyay J. Constant matters: Fine-grained error bound on differentially private continual observation. In: Proceedings of the 40th International Conference on Machine Learning. Vol 202. ML Research Press; 2023:10072-10092.
[Published Version]
View
| Download Published Version (ext.)
2023 |Published| Journal Article | IST-REx-ID: 14558
Bhattacharya S, Henzinger MH, Nanongkai D, Wu X. Deterministic near-optimal approximation algorithms for dynamic set cover. SIAM Journal on Computing. 2023;52(5):1132-1192. doi:10.1137/21M1428649
View
| DOI
2023 |Published| Conference Paper | IST-REx-ID: 14768 |
Cohen-Addad V, Saulpic D, Schwiegelshohn C. Deterministic clustering in high dimensional spaces: Sketches and approximation. In: 2023 IEEE 64th Annual Symposium on Foundations of Computer Science. IEEE; 2023:1105-1130. doi:10.1109/focs57990.2023.00066
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2023 |Published| Journal Article | IST-REx-ID: 14043 |
Henzinger MH, Jin B, Peng R, Williamson DP. A combinatorial cut-toggling algorithm for solving Laplacian linear systems. Algorithmica. 2023;85:2680-3716. doi:10.1007/s00453-023-01154-8
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2023 |Published| Conference Paper | IST-REx-ID: 13236 |
Zheng DW, Henzinger MH. Multiplicative auction algorithm for approximate maximum weight bipartite matching. In: International Conference on Integer Programming and Combinatorial Optimization. Vol 13904. Springer Nature; 2023:453-465. doi:10.1007/978-3-031-32726-1_32
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2023 |Published| Conference Paper | IST-REx-ID: 15364 |
Charikar M, Hu L, Henzinger MH, Vötsch M, Waingarten E. Simple, scalable and effective clustering via one-dimensional projections. In: 37th Conference on Neural Information Processing Systems. Vol 36. ; 2023.
[Published Version]
View
| Files available
| arXiv