DOI,IST REx ID,Research Group,Title of publication
10.1609/aaai.v37i5.25679,14243,"ToHe,KrCh",Bidding graph games with partially-observable budgets
10.4230/LIPIcs.FSTTCS.2022.11,12101,KrCh,Complexity of spatial games
10.4230/LIPIcs.CONCUR.2021.18,10052,KrCh,Decomposing permutation automata
10.4230/LIPIcs.STACS.2021.44,10055,KrCh,A Ramsey theorem for finite monoids
10.4230/LIPIcs.MFCS.2021.53,10075,KrCh,A bit of nondeterminism makes pushdown automata expressive and succinct
10.4230/LIPIcs.FSTTCS.2021.34,10630,KrCh,On the complexity of intersection non-emptiness for star-free language classes
10.1137/1.9781611976465.38,10694,"GradSch,KrCh",Infinite-duration all-pay bidding games
10.4230/LIPIcs.MFCS.2020.22,8533,KrCh,Simplified game of life: Algorithms and complexity
10.4230/LIPIcs.MFCS.2020.51,8534,KrCh,Unary prime languages