Filakovský, M., Nakajima, T. V., Oprsal, J., Tasinato, G., &; Wagner, U. (2024). Hardness of linearly ordered 4-colouring of 3-colourable 3-uniform hypergraphs. In 41st International Symposium on Theoretical Aspects of Computer Science (Vol. 289). Clermont-Ferrand, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.STACS.2024.34 
LibreCat: https://research-explorer.ista.ac.at/record/15168
DOI: 10.4230/LIPIcs.STACS.2024.34
arXiv: 2312.12981

Henzinger, T. A., Kebis, P., Mazzocchi, N. A., &; Sarac, N. E. (2023). Regular methods for operator precedence languages. In 50th International Colloquium on Automata, Languages, and Programming (Vol. 261, p. 129:1--129:20). Paderborn, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.ICALP.2023.129 
LibreCat: https://research-explorer.ista.ac.at/record/13292
DOI: 10.4230/LIPIcs.ICALP.2023.129
arXiv: 2305.03447

Dvorak, M., &; Blanchette, J. (2023). Closure properties of general grammars - formally verified. In 14th International Conference on Interactive Theorem Proving (Vol. 268). Bialystok, Poland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.ITP.2023.15 
LibreCat: https://research-explorer.ista.ac.at/record/13120
DOI: 10.4230/LIPIcs.ITP.2023.15
arXiv: 2302.06420

Boker, U., Henzinger, T. A., Mazzocchi, N. A., &; Sarac, N. E. (2023). Safety and liveness of quantitative automata. In 34th International Conference on Concurrency Theory (Vol. 279). Antwerp, Belgium: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.CONCUR.2023.17 
LibreCat: https://research-explorer.ista.ac.at/record/13221
DOI: 10.4230/LIPIcs.CONCUR.2023.17
arXiv: 2307.06016

Baier, C., Chatterjee, K., Meggendorfer, T., &; Piribauer, J. (2023). Entropic risk for turn-based stochastic games. In 48th International Symposium on Mathematical Foundations of Computer Science (Vol. 272). Bordeaux, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.MFCS.2023.15 
LibreCat: https://research-explorer.ista.ac.at/record/14417
DOI: 10.4230/LIPIcs.MFCS.2023.15
arXiv: 2307.06611

Hanauer, K., Henzinger, M. H., &; Schulz, C. (2022). Recent advances in fully dynamic graph algorithms. 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.1 
LibreCat: https://research-explorer.ista.ac.at/record/11808
DOI: 10.4230/LIPIcs.SAND.2022.1
arXiv: 2102.11169

Pacut, M., Parham, M., Rybicki, J., Schmid, S., Suomela, J., &; Tereshchenko, A. (2022). Brief announcement: Temporal locality in online algorithms. In 36th International Symposium on Distributed Computing (Vol. 246). Augusta, GA, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.DISC.2022.52 
LibreCat: https://research-explorer.ista.ac.at/record/12182
DOI: 10.4230/LIPIcs.DISC.2022.52