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.

107 Publications


2017 | Published | Conference Paper | IST-REx-ID: 1175 | OA
Alwen, Joel F, Susanna De Rezende, Jakob Nordstrom, and Marc Vinyals. “Cumulative Space in Black-White Pebbling and Resolution.” edited by Christos Papadimitriou, 67:38:1-38-21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. https://doi.org/10.4230/LIPIcs.ITCS.2017.38.
[Published Version] View | Files available | DOI | WoS
 

2016 | Published | Conference Paper | IST-REx-ID: 11834 | OA
Goranci, Gramoz, Monika Henzinger, and Mikkel Thorup. “Incremental Exact Min-Cut in Poly-Logarithmic Amortized Update Time.” In 24th Annual European Symposium on Algorithms, Vol. 57. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016. https://doi.org/10.4230/LIPICS.ESA.2016.46.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 

2016 | Published | Conference Paper | IST-REx-ID: 11835 | OA
Henzinger, Monika, and Stefan Neumann. “Incremental and Fully Dynamic Subgraph Connectivity for Emergency Planning.” In 24th Annual European Symposium on Algorithms, Vol. 57. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016. https://doi.org/10.4230/LIPICS.ESA.2016.48.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 

2016 | Published | Conference Paper | IST-REx-ID: 11836 | OA
Cheung, Yun Kuen, Gramoz Goranci, and Monika Henzinger. “Graph Minors for Preserving Terminal Distances Approximately - Lower and Upper Bounds.” In 43rd International Colloquium on Automata, Languages, and Programming, Vol. 55. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016. https://doi.org/10.4230/LIPICS.ICALP.2016.131.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 

2015 | Published | Conference Paper | IST-REx-ID: 11837 | OA
Bhattacharya, Sayan, Wolfgang Dvorák, Monika Henzinger, and Martin Starnberger. “Welfare Maximization with Friends-of-Friends Network Externalities.” In 32nd International Symposium on Theoretical Aspects of Computer Science, 30:90–102. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015. https://doi.org/10.4230/LIPICS.STACS.2015.90.
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 

2010 | Published | Conference Paper | IST-REx-ID: 11838 | OA
Dütting, Paul, Monika Henzinger, and Ingmar Weber. “Sponsored Search, Market Equilibria, and the Hungarian Method.” In 27th International Symposium on Theoretical Aspects of Computer Science, 5:287–98. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010. https://doi.org/10.4230/LIPICS.STACS.2010.2463.
[Published Version] View | Files available | DOI | Download Published Version (ext.) | arXiv
 

2009 | Published | Conference Paper | IST-REx-ID: 11912 | OA
Baykan, Eda, Monika Henzinger, Stefan F. Keller, Sebastian de Castelberg, and Markus Kinzler. “A Comparison of Techniques for Sampling Web Pages.” In 26th International Symposium on Theoretical Aspects of Computer Science, 3:13–30. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2009. https://doi.org/10.4230/LIPICS.STACS.2009.1809.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 

Filters and Search Terms

issn=1868-8969

Search

Filter Publications

Display / Sort

Citation Style: Chicago

Export / Embed