- Online Chromatic Number is PSPACE-Complete +12018 | Faculty of Mathematics and Physics
- Graph sharing games: Complexity and connectivity2013 | Faculty of Mathematics and Physics
- The decision problem of provability logic with only one atom2003 | Faculty of Arts
- The complete classification for quantified equality constraints +22023 | Faculty of Mathematics and Physics
- On the polynomial-space completeness of intuitionistic propositional logic2003 | Faculty of Arts
- QCSP Monsters and the Demise of the Chen Conjecture2022 | Faculty of Mathematics and Physics
- Subset Synchronization and Careful Synchronization of Binary Finite Automata2016 | Faculty of Mathematics and Physics
- Subset Synchronization of Transitive Automata2014 | Faculty of Mathematics and Physics
- Subset Synchronizability in Eulerian Automata Is NP-Hard2014 | Faculty of Mathematics and Physics
- The guarding game is E-complete2014 | Faculty of Mathematics and Physics
- Complexity of the cop and robber guarding game2011 | Faculty of Mathematics and Physics
- Pattern-Based Verification for Multithreaded Programs2014 | Faculty of Mathematics and Physics