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.
25 Publications
2024 | Published | Conference Paper | IST-REx-ID: 15008 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Electrical flows for polylogarithmic competitive oblivious routing
G. Goranci, M. Henzinger, H. Räcke, S. Sachdeva, A.R. Sricharan, in:, 15th Innovations in Theoretical Computer Science Conference, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.
[Published Version]
View
| Files available
| DOI
| arXiv
G. Goranci, M. Henzinger, H. Räcke, S. Sachdeva, A.R. Sricharan, in:, 15th Innovations in Theoretical Computer Science Conference, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.
2024 | Epub ahead of print | Journal Article | IST-REx-ID: 15121 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Multiplicative auction algorithm for approximate maximum weight bipartite matching
D.W. Zheng, M. Henzinger, Mathematical Programming (2024).
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
D.W. Zheng, M. Henzinger, Mathematical Programming (2024).
2024 | Published | Conference Paper | IST-REx-ID: 15253 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
A unifying framework for differentially private sums under continual observation
M. Henzinger, J. Upadhyay, S. Upadhyay, in:, Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2024, pp. 995–1018.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
M. Henzinger, J. Upadhyay, S. Upadhyay, in:, Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2024, pp. 995–1018.
2024 | Published | Conference Paper | IST-REx-ID: 18115 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Data-efficient learning via clustering-based sensitivity sampling: Foundation models and beyond
K. Axiotis, V. Cohen-Addad, M. Henzinger, S. Jerome, V. Mirrokni, D. Saulpic, D.P. Woodruff, M. Wunder, in:, Proceedings of the 41st International Conference on Machine Learning, ML Research Press, 2024, pp. 2086–2107.
[Published Version]
View
| Download Published Version (ext.)
| arXiv
K. Axiotis, V. Cohen-Addad, M. Henzinger, S. Jerome, V. Mirrokni, D. Saulpic, D.P. Woodruff, M. Wunder, in:, Proceedings of the 41st International Conference on Machine Learning, ML Research Press, 2024, pp. 2086–2107.
2024 | Published | Conference Paper | IST-REx-ID: 18116 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Making old things new: A unified algorithm for differentially private clustering
M.D. La Tour, M. Henzinger, D. Saulpic, in:, Proceedings of the 41st International Conference on Machine Learning, ML Research Press, 2024, pp. 12046–12086.
[Published Version]
View
| Download Published Version (ext.)
| arXiv
M.D. La Tour, M. Henzinger, D. Saulpic, in:, Proceedings of the 41st International Conference on Machine Learning, ML Research Press, 2024, pp. 12046–12086.
2024 | Published | Conference Paper | IST-REx-ID: 18156 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Private counting of distinct elements in the turnstile model and extensions
M. Henzinger, A.R. Sricharan, T.A. Steiner, in:, International Conference on Approximation Algorithms for Combinatorial Optimization Problems , Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.
[Published Version]
View
| Files available
| DOI
| arXiv
M. Henzinger, A.R. Sricharan, T.A. Steiner, in:, International Conference on Approximation Algorithms for Combinatorial Optimization Problems , Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.
2024 | Published | Conference Paper | IST-REx-ID: 18308 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Fully dynamic k-means coreset in near-optimal update time
M.D. La Tour, M. Henzinger, D. Saulpic, in:, 32nd Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.
[Published Version]
View
| Files available
| DOI
| arXiv
M.D. La Tour, M. Henzinger, D. Saulpic, in:, 32nd Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.
2024 | Published | Conference Paper | IST-REx-ID: 18309 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Connectivity oracles for predictable vertex failures
B. Hu, E. Kosinas, A. Polak, in:, 32nd Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.
[Published Version]
View
| Files available
| DOI
| arXiv
B. Hu, E. Kosinas, A. Polak, in:, 32nd Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.
2024 | Published | Conference Paper | IST-REx-ID: 18503
Deterministic near-linear time minimum cut in weighted graphs
M. Henzinger, J. Li, S. Rao, D. Wang, in:, 35th Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2024, pp. 3089–3139.
[Preprint]
View
| DOI
| arXiv
M. Henzinger, J. Li, S. Rao, D. Wang, in:, 35th Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2024, pp. 3089–3139.
2024 | Published | Conference Paper | IST-REx-ID: 18557 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Broadcast and Consensus in stochastic dynamic networks with Byzantine nodes and adversarial edges
A. El-Hayek, M. Henzinger, S. Schmid, in:, 38th International Symposium on Distributed Computing, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.
[Published Version]
View
| Files available
| DOI
| arXiv
A. El-Hayek, M. Henzinger, S. Schmid, in:, 38th International Symposium on Distributed Computing, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.
2024 | Published | Journal Article | IST-REx-ID: 17188 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Delegated online search
P. Braun, N. Hahn, M. Hoefer, C. Schecker, Artificial Intelligence 334 (2024).
[Published Version]
View
| Files available
| DOI
| arXiv
P. Braun, N. Hahn, M. Hoefer, C. Schecker, Artificial Intelligence 334 (2024).
2024 | Published | Conference Paper | IST-REx-ID: 18906 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Expander hierarchies for normalized cuts on graphs
K. Hanauer, M. Henzinger, R. Münk, H. Räcke, M. Vötsch, in:, Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, ACM, 2024, pp. 1016–1027.
[Published Version]
View
| Files available
| DOI
K. Hanauer, M. Henzinger, R. Münk, H. Räcke, M. Vötsch, in:, Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, ACM, 2024, pp. 1016–1027.
2024 | Published | Conference Paper | IST-REx-ID: 18922
Computing the 3-edge-connected components of directed graphs in linear time
L. Georgiadis, G.F. Italiano, E. Kosinas, in:, 65th Annual Symposium on Foundations of Computer Science, IEEE, 2024, pp. 62–85.
View
| DOI
L. Georgiadis, G.F. Italiano, E. Kosinas, in:, 65th Annual Symposium on Foundations of Computer Science, IEEE, 2024, pp. 62–85.
2024 | Published | Conference Paper | IST-REx-ID: 18928 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
On the complexity of algorithms with predictions for dynamic graph problems
M. Henzinger, B. Saha, M.P. Seybold, C. Ye, in:, 15th Innovations in Theoretical Computer Science Conference, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, p. 62:1-62:25.
[Published Version]
View
| Files available
| DOI
| arXiv
M. Henzinger, B. Saha, M.P. Seybold, C. Ye, in:, 15th Innovations in Theoretical Computer Science Conference, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, p. 62:1-62:25.
2024 | Published | Conference Paper | IST-REx-ID: 14769 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Experimental evaluation of fully dynamic k-means via coresets
M. Henzinger, D. Saulpic, L. Sidl, in:, 2024 Proceedings of the Symposium on Algorithm Engineering and Experiments, Society for Industrial and Applied Mathematics, 2024, pp. 220–233.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
M. Henzinger, D. Saulpic, L. Sidl, in:, 2024 Proceedings of the Symposium on Algorithm Engineering and Experiments, Society for Industrial and Applied Mathematics, 2024, pp. 220–233.
2024 | Published | Conference Paper | IST-REx-ID: 15093 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Dynamically maintaining the persistent homology of time series
S. Cultrera di Montesano, H. Edelsbrunner, M. Henzinger, L. Ost, in:, D.P. Woodruff (Ed.), Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Society for Industrial and Applied Mathematics, 2024, pp. 243–295.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
S. Cultrera di Montesano, H. Edelsbrunner, M. Henzinger, L. Ost, in:, D.P. Woodruff (Ed.), Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Society for Industrial and Applied Mathematics, 2024, pp. 243–295.
2023 | Published | Conference Paper | IST-REx-ID: 13236 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Multiplicative auction algorithm for approximate maximum weight bipartite matching
D.W. Zheng, M. Henzinger, in:, International Conference on Integer Programming and Combinatorial Optimization, Springer Nature, 2023, pp. 453–465.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
D.W. Zheng, M. Henzinger, in:, International Conference on Integer Programming and Combinatorial Optimization, Springer Nature, 2023, pp. 453–465.
2023 | Published | Journal Article | IST-REx-ID: 14043 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
A combinatorial cut-toggling algorithm for solving Laplacian linear systems
M. Henzinger, B. Jin, R. Peng, D.P. Williamson, Algorithmica 85 (2023) 2680–3716.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
M. Henzinger, B. Jin, R. Peng, D.P. Williamson, Algorithmica 85 (2023) 2680–3716.
2023 | Published | Conference Paper | IST-REx-ID: 14085 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Efficient data structures for incremental exact and approximate maximum flow
G. Goranci, M. Henzinger, in:, 50th International Colloquium on Automata, Languages, and Programming, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.
[Published Version]
View
| Files available
| DOI
G. Goranci, M. Henzinger, in:, 50th International Colloquium on Automata, Languages, and Programming, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.
2023 | Published | Conference Paper | IST-REx-ID: 14086 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Faster submodular maximization for several classes of matroids
M. Henzinger, P. Liu, J. Vondrák, D.W. Zheng, in:, 50th International Colloquium on Automata, Languages, and Programming, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.
[Published Version]
View
| Files available
| DOI
| arXiv
M. Henzinger, P. Liu, J. Vondrák, D.W. Zheng, in:, 50th International Colloquium on Automata, Languages, and Programming, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.