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.

8 Publications


2026 | Epub ahead of print | Journal Article | IST-REx-ID: 22812
Hahn, Niklas, Monika Henzinger, and Zofia Stefankovic. “Tight Bounds on the Performance of Dynamic Directed Cutset Data Structures Based on OMv.” Information Processing Letters. Elsevier, 2026. https://doi.org/10.1016/j.ipl.2026.106663.
View | DOI
 

2024 | Published | Thesis | PhD | IST-REx-ID: 17208 | OA
Medina Ramos, Raimel A. “Exploring the Optimization Landscape of Variational Quantum Algorithms.” Institute of Science and Technology Austria, 2024. https://doi.org/10.15479/at:ista:17208.
[Published Version] View | Files available | DOI
 

2023 | Published | Conference Paper | IST-REx-ID: 22373 | OA
El-Hayek, Antoine, Monika Henzinger, and Stefan Schmid. “Asymptotically Tight Bounds on the Time Complexity of Broadcast and Its Variants in Dynamic Networks.” In 14th Innovations in Theoretical Computer Science Conference, edited by Yael Tauman Kalai, Vol. 251. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. https://doi.org/10.4230/LIPICS.ITCS.2023.47.
[Published Version] View | Files available | DOI | arXiv
 

earlier version | 2021 | Published | Conference Paper | IST-REx-ID: 10004 | OA
Chatterjee, Krishnendu, and Laurent Doyen. “Stochastic Processes with Expected Stopping Time.” In Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, 1–13. IEEE, 2021. https://doi.org/10.1109/LICS52264.2021.9470595.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 

2020 | Published | Journal Article | IST-REx-ID: 11675 | OA
Bhattacharya, Sayan, Deeparnab Chakrabarty, and Monika Henzinger. “Deterministic Dynamic Matching in O(1) Update Time.” Algorithmica. Springer Nature, 2020. https://doi.org/10.1007/s00453-019-00630-4.
[Published Version] View | DOI | Download Published Version (ext.)
 

2017 | Published | Journal Article | IST-REx-ID: 11676 | OA
Dvořák, Wolfgang, Monika Henzinger, and David P. Williamson. “Maximizing a Submodular Function with Viability Constraints.” Algorithmica. Springer Nature, 2017. https://doi.org/10.1007/s00453-015-0066-y.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2015 | Published | Journal Article | IST-REx-ID: 11668 | OA
Colini-Baldeschi, Riccardo, Stefano Leonardi, Monika Henzinger, and Martin Starnberger. “On Multiple Keyword Sponsored Search Auctions with Budgets.” ACM Transactions on Economics and Computation. Association for Computing Machinery, 2015. https://doi.org/10.1145/2818357.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 

1999 | Published | Journal Article | IST-REx-ID: 11679
Henzinger, Monika, V. King, and T. Warnow. “Constructing a Tree from Homeomorphic Subtrees, with Applications to Computational Evolutionary Biology.” Algorithmica. Springer Nature, 1999. https://doi.org/10.1007/pl00009268.
View | Files available | DOI
 

Filters and Search Terms

keyword="Algorithms"

Search

Filter Publications

Display / Sort

Citation Style: Chicago

Export / Embed