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, Monika, et al. “Deterministic Near-Linear Time Minimum Cut in Weighted Graphs.” 35th Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2024, pp. 3089–139, doi:10.1137/1.9781611977912.111.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2024 | Published | Conference Paper | IST-REx-ID: 15008 |
Goranci, Gramoz, et al. “Electrical Flows for Polylogarithmic Competitive Oblivious Routing.” 15th Innovations in Theoretical Computer Science Conference, vol. 287, 55, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi:10.4230/LIPIcs.ITCS.2024.55.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2024 | Published | Journal Article | IST-REx-ID: 17188 |
Braun, Pirmin, et al. “Delegated Online Search.” Artificial Intelligence, vol. 334, 104171, Elsevier, 2024, doi:10.1016/j.artint.2024.104171.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2024 | Published | Conference Paper | IST-REx-ID: 18906 |
Hanauer, Kathrin, et al. “Expander Hierarchies for Normalized Cuts on Graphs.” Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, ACM, 2024, pp. 1016–27, doi:10.1145/3637528.3671978.
[Published Version]
View
| Files available
| DOI
| WoS
2024 | Published | Conference Paper | IST-REx-ID: 18928 |
Henzinger, Monika, et al. “On the Complexity of Algorithms with Predictions for Dynamic Graph Problems.” 15th Innovations in Theoretical Computer Science Conference, vol. 287, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, p. 62:1-62:25, doi:10.4230/LIPIcs.ITCS.2024.62.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2024 | Published | Conference Paper | IST-REx-ID: 18922
Georgiadis, Loukas, et al. “Computing the 3-Edge-Connected Components of Directed Graphs in Linear Time.” 65th Annual Symposium on Foundations of Computer Science, IEEE, 2024, pp. 62–85, doi:10.1109/focs61266.2024.00015.
View
| DOI
| WoS
2023 | Published | Journal Article | IST-REx-ID: 14043 |
Henzinger, Monika, et al. “A Combinatorial Cut-Toggling Algorithm for Solving Laplacian Linear Systems.” Algorithmica, vol. 85, Springer Nature, 2023, pp. 2680–3716, doi:10.1007/s00453-023-01154-8.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2023 | Published | Conference Paper | IST-REx-ID: 15364 |
Charikar, Moses, et al. “Simple, Scalable and Effective Clustering via One-Dimensional Projections.” 37th Conference on Neural Information Processing Systems, vol. 36, 2023.
[Published Version]
View
| Files available
| arXiv
2023 | Published | Conference Paper | IST-REx-ID: 14462 |
Fichtenberger, Hendrik, et al. “Constant Matters: Fine-Grained Error Bound on Differentially Private Continual Observation.” Proceedings of the 40th International Conference on Machine Learning, vol. 202, ML Research Press, 2023, pp. 10072–92.
[Published Version]
View
| Download Published Version (ext.)
| arXiv
2023 | Published | Conference Paper | IST-REx-ID: 14085 |
Goranci, Gramoz, and Monika Henzinger. “Efficient Data Structures for Incremental Exact and Approximate Maximum Flow.” 50th International Colloquium on Automata, Languages, and Programming, vol. 261, 69, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023, doi:10.4230/LIPIcs.ICALP.2023.69.
[Published Version]
View
| Files available
| DOI
| arXiv
2023 | Published | Conference Paper | IST-REx-ID: 14086 |
Henzinger, Monika, et al. “Faster Submodular Maximization for Several Classes of Matroids.” 50th International Colloquium on Automata, Languages, and Programming, vol. 261, 74, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023, doi:10.4230/LIPIcs.ICALP.2023.74.
[Published Version]
View
| Files available
| DOI
| arXiv
2023 | Published | Conference Paper | IST-REx-ID: 12760 |
Henzinger, Monika, et al. “Dynamic Maintenance of Monotone Dynamic Programs and Applications.” 40th International Symposium on Theoretical Aspects of Computer Science, vol. 254, 36, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023, doi:10.4230/LIPIcs.STACS.2023.36.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2023 | Published | Conference Paper | IST-REx-ID: 13236 |
Zheng, Da Wei, and Monika Henzinger. “Multiplicative Auction Algorithm for Approximate Maximum Weight Bipartite Matching.” International Conference on Integer Programming and Combinatorial Optimization, vol. 13904, Springer Nature, 2023, pp. 453–65, doi: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, Sayan, et al. “Deterministic Near-Optimal Approximation Algorithms for Dynamic Set Cover.” SIAM Journal on Computing, vol. 52, no. 5, Society for Industrial and Applied Mathematics, 2023, pp. 1132–92, doi:10.1137/21M1428649.
View
| DOI
| WoS
2023 | Published | Conference Paper | IST-REx-ID: 14768 |
Cohen-Addad, Vincent, et al. “Deterministic Clustering in High Dimensional Spaces: Sketches and Approximation.” 2023 IEEE 64th Annual Symposium on Foundations of Computer Science, IEEE, 2023, pp. 1105–30, doi:10.1109/focs57990.2023.00066.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv