Filakovský, Marek, Tamio Vesa Nakajima, Jakub Oprsal, Gianluca Tasinato, and Uli Wagner. “Hardness of Linearly Ordered 4-Colouring of 3-Colourable 3-Uniform Hypergraphs.”https://doi.org/10.4230/LIPIcs.STACS.2024.34__In 41st International Symposium on Theoretical Aspects of Computer Science, Vol. 289. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.https://doi.org/10.4230/LIPIcs.STACS.2024.34 .

Henzinger, Thomas A, Pavol Kebis, Nicolas Adrien Mazzocchi, and Naci E Sarac. “Regular Methods for Operator Precedence Languages.”https://doi.org/10.4230/LIPIcs.ICALP.2023.129__In 50th International Colloquium on Automata, Languages, and Programming, 261:129:1--129:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.https://doi.org/10.4230/LIPIcs.ICALP.2023.129 .

Dvorak, Martin, and Jasmin Blanchette. “Closure Properties of General Grammars - Formally Verified.”https://doi.org/10.4230/LIPIcs.ITP.2023.15__In 14th International Conference on Interactive Theorem Proving, Vol. 268. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.https://doi.org/10.4230/LIPIcs.ITP.2023.15 .

Boker, Udi, Thomas A Henzinger, Nicolas Adrien Mazzocchi, and Naci E Sarac. “Safety and Liveness of Quantitative Automata.”https://doi.org/10.4230/LIPIcs.CONCUR.2023.17__In 34th International Conference on Concurrency Theory, Vol. 279. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.https://doi.org/10.4230/LIPIcs.CONCUR.2023.17 .

Baier, Christel, Krishnendu Chatterjee, Tobias Meggendorfer, and Jakob Piribauer. “Entropic Risk for Turn-Based Stochastic Games.”https://doi.org/10.4230/LIPIcs.MFCS.2023.15__In 48th International Symposium on Mathematical Foundations of Computer Science, Vol. 272. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.https://doi.org/10.4230/LIPIcs.MFCS.2023.15 .

Hanauer, Kathrin, Monika H Henzinger, and Christian Schulz. “Recent Advances in Fully Dynamic Graph Algorithms.”https://doi.org/10.4230/LIPIcs.SAND.2022.1__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.1 .

Pacut, Maciej, Mahmoud Parham, Joel Rybicki, Stefan Schmid, Jukka Suomela, and Aleksandr Tereshchenko. “Brief Announcement: Temporal Locality in Online Algorithms.”https://doi.org/10.4230/LIPIcs.DISC.2022.52__In 36th International Symposium on Distributed Computing, Vol. 246. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.https://doi.org/10.4230/LIPIcs.DISC.2022.52 .