- The Parametrized Complexity of the Segment Number2024 | Faculty of Mathematics and Physics
- Linear Layouts of Complete Graphs2021 | Faculty of Mathematics and Physics
- Entropy numbers of finite-dimensional embeddings2020 | Faculty of Mathematics and Physics
- Target Set Selection in Dense Graph Classes +12022 | Faculty of Mathematics and Physics
- Kneser ranks of random graphs and minimum difference representations2017 | Faculty of Mathematics and Physics
- Cluster Vertex Deletion: A Parameterization between Vertex Cover and Clique-Width2012 | Faculty of Mathematics and Physics
- Finding vertex-surjective graph homomorphisms2012 | Faculty of Mathematics and Physics
- KNESER RANKS OF RANDOM GRAPHS AND MINIMUM DIFFERENCE REPRESENTATIONS2018 | Faculty of Mathematics and Physics
- Bounding and Computing Obstacle Numbers of Graphs2022 | Faculty of Mathematics and Physics
- Parameterized Complexity of Fair Vertex Evaluation Problems2019 | Faculty of Mathematics and Physics