- Complexity of a Problem Concerning Reset Words for Eulerian Binary Automata +12017 | Faculty of Mathematics and Physics
- Complexity of Road Coloring with Prescribed Reset Words +12019 | Faculty of Mathematics and Physics
- Subset Synchronization and Careful Synchronization of Binary Finite Automata2016 | Faculty of Mathematics and Physics
- Parameterized Complexity of Synchronization and Road Coloring2015 | Faculty of Mathematics and Physics
- An Extremal Series of Eulerian Synchronizing 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