- SIMPLIFIED ALGORITHMIC METATHEOREMS BEYOND MSO: TREEWIDTH AND NEIGHBORHOOD DIVERSITY2017 | Faculty of Mathematics and Physics
- Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity2019 | Faculty of Mathematics and Physics
- A Note on Coloring (4K(1), C-4, C-6)-Free Graphs with a C-72022 | Faculty of Mathematics and Physics
- Parameterized complexity of fair deletion problems2020 | Faculty of Mathematics and Physics
- Fixed Parameter Complexity of Distance Constrained Labeling and Uniform Channel Assignment Problems - (Extended Abstract)2016 | Faculty of Mathematics and Physics
- Parameterized complexity of distance labeling and uniform channel assignment problems2018 | Faculty of Mathematics and Physics
- Partitioning Graphs into Induced Subgraphs2017 | Faculty of Mathematics and Physics
- Target Set Selection in Dense Graph Classes +12018 | Faculty of Mathematics and Physics
- Anti-Path Cover on Sparse Graph Classes2016 | Faculty of Mathematics and Physics
- Parameterized Complexity of Fair Deletion Problems2017 | Faculty of Mathematics and Physics
- Integer programming in parameterized complexity: Five miniatures2022 | Faculty of Mathematics and Physics, Central Library of Charles University