- Parameterized Approximation Algorithms for Bidirected Steiner Network Problems +12018 | Faculty of Mathematics and Physics
- Parameterized approximation schemes for steiner trees with small number of Steiner vertices2018 | Faculty of Mathematics and Physics
- PARAMETERIZED APPROXIMATION SCHEMES FOR STEINER TREES WITH SMALL NUMBER OF STEINER VERTICES2021 | Faculty of Mathematics and Physics
- Generalized k-Center: Distinguishing Doubling and Highway Dimension2022 | Faculty of Mathematics and Physics
- Fixed-Parameter Approximations for k-Center Problems in Low Highway Dimension Graphs2019 | Faculty of Mathematics and Physics
- Parameterized Inapproximability of Independent Set in H-Free Graphs2023 | Faculty of Mathematics and Physics
- The Parameterized Hardness of the k-Center Problem in Transportation Networks +12020 | Faculty of Mathematics and Physics
- Approximation Algorithms for Steiner Tree Based on Star Contractions: A Unified View2020 | Faculty of Mathematics and Physics