Avni, G., Jecker, I. R., &; Zikelic, D. (2023). Bidding graph games with partially-observable budgets. In Proceedings of the 37th AAAI Conference on Artificial Intelligence (Vol. 37, pp. 5464–5471). Washington, DC, United States.https://doi.org/10.1609/aaai.v37i5.25679 
LibreCat: https://research-explorer.ista.ac.at/record/14243
DOI: 10.1609/aaai.v37i5.25679
arXiv: 2211.13626

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 
LibreCat: https://research-explorer.ista.ac.at/record/12101
DOI: 10.4230/LIPIcs.FSTTCS.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 
LibreCat: https://research-explorer.ista.ac.at/record/10052
DOI: 10.4230/LIPIcs.CONCUR.2021.18
arXiv: 2107.04683

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 
LibreCat: https://research-explorer.ista.ac.at/record/10075
DOI: 10.4230/LIPIcs.MFCS.2021.53
arXiv: 2105.02611

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 
LibreCat: https://research-explorer.ista.ac.at/record/10630
DOI: 10.4230/LIPIcs.FSTTCS.2021.34
arXiv: 2110.01279

Avni, G., Jecker, I. R., &; Zikelic, D. (2021). Infinite-duration all-pay bidding games. In D. Marx (Ed.), Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (pp. 617–636). Virtual: Society for Industrial and Applied Mathematics.https://doi.org/10.1137/1.9781611976465.38 
LibreCat: https://research-explorer.ista.ac.at/record/10694
DOI: 10.1137/1.9781611976465.38
arXiv: 2005.06636

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 
LibreCat: https://research-explorer.ista.ac.at/record/10055
DOI: 10.4230/LIPIcs.STACS.2021.44
WoS: 000635691700044

Chatterjee, K., Ibsen-Jensen, R., Jecker, I. R., &; Svoboda, J. (2020). Simplified game of life: Algorithms and complexity. In 45th International Symposium on Mathematical Foundations of Computer Science (Vol. 170). Prague, Czech Republic: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.MFCS.2020.22 
LibreCat: https://research-explorer.ista.ac.at/record/8533
DOI: 10.4230/LIPIcs.MFCS.2020.22
arXiv: 2007.02894

Jecker, I. R., Kupferman, O., &; Mazzocchi, N. (2020). Unary prime languages. In 45th International Symposium on Mathematical Foundations of Computer Science (Vol. 170). Prague, Czech Republic: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.MFCS.2020.51 
LibreCat: https://research-explorer.ista.ac.at/record/8534
DOI: 10.4230/LIPIcs.MFCS.2020.51