Goranci, Gramoz, Monika H Henzinger, Harald Räcke, Sushant Sachdeva, and A. R. Sricharan. “Electrical Flows for Polylogarithmic Competitive Oblivious Routing.”https://doi.org/10.4230/LIPIcs.ITCS.2024.55__In 15th Innovations in Theoretical Computer Science Conference, Vol. 287. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.https://doi.org/10.4230/LIPIcs.ITCS.2024.55 .

Alpos, Orestis, Ignacio Amores-Sesar, Christian Cachin, and Michelle X Yeo. “Eating Sandwiches: Modular and Lightweight Elimination of Transaction Reordering Attacks.”https://doi.org/10.4230/LIPIcs.OPODIS.2023.12__In 27th International Conference on Principles of Distributed Systems, Vol. 286. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.https://doi.org/10.4230/LIPIcs.OPODIS.2023.12 .

Henzinger, Monika H, Stefan Neumann, Harald Räcke, and Stefan Schmid. “Dynamic Maintenance of Monotone Dynamic Programs and Applications.”https://doi.org/10.4230/LIPIcs.STACS.2023.36__In 40th International Symposium on Theoretical Aspects of Computer Science, Vol. 254. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.https://doi.org/10.4230/LIPIcs.STACS.2023.36 .

Goranci, Gramoz, and Monika H Henzinger. “Efficient Data Structures for Incremental Exact and Approximate Maximum Flow.”https://doi.org/10.4230/LIPIcs.ICALP.2023.69__In 50th International Colloquium on Automata, Languages, and Programming, Vol. 261. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.https://doi.org/10.4230/LIPIcs.ICALP.2023.69 .

Harris, David G., and Vladimir Kolmogorov. “Parameter Estimation for Gibbs Distributions.”https://doi.org/10.4230/LIPIcs.ICALP.2023.72__In 50th International Colloquium on Automata, Languages, and Programming, Vol. 261. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.https://doi.org/10.4230/LIPIcs.ICALP.2023.72 .

Resch, Nicolas, Chen Yuan, and Yihan Zhang. “Zero-Rate Thresholds and New Capacity Bounds for List-Decoding and List-Recovery.”https://doi.org/10.4230/LIPIcs.ICALP.2023.99__In 50th International Colloquium on Automata, Languages, and Programming, Vol. 261. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.https://doi.org/10.4230/LIPIcs.ICALP.2023.99 .

Aksenov, Vitaly, Michael Anoprenko, Alexander Fedorov, and Michael Spear. “Brief Announcement: BatchBoost: Universal Batching for Concurrent Data Structures.”https://doi.org/10.4230/LIPIcs.DISC.2023.35__In 37th International Symposium on Distributed Computing, Vol. 281. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.https://doi.org/10.4230/LIPIcs.DISC.2023.35 .

Beaver, Donald, Mahimna Kelkar, Kevin Lewi, Valeria Nikolaenko, Alberto Sonnino, Konstantinos Chalkias, Eleftherios Kokoris Kogias, Ladi De Naurois, and Arnab Roy. “STROBE: Streaming Threshold Random Beacons.”https://doi.org/10.4230/LIPIcs.AFT.2023.7__In 5th Conference on Advances in Financial Technologies, Vol. 282. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.https://doi.org/10.4230/LIPIcs.AFT.2023.7 .

Alistarh, Dan-Adrian, Rati Gelashvili, and Joel Rybicki. “Fast Graphical Population Protocols.”https://doi.org/10.4230/LIPIcs.OPODIS.2021.14__In 25th International Conference on Principles of Distributed Systems, edited by Quentin Bramas, Vincent Gramoli, and Alessia Milani, Vol. 217. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.https://doi.org/10.4230/LIPIcs.OPODIS.2021.14 .

Nikabadi, Amir, and Janne Korhonen. “Beyond Distributed Subgraph Detection: Induced Subgraphs, Multicolored Problems and Graph Parameters.”https://doi.org/10.4230/LIPIcs.OPODIS.2021.15__In 25th International Conference on Principles of Distributed Systems, edited by Quentin Bramas, Vincent Gramoli, and Alessia Milani, Vol. 217. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.https://doi.org/10.4230/LIPIcs.OPODIS.2021.15 .

Chambers, Erin, Christopher D Fillmore, Elizabeth R Stephenson, and Mathijs Wintraecken. “A Cautionary Tale: Burning the Medial Axis Is Unstable.”https://doi.org/10.4230/LIPIcs.SoCG.2022.66__In 38th International Symposium on Computational Geometry, edited by Xavier Goaoc and Michael Kerber, 224:66:1-66:9. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.https://doi.org/10.4230/LIPIcs.SoCG.2022.66 .

