Publications
- PARAMETERIZED APPROXIMATION SCHEMES FOR STEINER TREES WITH SMALL NUMBER OF STEINER VERTICES2021 | Faculty of Mathematics and Physics
- Optimal discretization is fixed-parameter tractable2021 | Faculty of Mathematics and Physics
- Parameterized complexity of fair deletion problems2020 | Faculty of Mathematics and Physics
- Diversity of Solutions: An Exploration Through the Lens of Fixed-Parameter Tractability Theory2020 | Faculty of Mathematics and Physics
- Approximation Algorithms for Steiner Tree Based on Star Contractions: A Unified View2020 | 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
- FPT Algorithms for Diverse Collections of Hitting Sets2019 | Faculty of Mathematics and Physics
- Notes on complexity of packing coloring2018 | Faculty of Mathematics and Physics
- Parameterized approximation schemes for steiner trees with small number of Steiner vertices2018 | Faculty of Mathematics and Physics
Loading network view...