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.
35 Publications
2024 | Published | Conference Paper | IST-REx-ID: 18503 | 
Henzinger, M., Li, J., Rao, S., & Wang, D. (2024). Deterministic near-linear time minimum cut in weighted graphs. In 35th Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 3089–3139). Alexandria, VA, United States: Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611977912.111
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2024 | Published | Conference Paper | IST-REx-ID: 15008 |
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 | Journal Article | IST-REx-ID: 17188 |
Braun, P., Hahn, N., Hoefer, M., & Schecker, C. (2024). Delegated online search. Artificial Intelligence. Elsevier. https://doi.org/10.1016/j.artint.2024.104171
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2024 | Published | Conference Paper | IST-REx-ID: 18906 |
Hanauer, K., Henzinger, M., Münk, R., Räcke, H., & Vötsch, M. (2024). Expander hierarchies for normalized cuts on graphs. In Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (pp. 1016–1027). Barcelona, Spain: ACM. https://doi.org/10.1145/3637528.3671978
[Published Version]
View
| Files available
| DOI
| WoS
2024 | Published | Conference Paper | IST-REx-ID: 18928 |
Henzinger, M., Saha, B., Seybold, M. P., & Ye, C. (2024). On the complexity of algorithms with predictions for dynamic graph problems. In 15th Innovations in Theoretical Computer Science Conference (Vol. 287, p. 62:1-62:25). Berkeley, CA, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ITCS.2024.62
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2024 | Published | Conference Paper | IST-REx-ID: 18922
Georgiadis, L., Italiano, G. F., & Kosinas, E. (2024). Computing the 3-edge-connected components of directed graphs in linear time. In 65th Annual Symposium on Foundations of Computer Science (pp. 62–85). Chicago, IL, United States: IEEE. https://doi.org/10.1109/focs61266.2024.00015
View
| DOI
| WoS
2023 | Published | Journal Article | IST-REx-ID: 14043 |
Henzinger, M., Jin, B., Peng, R., & Williamson, D. P. (2023). A combinatorial cut-toggling algorithm for solving Laplacian linear systems. Algorithmica. Springer Nature. https://doi.org/10.1007/s00453-023-01154-8
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2023 | Published | Conference Paper | IST-REx-ID: 15364 |
Charikar, M., Hu, L., Henzinger, M., Vötsch, M., & Waingarten, E. (2023). Simple, scalable and effective clustering via one-dimensional projections. In 37th Conference on Neural Information Processing Systems (Vol. 36). New Orleans, LA, United States.
[Published Version]
View
| Files available
| arXiv
2023 | Published | Conference Paper | IST-REx-ID: 14462 |
Fichtenberger, H., Henzinger, M., & Upadhyay, J. (2023). Constant matters: Fine-grained error bound on differentially private continual observation. In Proceedings of the 40th International Conference on Machine Learning (Vol. 202, pp. 10072–10092). Honolulu, Hawaii, HI, United States: ML Research Press.
[Published Version]
View
| Download Published Version (ext.)
| arXiv
2023 | Published | Conference Paper | IST-REx-ID: 14085 |
Goranci, G., & Henzinger, M. (2023). Efficient data structures for incremental exact and approximate maximum flow. In 50th International Colloquium on Automata, Languages, and Programming (Vol. 261). Paderborn, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ICALP.2023.69
[Published Version]
View
| Files available
| DOI
| arXiv
2023 | Published | Conference Paper | IST-REx-ID: 14086 |
Henzinger, M., Liu, P., Vondrák, J., & Zheng, D. W. (2023). Faster submodular maximization for several classes of matroids. In 50th International Colloquium on Automata, Languages, and Programming (Vol. 261). Paderborn, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ICALP.2023.74
[Published Version]
View
| Files available
| DOI
| arXiv
2023 | Published | Conference Paper | IST-REx-ID: 12760 |
Henzinger, M., Neumann, S., Räcke, H., & Schmid, S. (2023). Dynamic maintenance of monotone dynamic programs and applications. In 40th International Symposium on Theoretical Aspects of Computer Science (Vol. 254). Hamburg, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.STACS.2023.36
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2023 | Published | Conference Paper | IST-REx-ID: 13236 |
Zheng, D. W., & Henzinger, M. (2023). Multiplicative auction algorithm for approximate maximum weight bipartite matching. In International Conference on Integer Programming and Combinatorial Optimization (Vol. 13904, pp. 453–465). Madison, WI, United States: Springer Nature. https://doi.org/10.1007/978-3-031-32726-1_32
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2023 | Published | Journal Article | IST-REx-ID: 14558
Bhattacharya, S., Henzinger, M., Nanongkai, D., & Wu, X. (2023). Deterministic near-optimal approximation algorithms for dynamic set cover. SIAM Journal on Computing. Society for Industrial and Applied Mathematics. https://doi.org/10.1137/21M1428649
View
| DOI
| WoS
2023 | Published | Conference Paper | IST-REx-ID: 14768 |
Cohen-Addad, V., Saulpic, D., & Schwiegelshohn, C. (2023). Deterministic clustering in high dimensional spaces: Sketches and approximation. In 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (pp. 1105–1130). Santa Cruz, CA, United States: IEEE. https://doi.org/10.1109/focs57990.2023.00066
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv