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 .