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 | OA
Henzinger M, Li J, Rao S, Wang D. 2024. Deterministic near-linear time minimum cut in weighted graphs. 35th Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 3089–3139.
[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 AR. 2024. Electrical flows for polylogarithmic competitive oblivious routing. 15th Innovations in Theoretical Computer Science Conference. ITCS: Innovations in Theoretical Computer Science, LIPIcs, vol. 287, 55.
[Published Version] View | Files available | DOI | WoS | arXiv
 

2024 | Published | Journal Article | IST-REx-ID: 17188 | OA
Braun P, Hahn N, Hoefer M, Schecker C. 2024. Delegated online search. Artificial Intelligence. 334, 104171.
[Published Version] View | Files available | DOI | WoS | arXiv
 

2024 | Published | Conference Paper | IST-REx-ID: 18906 | OA
Hanauer K, Henzinger M, Münk R, Räcke H, Vötsch M. 2024. Expander hierarchies for normalized cuts on graphs. Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining. KDD: Knowledge Discovery and Data Mining, 1016–1027.
[Published Version] View | Files available | DOI | WoS
 

2024 | Published | Conference Paper | IST-REx-ID: 18928 | OA
Henzinger M, Saha B, Seybold MP, Ye C. 2024. On the complexity of algorithms with predictions for dynamic graph problems. 15th Innovations in Theoretical Computer Science Conference. ITCS: Innovations in Theoretical Computer Science, LIPIcs, vol. 287, 62:1-62:25.
[Published Version] View | Files available | DOI | WoS | arXiv
 

2024 | Published | Conference Paper | IST-REx-ID: 18922
Georgiadis L, Italiano GF, Kosinas E. 2024. Computing the 3-edge-connected components of directed graphs in linear time. 65th Annual Symposium on Foundations of Computer Science. FOCS: Foundations of Computer Science, 62–85.
View | DOI | WoS
 

2023 | Published | Journal Article | IST-REx-ID: 14043 | OA
Henzinger M, Jin B, Peng R, Williamson DP. 2023. A combinatorial cut-toggling algorithm for solving Laplacian linear systems. Algorithmica. 85, 2680–3716.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 

2023 | Published | Conference Paper | IST-REx-ID: 15364 | OA
Charikar M, Hu L, Henzinger M, Vötsch M, Waingarten E. 2023. Simple, scalable and effective clustering via one-dimensional projections. 37th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems, NeurIPS, vol. 36.
[Published Version] View | Files available | arXiv
 

2023 | Published | Conference Paper | IST-REx-ID: 14462 | OA
Fichtenberger H, Henzinger M, Upadhyay J. 2023. Constant matters: Fine-grained error bound on differentially private continual observation. Proceedings of the 40th International Conference on Machine Learning. ICML: International Conference on Machine Learning, PMLR, vol. 202, 10072–10092.
[Published Version] View | Download Published Version (ext.) | arXiv
 

2023 | Published | Conference Paper | IST-REx-ID: 14085 | OA
Goranci G, Henzinger M. 2023. Efficient data structures for incremental exact and approximate maximum flow. 50th International Colloquium on Automata, Languages, and Programming. ICALP: Automata, Languages and Programming, LIPIcs, vol. 261, 69.
[Published Version] View | Files available | DOI | arXiv
 

2023 | Published | Conference Paper | IST-REx-ID: 14086 | OA
Henzinger M, Liu P, Vondrák J, Zheng DW. 2023. Faster submodular maximization for several classes of matroids. 50th International Colloquium on Automata, Languages, and Programming. ICALP: Automata, Languages and Programming, LIPIcs, vol. 261, 74.
[Published Version] View | Files available | DOI | arXiv
 

2023 | Published | Conference Paper | IST-REx-ID: 12760 | OA
Henzinger M, Neumann S, Räcke H, Schmid S. 2023. Dynamic maintenance of monotone dynamic programs and applications. 40th International Symposium on Theoretical Aspects of Computer Science. STACS: Symposium on Theoretical Aspects of Computer Science, LIPIcs, vol. 254, 36.
[Published Version] View | Files available | DOI | WoS | arXiv
 

2023 | Published | Conference Paper | IST-REx-ID: 13236 | OA
Zheng DW, Henzinger M. 2023. Multiplicative auction algorithm for approximate maximum weight bipartite matching. International Conference on Integer Programming and Combinatorial Optimization. IPCO: Integer Programming and Combinatorial Optimization, LNCS, vol. 13904, 453–465.
[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. 52(5), 1132–1192.
View | DOI | WoS
 

2023 | Published | Conference Paper | IST-REx-ID: 14768 | OA
Cohen-Addad V, Saulpic D, Schwiegelshohn C. 2023. Deterministic clustering in high dimensional spaces: Sketches and approximation. 2023 IEEE 64th Annual Symposium on Foundations of Computer Science. FOCS: Foundations of Computer Science, 1105–1130.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 

Filters and Search Terms

department=MoHe

Search

Filter Publications

Display / Sort

Citation Style: ISTA Annual Report

Export / Embed