- FPT Algorithms for Diverse Collections of Hitting Sets2019 | Faculty of Mathematics and Physics
- Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs +12019 | Faculty of Mathematics and Physics
- Packing directed circuits quarter-integrally2019 | Faculty of Mathematics and Physics
- Packing Directed Cycles Quarter- and Half-Integrally2022 | Faculty of Mathematics and Physics
- Parameterized complexity of fair deletion problems2020 | Faculty of Mathematics and Physics
- What Makes Equitable Connected Partition Easy2010 | Faculty of Mathematics and Physics
- Parameterized Complexity of Fair Deletion Problems2017 | Faculty of Mathematics and Physics
- Parameterized Complexity of Fair Vertex Evaluation Problems2019 | Faculty of Mathematics and Physics