Hanauer, Kathrin, Monika H Henzinger, and Qi Cheng Hua. “Fully Dynamic Four-Vertex Subgraph Counting.”https://doi.org/10.4230/LIPIcs.SAND.2022.18__In 1st Symposium on Algorithmic Foundations of Dynamic Networks, Vol. 221. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.https://doi.org/10.4230/LIPIcs.SAND.2022.18 .

Ahmadi, Ali, Krishnendu Chatterjee, Amir Kafshdar Goharshady, Tobias Meggendorfer, Roodabeh Safavi Hemami, and Dorde Zikelic. “Algorithms and Hardness Results for Computing Cores of Markov Chains.”https://doi.org/10.4230/LIPIcs.FSTTCS.2022.29__In 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Vol. 250. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.https://doi.org/10.4230/LIPIcs.FSTTCS.2022.29 .

Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, Ismael R Jecker, and Jakub Svoboda. “Complexity of Spatial Games.”https://doi.org/10.4230/LIPIcs.FSTTCS.2022.11__In 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Vol. 250. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.https://doi.org/10.4230/LIPIcs.FSTTCS.2022.11 .

Henzinger, Thomas A, Karoliina Lehtinen, and Patrick Totzke. “History-Deterministic Timed Automata.”https://doi.org/10.4230/LIPIcs.CONCUR.2022.14__In 33rd International Conference on Concurrency Theory, 243:14:1-14:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.https://doi.org/10.4230/LIPIcs.CONCUR.2022.14 .

Avni, Guy, and Thomas A Henzinger. “An Updated Survey of Bidding Games on Graphs.”https://doi.org/10.4230/LIPIcs.MFCS.2022.3__In 47th International Symposium on Mathematical Foundations of Computer Science, 241:3:1-3:6. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.https://doi.org/10.4230/LIPIcs.MFCS.2022.3 .

Grover, Kush, Jan Kretinsky, Tobias Meggendorfer, and Maimilian Weininger. “Anytime Guarantees for Reachability in Uncountable Markov Decision Processes.”https://doi.org/10.4230/LIPIcs.CONCUR.2022.11__In 33rd International Conference on Concurrency Theory , Vol. 243. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.https://doi.org/10.4230/LIPIcs.CONCUR.2022.11 .

Jecker, Ismael R, Nicolas Mazzocchi, and Petra Wolf. “Decomposing Permutation Automata.”https://doi.org/10.4230/LIPIcs.CONCUR.2021.18__In 32nd International Conference on Concurrency Theory, Vol. 203. Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021.https://doi.org/10.4230/LIPIcs.CONCUR.2021.18 .

Chatterjee, Krishnendu, Monika H Henzinger, Sagar Sudhir Kale, and Alexander Svozil. “Faster Algorithms for Bounded Liveness in Graphs and Game Graphs.”https://doi.org/10.4230/LIPIcs.ICALP.2021.124__In 48th International Colloquium on Automata, Languages, and Programming, Vol. 198. Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021.https://doi.org/10.4230/LIPIcs.ICALP.2021.124 .

Harris, David G., Fotis Iliopoulos, and Vladimir Kolmogorov. “A New Notion of Commutativity for the Algorithmic Lovász Local Lemma.”https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.31__In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, Vol. 207. Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021.https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.31 .

Guha, Shibashis, Ismael R Jecker, Karoliina Lehtinen, and Martin Zimmermann. “A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct.”https://doi.org/10.4230/LIPIcs.MFCS.2021.53__In 46th International Symposium on Mathematical Foundations of Computer Science, Vol. 202. Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021.https://doi.org/10.4230/LIPIcs.MFCS.2021.53 .

Alistarh, Dan-Adrian, Rati Gelashvili, and Joel Rybicki. “Brief Announcement: Fast Graphical Population Protocols.”https://doi.org/10.4230/LIPIcs.DISC.2021.43__In 35th International Symposium on Distributed Computing, Vol. 209. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.https://doi.org/10.4230/LIPIcs.DISC.2021.43 .

Alistarh, Dan-Adrian, Rati Gelashvili, and Giorgi Nadiradze. “Lower Bounds for Shared-Memory Leader Election under Bounded Write Contention.”https://doi.org/10.4230/LIPIcs.DISC.2021.4__In 35th International Symposium on Distributed Computing, Vol. 209. Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021.https://doi.org/10.4230/LIPIcs.DISC.2021.4 .

Chatterjee, Bapi, Sathya Peri, and Muktikanta Sa. “Brief Announcement: Non-Blocking Dynamic Unbounded Graphs with Worst-Case Amortized Bounds.”https://doi.org/10.4230/LIPIcs.DISC.2021.52__In 35th International Symposium on Distributed Computing, Vol. 209. Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021.https://doi.org/10.4230/LIPIcs.DISC.2021.52 .

