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 Andersson

Bardiya Aryanfard

Negar Babashah

Anamay Chaturvedi

Antoine El-Hayek

Daniel Rutschmann

Roodabeh Safavi Hemami

Da Wei Zheng

Sricharan Arunapuram Rangaramanujam

Niklas Hahn

Evangelos Kosinas

David Saulpic

Leqi Zhu



53 Publications

2026 | Published | Conference Paper | IST-REx-ID: 22004 | OA
Chan, Timothy M., et al. “Charting the Diameter Computation Landscape of Intersection Graphs in 3D and Above.” 42nd International Symposium on Computational Geometry, vol. 367, 29:1-29:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026, doi: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, et al. “Counting Perfect Matchings in Dirac Hypergraphs.” Combinatorica, vol. 46, 5, Springer Nature, 2026, doi:10.1007/s00493-025-00194-8.
[Published Version] View | Files available | DOI | arXiv
 
2026 | Published | Conference Paper | IST-REx-ID: 21719 | OA
Goranci, Gramoz, et al. “Dynamic Hierarchical J-Tree Decomposition and Its Applications.” Proceedings of the 2026 Annual ACM SIAM Symposium on Discrete Algorithms, vol. 2026–January, Society for Industrial and Applied Mathematics, 2026, pp. 1128–80, doi:10.1137/1.9781611978971.45.
[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.” 7th Symposium on Foundations of Responsible Computing, vol. 368, 2:1-2:21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026, doi:10.4230/LIPIcs.FORC.2026.2.
[Published Version] View | Files available | DOI | arXiv
 
2026 | Published | Conference Paper | IST-REx-ID: 22245 | OA
Henzinger, Monika, et al. “An Improved Quality Hierarchical Congestion Approximator in Near-Linear Time.” 58th Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, 2026, pp. 1417–28, doi:10.1145/3798129.3800851.
[Published Version] View | Files available | DOI | arXiv
 
2026 | Published | Conference Paper | IST-REx-ID: 22246 | OA
Chang, Hsien Chih, et al. “Cutting Planarians: Planar Emulators for String Graphs.” 58th Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, 2026, pp. 2140–51, doi:10.1145/3798129.3800917.
[Published Version] View | Files available | DOI | arXiv
 
2026 | Published | Journal Article | IST-REx-ID: 22318 | OA | PlanS
Henzinger, Monika, et al. “Concurrent Composition for Differentially Private Continual Mechanisms.” Proceedings of the ACM on Management of Data, vol. 4, no. 2, Association for Computing Machinery, 2026, pp. 1–26, doi:10.1145/3801895.
[Published Version] View | Files available | DOI | arXiv
 
2026 | Published | Journal Article | IST-REx-ID: 22322 | OA | PlanS
Aryanfard, Bardiya, et al. “Improved Lower Bounds for Privacy under Continual Release.” Proceedings of the ACM on Management of Data, vol. 4, no. 2, Association for Computing Machinery, 2026, pp. 1–27, doi:10.1145/3801903.
[Published Version] View | Files available | DOI | arXiv
 
2026 | Published | Conference Paper | IST-REx-ID: 22368 | OA
D’Archivio, Niccolò, et al. “Order Statistics in Population Protocols via Simple Dynamics.” Proceedings of the Annual ACM Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2026, pp. 425–36, doi:10.1145/3796701.3815922.
[Published Version] View | Files available | DOI
 
2026 | Published | Conference Paper | IST-REx-ID: 22367 | OA
Cooper, Colin, et al. “Undecided State Dynamics with Many Opinions.” Proceedings of the Annual ACM Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2026, pp. 77–87, doi:10.1145/3796701.3815920.
[Published Version] View | Files available | DOI | arXiv
 
2026 | Published | Conference Paper | IST-REx-ID: 22327 | OA
Breitkopf, Tom-Lukas, et al. “Ranking Opinions with Few States in Population Protocols.” Proceedings of the ACM Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2026, pp. 414–24, doi:10.1145/3796701.3815913.
[Published Version] View | Files available | DOI | arXiv
 
2026 | Published | Thesis | PhD | IST-REx-ID: 22281 | OA
El-Hayek, Antoine. Handling Updates and Failures: Dynamic Graph Algorithms and Distributed Computing on Dynamic Networks. Institute of Science and Technology Austria, 2026, doi:10.15479/AT-ISTA-22281.
[Published Version] View | Files available | DOI
 
2026 | Published | Conference Paper | IST-REx-ID: 21720 | OA
El-Hayek, Antoine, et al. “Deterministic and Exact Fully-Dynamic Minimum Cut of Superpolylogarithmic Size in Subpolynomial Time.” Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms, vol. 2026, Society for Industrial and Applied Mathematics, 2026, pp. 613–63, doi:10.1137/1.9781611978971.25.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
2026 | Published | Conference Paper | IST-REx-ID: 22405 | OA
Chan, Timothy M., et al. “Charting the Landscape of Diameter Computation on Geometric Intersection Graphs in the Plane.” 53rd International Colloquium on Automata, Languages, and Programming, vol. 374, 54:1-54:22, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026, doi:10.4230/LIPICS.ICALP.2026.54.
[Published Version] View | Files available | DOI | arXiv
 
2026 | Published | Journal Article | IST-REx-ID: 22716 | OA | PlanS
Goranci, Gramoz, et al. “Incremental Approximate Maximum Flow via Residual Graph Sparsification.” ACM Transactions on Algorithms, vol. 22, no. 3, 31, ACM, 2026, doi:10.1145/3816252.
[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, vol. 210, Springer Nature, 2025, pp. 881–94, doi: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.” Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, vol. 5, Association for Computing Machinery, 2025, pp. 2951–70, doi:10.1137/1.9781611978322.95.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
2025 | Published | Conference Paper | IST-REx-ID: 19858 | OA
El-Hayek, Antoine, et al. “On B-Matching and Fully-Dynamic Maximum k-Edge Coloring.” 4th Symposium on Algorithmic Foundations of Dynamic Networks, vol. 330, 4, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025, doi:10.4230/LIPIcs.SAND.2025.4.
[Published Version] View | Files available | DOI | WoS | arXiv
 
2025 | Published | Conference Paper | IST-REx-ID: 20052 | OA
Breitkopf, Tom-Lukas, et al. “Brief Announcement: Minimizing Energy Solves Relative Majority with a Cubic Number of States in Population Protocols.” Proceedings of the ACM Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2025, pp. 549–52, doi:10.1145/3732772.3733512.
[Published Version] View | Files available | DOI | WoS
 
2025 | Published | Conference Paper | IST-REx-ID: 20301 | OA
Henzinger, Monika, et al. “Differentially Private Continual Release of Histograms and Related Queries.” The 28th International Conference on Artificial Intelligence and Statistics, vol. 258, ML Research Press, 2025, pp. 1990–98.
[Preprint] View | Download Preprint (ext.) | arXiv
 

Search

Filter Publications

Display / Sort

Citation Style: MLA

Export / Embed