Publications
- PARAMETERIZED APPROXIMATION SCHEMES FOR STEINER TREES WITH SMALL NUMBER OF STEINER VERTICES2021 | Faculty of Mathematics and Physics
- Parameterized complexity of fair deletion problems2020 | Faculty of Mathematics and Physics
- Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity2019 | Faculty of Mathematics and Physics
- Parameterized Complexity of Fair Vertex Evaluation Problems2019 | Faculty of Mathematics and Physics
- Parameterized approximation schemes for steiner trees with small number of Steiner vertices2018 | Faculty of Mathematics and Physics
- Target Set Selection in Dense Graph Classes +12018 | Faculty of Mathematics and Physics
- SIMPLIFIED ALGORITHMIC METATHEOREMS BEYOND MSO: TREEWIDTH AND NEIGHBORHOOD DIVERSITY2017 | Faculty of Mathematics and Physics
- Parameterized Complexity of Fair Deletion Problems2017 | Faculty of Mathematics and Physics
Loading network view...