Korhonen, Janne, Ami Paz, Joel Rybicki, Stefan Schmid, and Jukka Suomela. “Brief Announcement: Sinkless Orientation Is Hard Also in the Supported LOCAL Model.”https://doi.org/10.4230/LIPIcs.DISC.2021.58__In 35th International Symposium on Distributed Computing, Vol. 209. Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021.https://doi.org/10.4230/LIPIcs.DISC.2021.58 .

Arrighi, Emmanuel, Henning Fernau, Stefan Hoffmann, Markus Holzer, Ismael R Jecker, Mateus De Oliveira Oliveira, and Petra Wolf. “On the Complexity of Intersection Non-Emptiness for Star-Free Language Classes.”https://doi.org/10.4230/LIPIcs.FSTTCS.2021.34__In 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Vol. 213. Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021.https://doi.org/10.4230/LIPIcs.FSTTCS.2021.34 .

Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. “Quantitative Verification on Product Graphs of Small Treewidth.”https://doi.org/10.4230/LIPIcs.FSTTCS.2021.42__In 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Vol. 213. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.https://doi.org/10.4230/LIPIcs.FSTTCS.2021.42 .

Fichtenberger, Hendrik, Monika H Henzinger, and Wolfgang Ost. “Differentially Private Algorithms for Graphs under Continual Observation.”https://doi.org/10.4230/LIPIcs.ESA.2021.42__In 29th Annual European Symposium on Algorithms, Vol. 204. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.https://doi.org/10.4230/LIPIcs.ESA.2021.42 .

Edelsbrunner, Herbert, Teresa Heiss, Vitaliyhttps://doi.org/10.4230/LIPIcs.SoCG.2021.32__Kurlin , Philip Smith, and Mathijs Wintraecken. “The Density Fingerprint of a Periodic Point Set.”https://doi.org/10.4230/LIPIcs.SoCG.2021.32__In 37th International Symposium on Computational Geometry (SoCG 2021), 189:32:1-32:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.https://doi.org/10.4230/LIPIcs.SoCG.2021.32 .

Jecker, Ismael R. “A Ramsey Theorem for Finite Monoids.”https://doi.org/10.4230/LIPIcs.STACS.2021.44__In 38th International Symposium on Theoretical Aspects of Computer Science, Vol. 187. Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021.https://doi.org/10.4230/LIPIcs.STACS.2021.44 .

Boissonnat, Jean-Daniel, Siargey Kachanovich, and Mathijs Wintraecken. “Tracing Isomanifolds in Rd in Time Polynomial in d Using Coxeter-Freudenthal-Kuhn Triangulations.”https://doi.org/10.4230/LIPIcs.SoCG.2021.17__In 37th International Symposium on Computational Geometry (SoCG 2021), 189:17:1-17:16. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.https://doi.org/10.4230/LIPIcs.SoCG.2021.17 .

Henzinger, Monika H, and Sagar Kale. “Fully-Dynamic Coresets.”https://doi.org/10.4230/LIPIcs.ESA.2020.57__In 28th Annual European Symposium on Algorithms, Vol. 173. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.https://doi.org/10.4230/LIPIcs.ESA.2020.57 .

Henzinger, Monika H, Khan Shahbaz, Richard Paul, and Christian Schulz. “Dynamic Matching Algorithms in Practice.”https://doi.org/10.4230/LIPIcs.ESA.2020.58__In 8th Annual European Symposium on Algorithms, Vol. 173. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.https://doi.org/10.4230/LIPIcs.ESA.2020.58 .

Henzinger, Monika H, Stefan Neumann, and Andreas Wiese. “Dynamic Approximate Maximum Independent Set of Intervals, Hypercubes and Hyperrectangles.”https://doi.org/10.4230/LIPIcs.SoCG.2020.51__In 36th International Symposium on Computational Geometry, Vol. 164. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.https://doi.org/10.4230/LIPIcs.SoCG.2020.51 .

Hanauer, Kathrin, Monika H Henzinger, and Christian Schulz. “Faster Fully Dynamic Transitive Closure in Practice.”https://doi.org/10.4230/LIPIcs.SEA.2020.14__In 18th International Symposium on Experimental Algorithms, Vol. 160. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.https://doi.org/10.4230/LIPIcs.SEA.2020.14 .

Henzinger, Monika H, and Pan Peng. “Constant-Time Dynamic (+1)-Coloring.”https://doi.org/10.4230/LIPIcs.STACS.2020.53__In 37th International Symposium on Theoretical Aspects of Computer Science, Vol. 154. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.https://doi.org/10.4230/LIPIcs.STACS.2020.53 .

Henzinger, Monika H, Alexander Noe, Christian Schulz, and Darren Strash. “Finding All Global Minimum Cuts in Practice.”https://doi.org/10.4230/LIPIcs.ESA.2020.59__In 28th Annual European Symposium on Algorithms, Vol. 173. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.https://doi.org/10.4230/LIPIcs.ESA.2020.59 .

