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.
59 Publications
2024 |
Published |
Conference Paper |
IST-REx-ID: 18308 |
La Tour, Max Dupré, Monika Henzinger, and David Saulpic. “Fully Dynamic K-Means Coreset in near-Optimal Update Time.” In 32nd Annual European Symposium on Algorithms, Vol. 308. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. https://doi.org/10.4230/LIPIcs.ESA.2024.100.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2024 |
Published |
Conference Paper |
IST-REx-ID: 18309 |
Hu, Bingbing, Evangelos Kosinas, and Adam Polak. “Connectivity Oracles for Predictable Vertex Failures.” In 32nd Annual European Symposium on Algorithms, Vol. 308. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. https://doi.org/10.4230/LIPIcs.ESA.2024.72.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2024 |
Published |
Conference Paper |
IST-REx-ID: 18115 |
Axiotis, Kyriakos, Vincent Cohen-Addad, Monika Henzinger, Sammy Jerome, Vahab Mirrokni, David Saulpic, David P. Woodruff, and Michael Wunder. “Data-Efficient Learning via Clustering-Based Sensitivity Sampling: Foundation Models and Beyond.” In Proceedings of the 41st International Conference on Machine Learning, 235:2086–2107. ML Research Press, 2024.
[Published Version]
View
| Download Published Version (ext.)
| arXiv
2024 |
Published |
Conference Paper |
IST-REx-ID: 18503 |
Henzinger, Monika, Jason Li, Satish Rao, and Di Wang. “Deterministic Near-Linear Time Minimum Cut in Weighted Graphs.” In 35th Annual ACM-SIAM Symposium on Discrete Algorithms, 3089–3139. Society for Industrial and Applied Mathematics, 2024. https://doi.org/10.1137/1.9781611977912.111.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2024 |
Published |
Conference Paper |
IST-REx-ID: 18116 |
La Tour, Max Dupré, Monika Henzinger, and David Saulpic. “Making Old Things New: A Unified Algorithm for Differentially Private Clustering.” In Proceedings of the 41st International Conference on Machine Learning, 235:12046–86. ML Research Press, 2024.
[Published Version]
View
| Download Published Version (ext.)
| arXiv
2024 |
Published |
Conference Paper |
IST-REx-ID: 15253 |
Henzinger, Monika, Jalaj Upadhyay, and Sarvagya Upadhyay. “A Unifying Framework for Differentially Private Sums under Continual Observation.” In Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms, 2024:995–1018. Society for Industrial and Applied Mathematics, 2024. https://doi.org/10.1137/1.9781611977912.38.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2024 |
Published |
Conference Paper |
IST-REx-ID: 18928 |
Henzinger, Monika, Barna Saha, Martin P. Seybold, and Christopher Ye. “On the Complexity of Algorithms with Predictions for Dynamic Graph Problems.” In 15th Innovations in Theoretical Computer Science Conference, 287:62:1-62:25. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. https://doi.org/10.4230/LIPIcs.ITCS.2024.62.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2024 |
Published |
Conference Paper |
IST-REx-ID: 18906 |
Hanauer, Kathrin, Monika Henzinger, Robin Münk, Harald Räcke, and Maximilian Vötsch. “Expander Hierarchies for Normalized Cuts on Graphs.” In Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 1016–27. ACM, 2024. https://doi.org/10.1145/3637528.3671978.
[Published Version]
View
| Files available
| DOI
| WoS
2024 |
Published |
Journal Article |
IST-REx-ID: 17188 |
Braun, Pirmin, Niklas Hahn, Martin Hoefer, and Conrad Schecker. “Delegated Online Search.” Artificial Intelligence. Elsevier, 2024. https://doi.org/10.1016/j.artint.2024.104171.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2024 |
Published |
Conference Paper |
IST-REx-ID: 18922
Georgiadis, Loukas, Giuseppe F. Italiano, and Evangelos Kosinas. “Computing the 3-Edge-Connected Components of Directed Graphs in Linear Time.” In 65th Annual Symposium on Foundations of Computer Science, 62–85. IEEE, 2024. https://doi.org/10.1109/focs61266.2024.00015.
View
| DOI
| WoS
2023 |
Published |
Conference Paper |
IST-REx-ID: 12760 |
Henzinger, Monika, Stefan Neumann, Harald Räcke, and Stefan Schmid. “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. https://doi.org/10.4230/LIPIcs.STACS.2023.36.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2023 |
Published |
Journal Article |
IST-REx-ID: 14043 |
Henzinger, Monika, Billy Jin, Richard Peng, and David P. Williamson. “A Combinatorial Cut-Toggling Algorithm for Solving Laplacian Linear Systems.” Algorithmica. Springer Nature, 2023. https://doi.org/10.1007/s00453-023-01154-8.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2023 |
Published |
Conference Paper |
IST-REx-ID: 14085 |
Goranci, Gramoz, and Monika Henzinger. “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. https://doi.org/10.4230/LIPIcs.ICALP.2023.69.
[Published Version]
View
| Files available
| DOI
| arXiv
2023 |
Published |
Conference Paper |
IST-REx-ID: 14086 |
Henzinger, Monika, Paul Liu, Jan Vondrák, and Da Wei Zheng. “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. https://doi.org/10.4230/LIPIcs.ICALP.2023.74.
[Published Version]
View
| Files available
| DOI
| arXiv
2023 |
Published |
Conference Paper |
IST-REx-ID: 14462 |
Fichtenberger, Hendrik, Monika Henzinger, and Jalaj Upadhyay. “Constant Matters: Fine-Grained Error Bound on Differentially Private Continual Observation.” In Proceedings of the 40th International Conference on Machine Learning, 202:10072–92. ML Research Press, 2023.
[Published Version]
View
| Download Published Version (ext.)
| arXiv
2023 |
Published |
Journal Article |
IST-REx-ID: 14558
Bhattacharya, Sayan, Monika Henzinger, Danupon Nanongkai, and Xiaowei Wu. “Deterministic Near-Optimal Approximation Algorithms for Dynamic Set Cover.” SIAM Journal on Computing. Society for Industrial and Applied Mathematics, 2023. https://doi.org/10.1137/21M1428649.
View
| DOI
| WoS
2023 |
Published |
Conference Paper |
IST-REx-ID: 14768 |
Cohen-Addad, Vincent, David Saulpic, and Chris Schwiegelshohn. “Deterministic Clustering in High Dimensional Spaces: Sketches and Approximation.” In 2023 IEEE 64th Annual Symposium on Foundations of Computer Science, 1105–30. IEEE, 2023. https://doi.org/10.1109/focs57990.2023.00066.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2023 |
Published |
Conference Paper |
IST-REx-ID: 15364 |
Charikar, Moses, Lunjia Hu, Monika Henzinger, Maximilian Vötsch, and Erik Waingarten. “Simple, Scalable and Effective Clustering via One-Dimensional Projections.” In 37th Conference on Neural Information Processing Systems, Vol. 36. Neural Information Processing Systems Foundation, 2023.
[Published Version]
View
| Files available
| arXiv
earlier version | 2023 |
Published |
Conference Paper |
IST-REx-ID: 13236 |
Zheng, Da Wei, and Monika Henzinger. “Multiplicative Auction Algorithm for Approximate Maximum Weight Bipartite Matching.” In International Conference on Integer Programming and Combinatorial Optimization, 13904:453–65. Springer Nature, 2023. https://doi.org/10.1007/978-3-031-32726-1_32.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv