Chambers, Erin, et al. “A Cautionary Tale: Burning the Medial Axis Is Unstable.”10.4230/LIPIcs.SoCG.2022.66__38th International Symposium on Computational Geometry, edited by Xavier Goaoc and Michael Kerber, vol. 224, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p. 66:1-66:9, doi:10.4230/LIPIcs.SoCG.2022.66.
LibreCat: https://research-explorer.ista.ac.at/record/11428
DOI: 10.4230/LIPIcs.SoCG.2022.66

Hanauer, Kathrin, et al. “Fully Dynamic Four-Vertex Subgraph Counting.”10.4230/LIPIcs.SAND.2022.18__1st Symposium on Algorithmic Foundations of Dynamic Networks, vol. 221, 18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, doi:10.4230/LIPIcs.SAND.2022.18.
LibreCat: https://research-explorer.ista.ac.at/record/11812
DOI: 10.4230/LIPIcs.SAND.2022.18
arXiv: 2106.15524

Ahmadi, Ali, et al. “Algorithms and Hardness Results for Computing Cores of Markov Chains.”10.4230/LIPIcs.FSTTCS.2022.29__42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, vol. 250, 29, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, doi:10.4230/LIPIcs.FSTTCS.2022.29.
LibreCat: https://research-explorer.ista.ac.at/record/12102
DOI: 10.4230/LIPIcs.FSTTCS.2022.29

Chatterjee, Krishnendu, et al. “Complexity of Spatial Games.”10.4230/LIPIcs.FSTTCS.2022.11__42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, vol. 250, 11:1-11:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, doi:10.4230/LIPIcs.FSTTCS.2022.11.
LibreCat: https://research-explorer.ista.ac.at/record/12101
DOI: 10.4230/LIPIcs.FSTTCS.2022.11

Henzinger, Thomas A., et al. “History-Deterministic Timed Automata.”10.4230/LIPIcs.CONCUR.2022.14__33rd International Conference on Concurrency Theory, vol. 243, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p. 14:1-14:21, doi:10.4230/LIPIcs.CONCUR.2022.14.
LibreCat: https://research-explorer.ista.ac.at/record/12508
DOI: 10.4230/LIPIcs.CONCUR.2022.14

Avni, Guy, and Thomas A. Henzinger. “An Updated Survey of Bidding Games on Graphs.”10.4230/LIPIcs.MFCS.2022.3__47th International Symposium on Mathematical Foundations of Computer Science, vol. 241, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p. 3:1-3:6, doi:10.4230/LIPIcs.MFCS.2022.3.
LibreCat: https://research-explorer.ista.ac.at/record/12509
DOI: 10.4230/LIPIcs.MFCS.2022.3

Grover, Kush, et al. “Anytime Guarantees for Reachability in Uncountable Markov Decision Processes.”10.4230/LIPIcs.CONCUR.2022.11__33rd International Conference on Concurrency Theory , vol. 243, 11, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, doi:10.4230/LIPIcs.CONCUR.2022.11.
LibreCat: https://research-explorer.ista.ac.at/record/12775
DOI: 10.4230/LIPIcs.CONCUR.2022.11
arXiv: 2008.04824

Jecker, Ismael R., et al. “Decomposing Permutation Automata.”10.4230/LIPIcs.CONCUR.2021.18__32nd International Conference on Concurrency Theory, vol. 203, 18, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.CONCUR.2021.18.
LibreCat: https://research-explorer.ista.ac.at/record/10052
DOI: 10.4230/LIPIcs.CONCUR.2021.18
arXiv: 2107.04683

Chatterjee, Krishnendu, et al. “Faster Algorithms for Bounded Liveness in Graphs and Game Graphs.”10.4230/LIPIcs.ICALP.2021.124__48th International Colloquium on Automata, Languages, and Programming, vol. 198, 124, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.ICALP.2021.124.
LibreCat: https://research-explorer.ista.ac.at/record/10054
DOI: 10.4230/LIPIcs.ICALP.2021.124

Harris, David G., et al. “A New Notion of Commutativity for the Algorithmic Lovász Local Lemma.”10.4230/LIPIcs.APPROX/RANDOM.2021.31__Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, vol. 207, 31, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.APPROX/RANDOM.2021.31.
LibreCat: https://research-explorer.ista.ac.at/record/10072
DOI: 10.4230/LIPIcs.APPROX/RANDOM.2021.31
arXiv: 2008.05569

Guha, Shibashis, et al. “A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct.”10.4230/LIPIcs.MFCS.2021.53__46th International Symposium on Mathematical Foundations of Computer Science, vol. 202, 53, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.MFCS.2021.53.
LibreCat: https://research-explorer.ista.ac.at/record/10075
DOI: 10.4230/LIPIcs.MFCS.2021.53
arXiv: 2105.02611

Alistarh, Dan-Adrian, et al. “Brief Announcement: Fast Graphical Population Protocols.”10.4230/LIPIcs.DISC.2021.43__35th International Symposium on Distributed Computing, vol. 209, 43, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.DISC.2021.43.
LibreCat: https://research-explorer.ista.ac.at/record/10218
DOI: 10.4230/LIPIcs.DISC.2021.43
arXiv: 2102.08808

Alistarh, Dan-Adrian, et al. “Lower Bounds for Shared-Memory Leader Election under Bounded Write Contention.”10.4230/LIPIcs.DISC.2021.4__35th International Symposium on Distributed Computing, vol. 209, 4, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.DISC.2021.4.
LibreCat: https://research-explorer.ista.ac.at/record/10217
DOI: 10.4230/LIPIcs.DISC.2021.4

Chatterjee, Bapi, et al. “Brief Announcement: Non-Blocking Dynamic Unbounded Graphs with Worst-Case Amortized Bounds.”10.4230/LIPIcs.DISC.2021.52__35th International Symposium on Distributed Computing, vol. 209, 52, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.DISC.2021.52.
LibreCat: https://research-explorer.ista.ac.at/record/10216
DOI: 10.4230/LIPIcs.DISC.2021.52
arXiv: 2003.01697

Korhonen, Janne, et al. “Brief Announcement: Sinkless Orientation Is Hard Also in the Supported LOCAL Model.”10.4230/LIPIcs.DISC.2021.58__35th International Symposium on Distributed Computing, vol. 209, 58, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.DISC.2021.58.
LibreCat: https://research-explorer.ista.ac.at/record/10219
DOI: 10.4230/LIPIcs.DISC.2021.58
arXiv: 2108.02655

Arrighi, Emmanuel, et al. “On the Complexity of Intersection Non-Emptiness for Star-Free Language Classes.”10.4230/LIPIcs.FSTTCS.2021.34__41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, vol. 213, 34, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.FSTTCS.2021.34.
LibreCat: https://research-explorer.ista.ac.at/record/10630
DOI: 10.4230/LIPIcs.FSTTCS.2021.34
arXiv: 2110.01279

Chatterjee, Krishnendu, et al. “Quantitative Verification on Product Graphs of Small Treewidth.”10.4230/LIPIcs.FSTTCS.2021.42__41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, vol. 213, 42, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.FSTTCS.2021.42.
LibreCat: https://research-explorer.ista.ac.at/record/10629
DOI: 10.4230/LIPIcs.FSTTCS.2021.42

Fichtenberger, Hendrik, et al. “Differentially Private Algorithms for Graphs under Continual Observation.”10.4230/LIPIcs.ESA.2021.42__29th Annual European Symposium on Algorithms, vol. 204, 42, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.ESA.2021.42.
LibreCat: https://research-explorer.ista.ac.at/record/11814
DOI: 10.4230/LIPIcs.ESA.2021.42
arXiv: 2106.14756

Edelsbrunner, Herbert, et al. “The Density Fingerprint of a Periodic Point Set.”10.4230/LIPIcs.SoCG.2021.32__37th International Symposium on Computational Geometry (SoCG 2021), vol. 189, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, p. 32:1-32:16, doi:10.4230/LIPIcs.SoCG.2021.32.
LibreCat: https://research-explorer.ista.ac.at/record/9345
DOI: 10.4230/LIPIcs.SoCG.2021.32

Jecker, Ismael R. “A Ramsey Theorem for Finite Monoids.”10.4230/LIPIcs.STACS.2021.44__38th International Symposium on Theoretical Aspects of Computer Science, vol. 187, 44, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.STACS.2021.44.
LibreCat: https://research-explorer.ista.ac.at/record/10055
DOI: 10.4230/LIPIcs.STACS.2021.44
WoS: 000635691700044