Please note that ISTA Research Explorer no longer supports Internet Explorer versions 8 or 9 (or earlier).

We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.

42 Publications


2026 | Published | Conference Paper | IST-REx-ID: 22004 | OA
Chan, T. M., Chang, H. C., Gao, J., Kisfaludi-Bak, S., Le, H., & Zheng, D. W. (2026). Charting the diameter computation landscape of intersection graphs in 3D and above. In 42nd International Symposium on Computational Geometry (Vol. 367). New Brunswick, NJ, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. 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, M. A., Safavi Hemami, R., & Wang, Y. (2026). Counting perfect matchings in Dirac hypergraphs. Combinatorica. Springer Nature. 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, G., Henzinger, M., Kiss, P., Momeni, A., & Zöcklein, G. (2026). Dynamic hierarchical j-tree decomposition and its applications. In Proceedings of the 2026 Annual ACM SIAM Symposium on Discrete Algorithms (Vol. 2026–January, pp. 1128–1180). Society for Industrial and Applied Mathematics. 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, A., Henzinger, M., & Li, J. (2026). 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, pp. 613–663). Vancouver, Canada: Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611978971.25
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2025 | Published | Conference Paper | IST-REx-ID: 21280 | OA
Goranci, G., Henzinger, M., Räcke, H., & Sricharan, A. (2025). Incremental approximate maximum flow via residual graph sparsification. In 52nd International Colloquium on Automata, Languages, and Programming (Vol. 334, p. 91:1-91:20). Aarhus, Denmark: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. 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, D. W., & Henzinger, M. (2025). Multiplicative auction algorithm for approximate maximum weight bipartite matching. Mathematical Programming. Springer Nature. 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, M., & Upadhyay, J. (2025). Improved differentially private continual observation using group algebra. In Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (Vol. 5, pp. 2951–2970). New Orleans, LA, United States: Association for Computing Machinery. 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, A., Hanauer, K., & Henzinger, M. (2025). On b-matching and fully-dynamic maximum k-edge coloring. In 4th Symposium on Algorithmic Foundations of Dynamic Networks (Vol. 330). Liverpool, United Kingdom: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. 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, A., Henzinger, M., & Li, J. (2025). Fully dynamic approximate minimum cut in subpolynomial time per operation. In Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 750–784). New Orleans, LA, United States: Society for Industrial and Applied Mathematics. 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, A., Elsässer, R., & Schmid, S. (2025). 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. Huatulco, Mexico: Association for Computing Machinery. 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, T.-L., Dallot, J., El-Hayek, A., & Schmid, S. (2025). 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 (pp. 549–552). Huatulco, Mexico: Association for Computing Machinery. https://doi.org/10.1145/3732772.3733512
[Published Version] View | Files available | DOI | WoS
 

2025 | Published | Conference Paper | IST-REx-ID: 20301 | OA
Henzinger, M., Sricharan, A. R., & Steiner, T. A. (2025). Differentially private continual release of histograms and related queries. In The 28th International Conference on Artificial Intelligence and Statistics (Vol. 258, pp. 1990–1998). Mai Khao, Thailand: ML Research Press.
[Preprint] View | Download Preprint (ext.) | arXiv
 

2025 | Published | Conference Paper | IST-REx-ID: 20533 | OA
Henzinger, M., & Safavi Hemami, R. (2025). Securing dynamic data: A primer on differentially private data structures. In 33rd Annual European Symposium on Algorithms (Vol. 351). Warsaw, Poland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. 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, M., Kosinas, E., Münk, R., & Räcke, H. (2025). Efficient contractions of dynamic graphs - with applications. In 33rd Annual European Symposium on Algorithms (Vol. 351). Warsaw, Poland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. 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, L., Henzinger, M., Li, G. Z., Liu, Q. C., Sricharan, A. R., & Zhu, L. (2025). Near-optimal differentially private graph algorithms via the Multidimensional AboveThreshold Mechanism. In 33rd Annual European Symposium on Algorithms (Vol. 351). Warsaw, Poland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. 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, R., & Seybold, M. P. (2025). B-Treaps revised: Write efficient randomized block search trees with high load. In 19th International Symposium on Algorithms and Data Structures (Vol. 349). Toronto, Canada: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. 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, J. A., Lampert, C., & Saulpic, D. (2025). Differentially private federated k-means clustering with server-side data. In 42nd International Conference on Machine Learning (Vol. 267, pp. 53757–53790). Vancouver, Canada: ML Research Press.
[Published Version] View | Files available | arXiv
 

2024 | Published | Conference Paper | IST-REx-ID: 14769 | OA
Henzinger, M., Saulpic, D., & Sidl, L. (2024). Experimental evaluation of fully dynamic k-means via coresets. In 2024 Proceedings of the Symposium on Algorithm Engineering and Experiments (pp. 220–233). Alexandria, VA, United States: Society for Industrial and Applied Mathematics. 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, G., Henzinger, M., Räcke, H., Sachdeva, S., & Sricharan, A. R. (2024). Electrical flows for polylogarithmic competitive oblivious routing. In 15th Innovations in Theoretical Computer Science Conference (Vol. 287). Berkeley, CA, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ITCS.2024.55
[Published Version] View | Files available | DOI | WoS | arXiv
 

2024 | Published | Conference Paper | IST-REx-ID: 15093 | OA
Cultrera di Montesano, S., Edelsbrunner, H., Henzinger, M., & Ost, L. (2024). Dynamically maintaining the persistent homology of time series. In D. P. Woodruff (Ed.), Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) (pp. 243–295). Alexandria, VA, USA: Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611977912.11
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

Filters and Search Terms

department=MoHe

Search

Filter Publications

Display / Sort

Citation Style: APA

Export / Embed