Publications
- Generalized k-Center: Distinguishing Doubling and Highway Dimension2022 | Faculty of Mathematics and Physics
- The Parameterized Complexity of the Survivable Network Design Problem2022 | Faculty of Mathematics and Physics
- On extended formulations for parameterized steiner trees2021 | Faculty of Mathematics and Physics
- PARAMETERIZED APPROXIMATION SCHEMES FOR STEINER TREES WITH SMALL NUMBER OF STEINER VERTICES2021 | Faculty of Mathematics and Physics
- A Survey on Approximation in Parameterized Complexity: Hardness and Algorithms2020 | Faculty of Mathematics and Physics
- Polynomial time approximation schemes for clustering in low highway dimension graphs +12020 | Faculty of Mathematics and Physics
- Parameterized Inapproximability of Independent Set in H-Free Graphs +12020 | Faculty of Mathematics and Physics
- Fixed-Parameter Approximations for k-Center Problems in Low Highway Dimension Graphs2019 | Faculty of Mathematics and Physics
- A Tight Lower Bound for Planar Steiner Orientation2019 | Faculty of Mathematics and Physics
- FPT Inapproximability of Directed Cut and Connectivity Problems2019 | Faculty of Mathematics and Physics
Loading network view...