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.

Monika Henzinger

Joel Daniel Andersson

Sricharan Arunapuram Rangaramanujam

Bardiya Aryanfard

Negar Babashah

Anamay Chaturvedi

Antoine El-Hayek

Daniel Rutschmann

Roodabeh Safavi Hemami

Da Wei Zheng

Niklas Hahn

Evangelos Kosinas

David Saulpic

Leqi Zhu



43 Publications

2026 | Published | Conference Paper | IST-REx-ID: 22004 | OA
Chan, Timothy M., Hsien Chih Chang, Jie Gao, Sándor Kisfaludi-Bak, Hung Le, and Da Wei Zheng. “Charting the Diameter Computation Landscape of Intersection Graphs in 3D and Above.” In 42nd International Symposium on Computational Geometry, Vol. 367. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026. https://doi.org/10.4230/LIPIcs.SoCG.2026.29.
[Published Version] View | Files available | DOI | arXiv
 
2026 | Published | Journal Article | IST-REx-ID: 21159 | OA | PlanS
Kwan, Matthew Alan, Roodabeh Safavi Hemami, and Yiting Wang. “Counting Perfect Matchings in Dirac Hypergraphs.” Combinatorica. Springer Nature, 2026. https://doi.org/10.1007/s00493-025-00194-8.
[Published Version] View | Files available | DOI | arXiv
 
2026 | Published | Conference Paper | IST-REx-ID: 21719 | OA
Goranci, Gramoz, Monika Henzinger, Peter Kiss, Ali Momeni, and Gernot Zöcklein. “Dynamic Hierarchical J-Tree Decomposition and Its Applications.” In Proceedings of the 2026 Annual ACM SIAM Symposium on Discrete Algorithms, 2026–January:1128–80. Society for Industrial and Applied Mathematics, 2026. https://doi.org/10.1137/1.9781611978971.45.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
2026 | Published | Conference Paper | IST-REx-ID: 21720 | OA
El-Hayek, Antoine, Monika Henzinger, and Jason Li. “Deterministic and Exact Fully-Dynamic Minimum Cut of Superpolylogarithmic Size in Subpolynomial Time.” In Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms, 2026:613–63. Society for Industrial and Applied Mathematics, 2026. https://doi.org/10.1137/1.9781611978971.25.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
2026 | Published | Conference Paper | IST-REx-ID: 22146 | OA
Kalinin, Nikita, and Joel D Andersson. “Learning Rate Scheduling with Matrix Factorization for Private Training.” In 7th Symposium on Foundations of Responsible Computing, Vol. 368. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026. https://doi.org/10.4230/LIPIcs.FORC.2026.2.
[Published Version] View | Files available | DOI | arXiv
 
2025 | Published | Conference Paper | IST-REx-ID: 21280 | OA
Goranci, Gramoz, Monika Henzinger, Harald Räcke, and A. Sricharan. “Incremental Approximate Maximum Flow via Residual Graph Sparsification.” In 52nd International Colloquium on Automata, Languages, and Programming, 334:91:1-91:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. https://doi.org/10.4230/lipics.icalp.2025.91.
[Published Version] View | Files available | DOI | arXiv
 
2025 | Published | Journal Article | IST-REx-ID: 15121 | OA
Zheng, Da Wei, and Monika Henzinger. “Multiplicative Auction Algorithm for Approximate Maximum Weight Bipartite Matching.” Mathematical Programming. Springer Nature, 2025. https://doi.org/10.1007/s10107-024-02066-3.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
2025 | Published | Conference Paper | IST-REx-ID: 19038 | OA
Henzinger, Monika, and Jalaj Upadhyay. “Improved Differentially Private Continual Observation Using Group Algebra.” In Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 5:2951–70. Association for Computing Machinery, 2025. https://doi.org/10.1137/1.9781611978322.95.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
2025 | Published | Conference Paper | IST-REx-ID: 19858 | OA
El-Hayek, Antoine, Kathrin Hanauer, and Monika Henzinger. “On B-Matching and Fully-Dynamic Maximum k-Edge Coloring.” In 4th Symposium on Algorithmic Foundations of Dynamic Networks, Vol. 330. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. https://doi.org/10.4230/LIPIcs.SAND.2025.4.
[Published Version] View | Files available | DOI | WoS | arXiv
 
