Avni, Guy, Shibashis Guha, and Orna Kupferman. “Timed Network Games with Clocks,”https://doi.org/10.4230/LIPICS.MFCS.2018.23__Vol. 117. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.https://doi.org/10.4230/LIPICS.MFCS.2018.23 .

Henzinger, Monika H, Andrea Lincoln, Stefan Neumann, and Virginia Vassilevska Williams. “Conditional Hardness for Sensitivity Problems.”https://doi.org/10.4230/LIPICS.ITCS.2017.26__In 8th Innovations in Theoretical Computer Science Conference, Vol. 67. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.https://doi.org/10.4230/LIPICS.ITCS.2017.26 .

Goranci, Gramoz, Monika H Henzinger, and Pan Peng. “The Power of Vertex Sparsifiers in Dynamic Graph Algorithms.”https://doi.org/10.4230/LIPICS.ESA.2017.45__In 25th Annual European Symposium on Algorithms, Vol. 87. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.https://doi.org/10.4230/LIPICS.ESA.2017.45 .

Henzinger, Monika H, Dariusz Leniowski, and Claire Mathieu. “Dynamic Clustering to Minimize the Sum of Radii.”https://doi.org/10.4230/LIPICS.ESA.2017.48__In 25th Annual European Symposium on Algorithms, Vol. 87. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.https://doi.org/10.4230/LIPICS.ESA.2017.48 .

Goranci, Gramoz, Monika H Henzinger, and Pan Peng. “Improved Guarantees for Vertex Sparsification in Planar Graphs.”https://doi.org/10.4230/LIPICS.ESA.2017.44__In 25th Annual European Symposium on Algorithms, Vol. 87. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.https://doi.org/10.4230/LIPICS.ESA.2017.44 .

Avni, Guy, Thomas A Henzinger, and Ventsislav K Chonev. “Infinite-Duration Bidding Games,”https://doi.org/10.4230/LIPIcs.CONCUR.2017.21__Vol. 85. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.https://doi.org/10.4230/LIPIcs.CONCUR.2017.21 .

Cheung, Yun Kuen, Gramoz Goranci, and Monika H Henzinger. “Graph Minors for Preserving Terminal Distances Approximately - Lower and Upper Bounds.”https://doi.org/10.4230/LIPICS.ICALP.2016.131__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 .

Goranci, Gramoz, Monika H Henzinger, and Mikkel Thorup. “Incremental Exact Min-Cut in Poly-Logarithmic Amortized Update Time.”https://doi.org/10.4230/LIPICS.ESA.2016.46__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 .

Henzinger, Monika H, and Stefan Neumann. “Incremental and Fully Dynamic Subgraph Connectivity for Emergency Planning.”https://doi.org/10.4230/LIPICS.ESA.2016.48__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 .

Bhattacharya, Sayan, Wolfgang Dvorák, Monika H Henzinger, andhttps://doi.org/10.4230/LIPICS.STACS.2015.90__Martin Starnberger. “Welfare Maximization with Friends-of-Friends Network Externalities.”https://doi.org/10.4230/LIPICS.STACS.2015.90__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 .

Dütting, Paul, Monika H Henzinger, and Ingmar Weber. “Sponsored Search, Market Equilibria, and the Hungarian Method.”https://doi.org/10.4230/LIPICS.STACS.2010.2463__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 .

Baykan,https://doi.org/10.4230/LIPICS.STACS.2009.1809__Eda, Monika H Henzinger, Stefan F. Keller, Sebastian de Castelberg, and Markus Kinzler. “A Comparison of Techniques for Sampling Web Pages.”https://doi.org/10.4230/LIPICS.STACS.2009.1809__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 .