- Graph Covers: Where Topology Meets Computer Science, and Simple Means Difficult2023 | Faculty of Mathematics and Physics
- Algorithmic Aspects of Regular Graph Covers with Applications to Planar Graphs2014 | Faculty of Mathematics and Physics
- 3-connected reduction for regular graph covers2018 | Faculty of Mathematics and Physics
- Complexity of graph covering problems1998 | Faculty of Mathematics and Physics
- Complexity of graph covering problems1995 | Publication without faculty affiliation
- Complexity of colored graph covers II. When 2-SAT helpsPublication without faculty affiliation
- Complexity of colored graph covers I. Colored directed multigraphs1997 | Faculty of Mathematics and Physics
- Computational Complexity of Covering Colored Mixed Multigraphs with Degree Partition Equivalence Classes of Size at Most Two (Extended Abstract)2023 | Faculty of Mathematics and Physics
- List Covering of Regular Multigraphs2022 | Faculty of Mathematics and Physics
- Computational Complexity of Covering Multigraphs with Semi-Edges: Small Cases2021 | Faculty of Mathematics and Physics
- On the computational complexity of partial covers of theta graphs2008 | Faculty of Mathematics and Physics
- Computational Complexity of Covering Disconnected Multigraphs2021 | Faculty of Mathematics and Physics