2025 | Published | Conference Paper | IST-REx-ID: 19982 | OA
El-Hayek, Antoine, Monika Henzinger, and Jason Li. “Fully Dynamic Approximate Minimum Cut in Subpolynomial Time per Operation.” In Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 750–84. Society for Industrial and Applied Mathematics, 2025. https://doi.org/10.1137/1.9781611978322.22.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
2025 | Published | Conference Paper | IST-REx-ID: 20051 | OA
El-Hayek, Antoine, Robert Elsässer, and Stefan Schmid. “An Almost Tight Lower Bound for Plurality Consensus with Undecided State Dynamics in the Population Protocol Model.” In Proceedings of the ACM Symposium on Principles of Distributed Computing. Association for Computing Machinery, 2025. https://doi.org/10.1145/3732772.3733505.
[Published Version] View | Files available | DOI | WoS | arXiv
 
2025 | Published | Conference Paper | IST-REx-ID: 20052 | OA
Breitkopf, Tom-Lukas, Julien Dallot, Antoine El-Hayek, and Stefan Schmid. “Brief Announcement: Minimizing Energy Solves Relative Majority with a Cubic Number of States in Population Protocols.” In Proceedings of the ACM Symposium on Principles of Distributed Computing, 549–52. Association for Computing Machinery, 2025. https://doi.org/10.1145/3732772.3733512.
[Published Version] View | Files available | DOI | WoS
 
2025 | Published | Conference Paper | IST-REx-ID: 20301 | OA
Henzinger, Monika, A. R. Sricharan, and Teresa Anna Steiner. “Differentially Private Continual Release of Histograms and Related Queries.” In The 28th International Conference on Artificial Intelligence and Statistics, 258:1990–98. ML Research Press, 2025.
[Preprint] View | Download Preprint (ext.) | arXiv
 
2025 | Published | Conference Paper | IST-REx-ID: 20533 | OA
Henzinger, Monika, and Roodabeh Safavi Hemami. “Securing Dynamic Data: A Primer on Differentially Private Data Structures.” In 33rd Annual European Symposium on Algorithms, Vol. 351. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. https://doi.org/10.4230/LIPIcs.ESA.2025.2.
[Published Version] View | Files available | DOI
 
2025 | Published | Conference Paper | IST-REx-ID: 20534 | OA
Henzinger, Monika, Evangelos Kosinas, Robin Münk, and Harald Räcke. “Efficient Contractions of Dynamic Graphs - with Applications.” In 33rd Annual European Symposium on Algorithms, Vol. 351. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. https://doi.org/10.4230/LIPIcs.ESA.2025.36.
[Published Version] View | Files available | DOI | arXiv
 
2025 | Published | Conference Paper | IST-REx-ID: 20535 | OA
Dhulipala, Laxman, Monika Henzinger, George Z. Li, Quanquan C. Liu, A. R. Sricharan, and Leqi Zhu. “Near-Optimal Differentially Private Graph Algorithms via the Multidimensional AboveThreshold Mechanism.” In 33rd Annual European Symposium on Algorithms, Vol. 351. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. https://doi.org/10.4230/LIPIcs.ESA.2025.91.
[Published Version] View | Files available | DOI | arXiv
 
2025 | Published | Conference Paper | IST-REx-ID: 20536 | OA
Safavi Hemami, Roodabeh, and Martin P. Seybold. “B-Treaps Revised: Write Efficient Randomized Block Search Trees with High Load.” In 19th International Symposium on Algorithms and Data Structures, Vol. 349. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. https://doi.org/10.4230/LIPIcs.WADS.2025.47.
[Published Version] View | Files available | DOI | arXiv
 
2025 | Published | Conference Paper | IST-REx-ID: 20819 | OA
Scott, Jonathan A, Christoph Lampert, and David Saulpic. “Differentially Private Federated K-Means Clustering with Server-Side Data.” In 42nd International Conference on Machine Learning, 267:53757–90. ML Research Press, 2025.
[Published Version] View | Files available | arXiv
 
2024 | Published | Conference Paper | IST-REx-ID: 14769 | OA
Henzinger, Monika, David Saulpic, and Leonhard Sidl. “Experimental Evaluation of Fully Dynamic K-Means via Coresets.” In 2024 Proceedings of the Symposium on Algorithm Engineering and Experiments, 220–33. Society for Industrial and Applied Mathematics, 2024. https://doi.org/10.1137/1.9781611977929.17.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
2024 | Published | Conference Paper | IST-REx-ID: 15008 | OA
Goranci, Gramoz, Monika Henzinger, Harald Räcke, Sushant Sachdeva, and A. R. Sricharan. “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. https://doi.org/10.4230/LIPIcs.ITCS.2024.55.
[Published Version] View | Files available | DOI | WoS | arXiv
 

Filters and Search Terms

type<>research_data

Search

Filter Publications

Display / Sort

Citation Style: Chicago

Export / Embed