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.
41 Publications
2026 |
Published |
Journal Article |
IST-REx-ID: 21159 |
| 
|
Kwan MA, Safavi Hemami R, Wang Y. Counting perfect matchings in Dirac hypergraphs. Combinatorica. 2026;46. doi:10.1007/s00493-025-00194-8
[Published Version]
View
| Files available
| DOI
| arXiv
2026 |
Published |
Conference Paper |
IST-REx-ID: 21719 |
Goranci G, Henzinger M, Kiss P, Momeni A, Zöcklein G. Dynamic hierarchical j-tree decomposition and its applications. In: Proceedings of the 2026 Annual ACM SIAM Symposium on Discrete Algorithms. Vol 2026-January. Society for Industrial and Applied Mathematics; 2026:1128-1180. doi:10.1137/1.9781611978971.45
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2026 |
Published |
Conference Paper |
IST-REx-ID: 21720 |
El-Hayek A, Henzinger M, Li J. Deterministic and exact fully-dynamic minimum cut of superpolylogarithmic size in subpolynomial time. In: Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms. Vol 2026. Society for Industrial and Applied Mathematics; 2026:613-663. doi:10.1137/1.9781611978971.25
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2025 |
Published |
Conference Paper |
IST-REx-ID: 19858 |
El-Hayek A, Hanauer K, Henzinger M. 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. doi:10.4230/LIPIcs.SAND.2025.4
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2025 |
Published |
Conference Paper |
IST-REx-ID: 19982 |
El-Hayek A, Henzinger M, Li J. Fully dynamic approximate minimum cut in subpolynomial time per operation. In: Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics; 2025:750-784. doi:10.1137/1.9781611978322.22
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2025 |
Published |
Conference Paper |
IST-REx-ID: 20051 |
El-Hayek A, Elsässer R, Schmid S. 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. doi:10.1145/3732772.3733505
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2025 |
Published |
Conference Paper |
IST-REx-ID: 20052 |
Breitkopf T-L, Dallot J, El-Hayek A, Schmid S. 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. Association for Computing Machinery; 2025:549-552. doi:10.1145/3732772.3733512
[Published Version]
View
| Files available
| DOI
| WoS
2025 |
Published |
Conference Paper |
IST-REx-ID: 20301 |
Henzinger M, Sricharan AR, Steiner TA. Differentially private continual release of histograms and related queries. In: The 28th International Conference on Artificial Intelligence and Statistics. Vol 258. ML Research Press; 2025:1990-1998.
[Preprint]
View
| Download Preprint (ext.)
| arXiv
2025 |
Published |
Conference Paper |
IST-REx-ID: 20533 |
Henzinger M, Safavi Hemami R. 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. doi:10.4230/LIPIcs.ESA.2025.2
[Published Version]
View
| Files available
| DOI
2025 |
Published |
Conference Paper |
IST-REx-ID: 20534 |
Henzinger M, Kosinas E, Münk R, Räcke H. Efficient contractions of dynamic graphs - with applications. In: 33rd Annual European Symposium on Algorithms. Vol 351. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2025. doi:10.4230/LIPIcs.ESA.2025.36
[Published Version]
View
| Files available
| DOI
| arXiv
2025 |
Published |
Conference Paper |
IST-REx-ID: 20535 |
Dhulipala L, Henzinger M, Li GZ, Liu QC, Sricharan AR, Zhu L. 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. doi:10.4230/LIPIcs.ESA.2025.91
[Published Version]
View
| Files available
| DOI
| arXiv
2025 |
Published |
Conference Paper |
IST-REx-ID: 20536 |
Safavi Hemami R, Seybold MP. 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. doi:10.4230/LIPIcs.WADS.2025.47
[Published Version]
View
| Files available
| DOI
| arXiv
2025 |
Published |
Conference Paper |
IST-REx-ID: 19038 |
Henzinger M, Upadhyay J. Improved differentially private continual observation using group algebra. In: Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms. Vol 5. Association for Computing Machinery; 2025:2951-2970. doi:10.1137/1.9781611978322.95
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2025 |
Published |
Journal Article |
IST-REx-ID: 15121 |
Zheng DW, Henzinger M. Multiplicative auction algorithm for approximate maximum weight bipartite matching. Mathematical Programming. 2025;210:881-894. doi:10.1007/s10107-024-02066-3
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2025 |
Published |
Conference Paper |
IST-REx-ID: 21280 |
Goranci G, Henzinger M, Räcke H, Sricharan A. Incremental approximate maximum flow via residual graph sparsification. In: 52nd International Colloquium on Automata, Languages, and Programming. Vol 334. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2025:91:1-91:20. doi:10.4230/lipics.icalp.2025.91
[Published Version]
View
| Files available
| DOI
| arXiv
2025 |
Published |
Conference Paper |
IST-REx-ID: 20819 |
Scott JA, Lampert C, Saulpic D. Differentially private federated k-means clustering with server-side data. In: 42nd International Conference on Machine Learning. Vol 267. ML Research Press; 2025:53757-53790.
[Published Version]
View
| Files available
| arXiv
2024 |
Published |
Conference Paper |
IST-REx-ID: 18156 |
Henzinger M, Sricharan AR, Steiner TA. Private counting of distinct elements in the turnstile model and extensions. In: International Conference on Approximation Algorithms for Combinatorial Optimization Problems . Vol 317. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024. doi:10.4230/LIPIcs.APPROX/RANDOM.2024.40
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2024 |
Published |
Conference Paper |
IST-REx-ID: 18308 |
La Tour MD, Henzinger M, Saulpic D. 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. doi:10.4230/LIPIcs.ESA.2024.100
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2024 |
Published |
Conference Paper |
IST-REx-ID: 18309 |
Hu B, Kosinas E, Polak A. Connectivity oracles for predictable vertex failures. In: 32nd Annual European Symposium on Algorithms. Vol 308. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024. doi:10.4230/LIPIcs.ESA.2024.72
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2024 |
Published |
Conference Paper |
IST-REx-ID: 18503 |
Henzinger M, Li J, Rao S, Wang D. Deterministic near-linear time minimum cut in weighted graphs. In: 35th Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics; 2024:3089-3139. doi:10.1137/1.9781611977912.111
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv