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

Daniel Rutschmann

Roodabeh Safavi Hemami

Da Zheng

Sricharan Arunapuram Rangaramanujam

Antoine El-Hayek

Niklas Hahn

Evangelos Kosinas

David Saulpic

Leqi Zhu



59 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: 22246 | OA
Chang, Hsien Chih, Jonathan Conroy, Zihan Tan, and Da Wei Zheng. “Cutting Planarians: Planar Emulators for String Graphs.” In 58th Annual ACM Symposium on Theory of Computing, 2140–51. Association for Computing Machinery, 2026. https://doi.org/10.1145/3798129.3800917.
[Published Version] View | Files available | DOI | arXiv
 
2026 | Published | Journal Article | IST-REx-ID: 22318 | OA | PlanS
Henzinger, Monika, Roodabeh Safavi Hemami, and Salil Vadhan. “Concurrent Composition for Differentially Private Continual Mechanisms.” Proceedings of the ACM on Management of Data. Association for Computing Machinery, 2026. https://doi.org/10.1145/3801895.
[Published Version] View | Files available | DOI | arXiv
 
2026 | Published | Journal Article | IST-REx-ID: 22322 | OA | PlanS
Aryanfard, Bardiya, Monika Henzinger, David Saulpic, and A. R. Sricharan. “Improved Lower Bounds for Privacy under Continual Release.” Proceedings of the ACM on Management of Data. Association for Computing Machinery, 2026. https://doi.org/10.1145/3801903.
[Published Version] View | Files available | DOI | arXiv
 
2026 | Published | Conference Paper | IST-REx-ID: 22368 | OA
D’Archivio, Niccolò, Hind Almahmoud, Emanuele Natale, and Frederik Mallmann-Trenn. “Order Statistics in Population Protocols via Simple Dynamics.” In Proceedings of the Annual ACM Symposium on Principles of Distributed Computing, 425–36. Association for Computing Machinery, 2026. https://doi.org/10.1145/3796701.3815922.
[Published Version] View | Files available | DOI
 
2026 | Published | Conference Paper | IST-REx-ID: 22367 | OA
Cooper, Colin, Frederik Mallmann-Trenn, Tomasz Radzik, Nobutaka Shimizu, and Takeharu Shiraga. “Undecided State Dynamics with Many Opinions.” In Proceedings of the Annual ACM Symposium on Principles of Distributed Computing, 77–87. Association for Computing Machinery, 2026. https://doi.org/10.1145/3796701.3815920.
[Published Version] View | Files available | DOI | arXiv
 
2026 | Published | Conference Paper | IST-REx-ID: 22327 | OA
Breitkopf, Tom-Lukas, Julien Dallot, Antoine El-Hayek, and Stefan Schmid. “Ranking Opinions with Few States in Population Protocols.” In Proceedings of the ACM Symposium on Principles of Distributed Computing, 414–24. Association for Computing Machinery, 2026. https://doi.org/10.1145/3796701.3815913.
[Published Version] View | Files available | DOI | 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 | Files available | DOI | Download Preprint (ext.) | arXiv
 
2026 | Published | Conference Paper | IST-REx-ID: 22405 | OA
Chan, Timothy M., Hsien-Chih Chang, Jie Gao, Sándor Kisfaludi-Bak, Hung Le, and Da Wei Zheng. “Charting the Landscape of Diameter Computation on Geometric Intersection Graphs in the Plane.” In 53rd International Colloquium on Automata, Languages, and Programming, Vol. 374. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026. https://doi.org/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, Monika Henzinger, Harald Räcke, and A. R. Sricharan. “Incremental Approximate Maximum Flow via Residual Graph Sparsification.” ACM Transactions on Algorithms. ACM, 2026. https://doi.org/10.1145/3816252.
[Published Version] View | Files available | DOI | arXiv
 
2026 | Epub ahead of print | Journal Article | IST-REx-ID: 22812
Hahn, Niklas, Monika Henzinger, and Zofia Stefankovic. “Tight Bounds on the Performance of Dynamic Directed Cutset Data Structures Based on OMv.” Information Processing Letters. Elsevier, 2026. https://doi.org/10.1016/j.ipl.2026.106663.
View | DOI
 
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
 
2026 | Published | Conference Paper | IST-REx-ID: 22916 | OA
De Berg, Sarita, Nynne Maria Foldager Bække, Frida Astrup Eriksen, Ivor Van Der Hoog, Eva Rotenberg, and Daniel P Rutschmann. “Instance Optimal and Universally Optimal Bounds for Imprecise Pareto Fronts.” In 34th Annual European Symposium on Algorithms, Vol. 388. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026. https://doi.org/10.4230/LIPIcs.ESA.2026.106.
[Published Version] View | Files available | DOI | arXiv
 
2026 | Published | Conference Paper | IST-REx-ID: 22915 | OA
Van Der Hoog, Ivor, Eva Rotenberg, and Daniel P Rutschmann. “Tight Better-Than-Worst-Case Bounds for Element Distinctness and Set Intersection.” In 34th Annual European Symposium on Algorithms, Vol. 388. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026. https://doi.org/10.4230/LIPIcs.ESA.2026.101.
[Published Version] View | Files available | DOI | arXiv
 
2026 | Published | Conference Paper | IST-REx-ID: 22914 | OA
Zheng, Da Wei. “Real-Weighted Diameter and Eccentricities of Minor-Free and Bounded VC-Dimension Graphs in Truly Subquadratic Time.” In 34th Annual European Symposium on Algorithms, Vol. 388. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026. https://doi.org/10.4230/LIPIcs.ESA.2026.61.
[Published Version] View | Files available | DOI | arXiv
 
2026 | Published | Conference Paper | IST-REx-ID: 22918 | OA
Bhore, Sujoy, Hsien Chih Chang, Jonathan Conroy, Arnold Filtser, Eunjin Oh, Nicole Wein, and Da Wei Zheng. “DAG Covers for Structured Graphs: The Steiner Point Effect.” In 34th Annual European Symposium on Algorithms, Vol. 388. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026. https://doi.org/10.4230/LIPIcs.ESA.2026.94.
[Published Version] View | Files available | DOI | arXiv
 
2026 | Published | Conference Paper | IST-REx-ID: 22917 | OA
Van Der Hoog, Ivor, John Iacono, Eva Rotenberg, and Daniel P Rutschmann. “Near-Optimal Working-Set Heaps and Dijkstra on Pointer Machines.” In 34th Annual European Symposium on Algorithms, Vol. 388. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026. https://doi.org/10.4230/LIPIcs.ESA.2026.45.
[Published Version] View | Files available | DOI | arXiv
 
2026 | Published | Conference Paper | IST-REx-ID: 22245 | OA
Henzinger, Monika, Robin Münk, and Harald Räcke. “An Improved Quality Hierarchical Congestion Approximator in Near-Linear Time.” In 58th Annual ACM Symposium on Theory of Computing, 1417–28. ACM, 2026. https://doi.org/10.1145/3798129.3800851.
[Published Version] View | Files available | DOI | arXiv
 

Search

Filter Publications

Display / Sort

Citation Style: Chicago

Export / Embed