- Homomorphism-homogeneous L-colored graphs2014 | Faculty of Mathematics and Physics
- Colored graphs without colorful cycles2007 | Faculty of Mathematics and Physics
- Coloring graphs from lists with bounded size of their union +12005 | Faculty of Mathematics and Physics
- The complexity of coloring graphs without long induced paths2001 | Faculty of Mathematics and Physics
- Complexity of colored graph covers II. When 2-SAT helpsPublication without faculty affiliation
- Complexity of Coloring Graphs without Forbidden Induced Subgraphs2001 | Faculty of Mathematics and Physics
- Complexity of colored graph covers I. Colored directed multigraphs1997 | Faculty of Mathematics and Physics
- On hamiltonian colorings of graphs2005 | Faculty of Arts
- Coloring triangle-free graphs on surfaces2009 | Faculty of Mathematics and Physics
- On generalized choice and coloring numbers2019 | Faculty of Mathematics and Physics
- Three-coloring triangle-free graphs on surfaces IV. Bounding face sizes of 4-critical graphs2021 | Faculty of Mathematics and Physics
- Triangle-free graphs of tree-width t are ceil((t+3)/2)-colorable2017 | Faculty of Mathematics and Physics
- On Aharoni's rainbow generalization of the Caccetta-Haggkvist conjecture2021 | Faculty of Mathematics and Physics
- Graph isomorphism restricted by lists2021 | 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
- Better bounds for incremental frequency allocation in bipartite graphs2013 | Faculty of Mathematics and Physics
- Rankwidth meets stability2021 | Faculty of Mathematics and Physics