- 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
- Approximation Metatheorems for Classes with Bounded Expansion2022 | Faculty of Mathematics and Physics
- Algorithms for classes of graphs with bounded expansion2010 | Faculty of Mathematics and Physics
- Decomposition Width of Matroids2010 | Faculty of Mathematics and Physics
- Decomposition width of matroids2012 | Faculty of Mathematics and Physics
- Parameterized Complexity of Fair Deletion Problems2017 | Faculty of Mathematics and Physics
- Deciding first-order properties for sparse graphs2010 | Faculty of Mathematics and Physics
- Parameterized Complexity of Fair Vertex Evaluation Problems2019 | Faculty of Mathematics and Physics
- Parameterized complexity of fair deletion problems2020 | Faculty of Mathematics and Physics