Chambers, E., Fillmore, C. D., Stephenson, E. R., &; Wintraecken, M. (2022). A cautionary tale: Burning the medial axis is unstable. In X. Goaoc &; M. Kerber (Eds.), 38th International Symposium on Computational Geometry (Vol. 224, p. 66:1-66:9). Berlin, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.SoCG.2022.66 

Hanauer, K., Henzinger, M. H., &; Hua, Q. C. (2022). Fully dynamic four-vertex subgraph counting. In 1st Symposium on Algorithmic Foundations of Dynamic Networks (Vol. 221). Virtual: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.SAND.2022.18 

Ahmadi, A., Chatterjee, K., Goharshady, A. K., Meggendorfer, T., Safavi Hemami, R., &; Zikelic, D. (2022). Algorithms and hardness results for computing cores of Markov chains. In 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (Vol. 250). Madras, India: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.FSTTCS.2022.29 

Chatterjee, K., Ibsen-Jensen, R., Jecker, I. R., &; Svoboda, J. (2022). Complexity of spatial games. In 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (Vol. 250). Madras, India: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.FSTTCS.2022.11 

Henzinger, T. A., Lehtinen, K., &; Totzke, P. (2022). History-deterministic timed automata. In 33rd International Conference on Concurrency Theory (Vol. 243, p. 14:1-14:21). Warsaw, Poland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.CONCUR.2022.14 

Avni, G., &; Henzinger, T. A. (2022). An updated survey of bidding games on graphs. In 47th International Symposium on Mathematical Foundations of Computer Science (Vol. 241, p. 3:1-3:6). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.MFCS.2022.3 

Grover, K., Kretinsky, J., Meggendorfer, T., &; Weininger, M. (2022). Anytime guarantees for reachability in uncountable Markov decision processes. In 33rd International Conference on Concurrency Theory  (Vol. 243). Warsaw, Poland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.CONCUR.2022.11 

Jecker, I. R., Mazzocchi, N., &; Wolf, P. (2021). Decomposing permutation automata. In 32nd International Conference on Concurrency Theory (Vol. 203). Paris, France: Schloss Dagstuhl - Leibniz Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.CONCUR.2021.18 

Chatterjee, K., Henzinger, M. H., Kale, S. S., &; Svozil, A. (2021). Faster algorithms for bounded liveness in graphs and game graphs. In 48th International Colloquium on Automata, Languages, and Programming (Vol. 198). Glasgow, Scotland: Schloss Dagstuhl - Leibniz Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.ICALP.2021.124 

Harris, D. G., Iliopoulos, F., &; Kolmogorov, V. (2021). A new notion of commutativity for the algorithmic Lovász Local Lemma. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Vol. 207). Virtual: Schloss Dagstuhl - Leibniz Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.31 

Guha, S., Jecker, I. R., Lehtinen, K., &; Zimmermann, M. (2021). A bit of nondeterminism makes pushdown automata expressive and succinct. In 46th International Symposium on Mathematical Foundations of Computer Science (Vol. 202). Tallinn, Estonia: Schloss Dagstuhl - Leibniz Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.MFCS.2021.53 

Alistarh, D.-A., Gelashvili, R., &; Rybicki, J. (2021). Brief announcement: Fast graphical population protocols. In 35th International Symposium on Distributed Computing (Vol. 209). Freiburg, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.DISC.2021.43 

Alistarh, D.-A., Gelashvili, R., &; Nadiradze, G. (2021). Lower bounds for shared-memory leader election under bounded write contention. In 35th International Symposium on Distributed Computing (Vol. 209). Freiburg, Germany: Schloss Dagstuhl - Leibniz Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.DISC.2021.4 

Chatterjee, B., Peri, S., &; Sa, M. (2021). Brief announcement: Non-blocking dynamic unbounded graphs with worst-case amortized bounds. In 35th International Symposium on Distributed Computing (Vol. 209). Freiburg, Germany: Schloss Dagstuhl - Leibniz Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.DISC.2021.52 

Korhonen, J., Paz, A., Rybicki, J., Schmid, S., &; Suomela, J. (2021). Brief announcement: Sinkless orientation is hard also in the supported LOCAL model. In 35th International Symposium on Distributed Computing (Vol. 209). Freiburg, Germany: Schloss Dagstuhl - Leibniz Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.DISC.2021.58 

Arrighi, E., Fernau, H., Hoffmann, S., Holzer, M., Jecker, I. R., De Oliveira Oliveira, M., &; Wolf, P. (2021). On the complexity of intersection non-emptiness for star-free language classes. In 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (Vol. 213). Virtual: Schloss Dagstuhl - Leibniz Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.FSTTCS.2021.34 

Chatterjee, K., Ibsen-Jensen, R., &; Pavlogiannis, A. (2021). Quantitative verification on product graphs of small treewidth. In 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (Vol. 213). Virtual: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.FSTTCS.2021.42 

Fichtenberger, H., Henzinger, M. H., &; Ost, W. (2021). Differentially private algorithms for graphs under continual observation. In 29th Annual European Symposium on Algorithms (Vol. 204). Lisbon, Portual: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.ESA.2021.42 

Edelsbrunner, H., Heiss, T.,https://doi.org/10.4230/LIPIcs.SoCG.2021.32__Kurlin , V., Smith, P., &; Wintraecken, M. (2021). The density fingerprint of a periodic point set. In 37th International Symposium on Computational Geometry (SoCG 2021) (Vol. 189, p. 32:1-32:16). Virtual: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.SoCG.2021.32 

Jecker, I. R. (2021). A Ramsey theorem for finite monoids. In 38th International Symposium on Theoretical Aspects of Computer Science (Vol. 187). Saarbrücken, Germany: Schloss Dagstuhl - Leibniz Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.STACS.2021.44