- Thin graph classes and polynomial-time approximation schemes2018 | Matematicko-fyzikální fakulta
- Polynomial time approximation schemes for clustering in low highway dimension graphs +12020 | Matematicko-fyzikální fakulta
- Baker game and polynomial-time approximation schemes2020 | Matematicko-fyzikální fakulta
- Maximum Edge Colouring Problem On Graphs That Exclude a Fixed Minor2023 | Matematicko-fyzikální fakulta
- Travelling on Graphs with Small Highway Dimension +12021 | Matematicko-fyzikální fakulta
- Approximation Schemes for Bounded Distance Problems on Fractionally Treewidth-Fragile Graphs2021 | Matematicko-fyzikální fakulta
- Graph Burning and Non-uniform k-Centers for Small Treewidth2022 | Matematicko-fyzikální fakulta
- Induced odd cycle packing number, independent sets, and chromatic number2023 | Matematicko-fyzikální fakulta
- A (1+epsilon)-EMBEDDING OF LOW HIGHWAY DIMENSION GRAPHS INTO BOUNDED TREEWIDTH GRAPHS2018 | Matematicko-fyzikální fakulta