Ferrere, Thomas, Thomas A Henzinger, and Bernhard Kragl. “Monitoring Event Frequencies.”https://doi.org/10.4230/LIPIcs.CSL.2020.20__In 28th EACSL Annual Conference on Computer Science Logic, Vol. 152. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.https://doi.org/10.4230/LIPIcs.CSL.2020.20 .

Aksenov, Vitaly, Dan-Adrian Alistarh, Alexandra Drozdova, and Amirkeivan Mohtashami. “The Splay-List: A Distribution-Adaptive Concurrent Skip-List.”https://doi.org/10.4230/LIPIcs.DISC.2020.3__In 34th International Symposium on Distributed Computing, 179:3:1-3:18. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.https://doi.org/10.4230/LIPIcs.DISC.2020.3 .

Boissonnat, Jean-Daniel, and Mathijs Wintraecken. “The Topological Correctness of PL-Approximations of Isomanifolds.”https://doi.org/10.4230/LIPIcs.SoCG.2020.20__In 36th International Symposium on Computational Geometry, Vol. 164. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.https://doi.org/10.4230/LIPIcs.SoCG.2020.20 .

Ancona, Bertie, Monika H Henzinger, Liam Roditty, Virginia Vassilevska Williams, and Nicole Wein. “Algorithms and Hardness for Diameter in Dynamic Graphs.”https://doi.org/10.4230/LIPICS.ICALP.2019.13__In 46th International Colloquium on Automata, Languages, and Programming, Vol. 132. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.https://doi.org/10.4230/LIPICS.ICALP.2019.13 .

Pietrzak, Krzysztof Z. “Simple Verifiable Delay Functions.”https://doi.org/10.4230/LIPICS.ITCS.2019.60__In 10th Innovations in Theoretical Computer Science Conference, Vol. 124. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.https://doi.org/10.4230/LIPICS.ITCS.2019.60 .

Kolmogorov, Vladimir. “Testing the Complexity of a Valued CSP Language.”https://doi.org/10.4230/LIPICS.ICALP.2019.77__In 46th International Colloquium on Automata, Languages and Programming, 132:77:1-77:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.https://doi.org/10.4230/LIPICS.ICALP.2019.77 .

Fulek, Radoslav, and Jan Kyncl. “Z_2-Genus of Graphs and Minimum Rank of Partial Symmetric Matrices.”https://doi.org/10.4230/LIPICS.SOCG.2019.39__In 35th International Symposium on Computational Geometry (SoCG 2019), Vol. 129. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.https://doi.org/10.4230/LIPICS.SOCG.2019.39 .

Huszár, Kristóf, and Jonathan Spreer. “-Manifold Triangulations with Small Treewidth.”https://doi.org/10.4230/LIPIcs.SoCG.2019.44__In 35th International Symposium on Computational Geometry, 129:44:1-44:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.https://doi.org/10.4230/LIPIcs.SoCG.2019.44 .

Fulek, Radoslav, Bernd Gärtner, Andrey Kupavskii, Pavel Valtr, and Uli Wagner. “The Crossing Tverberg Theorem.”https://doi.org/10.4230/LIPICS.SOCG.2019.38__In 35th International Symposium on Computational Geometry, 129:38:1-38:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.https://doi.org/10.4230/LIPICS.SOCG.2019.38 .

Goranci, Gramoz, Monika H Henzinger, and Pan Peng. “Dynamic Effective Resistances and Approximate Schur Complement on Separable Graphs.”https://doi.org/10.4230/LIPICS.ESA.2018.40__In 26th Annual European Symposium on Algorithms, Vol. 112. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.https://doi.org/10.4230/LIPICS.ESA.2018.40 .

Goranci, Gramoz , Monika H Henzinger, and Dariusz Leniowski. “A Tree Structure for Dynamic Facility Location.”https://doi.org/10.4230/LIPICS.ESA.2018.39__In 26th Annual European Symposium on Algorithms, Vol. 112. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.https://doi.org/10.4230/LIPICS.ESA.2018.39 .

Biedermann, Sonja, Monika H Henzinger, Christian Schulz, and Bernhard Schuster. “Memetic Graph Clustering.”https://doi.org/10.4230/LIPICS.SEA.2018.3__In 17th International Symposium on Experimental Algorithms, Vol. 103. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.https://doi.org/10.4230/LIPICS.SEA.2018.3 .

Pietrzak, Krzysztof Z. “Proofs of Catalytic Space.”https://doi.org/10.4230/LIPICS.ITCS.2019.59__In 10th Innovations in Theoretical Computer Science  Conference (ITCS 2019), 124:59:1-59:25. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.https://doi.org/10.4230/LIPICS.ITCS.2019.59 .

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 .