Publications
- FPT Inapproximability of Directed Cut and Connectivity Problems2019 | Faculty of Mathematics and Physics
- 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
- A note on the approximability of deepest-descent circuit steps2021 | 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
- Near-linear Time Approximation Schemes for Clustering in Doubling Metrics2021 | Faculty of Mathematics and Physics
- Efficient fully dynamic elimination forests with applications to detecting long paths and cycles2021 | Faculty of Mathematics and Physics
- TIGHT BOUNDS FOR PLANAR STRONGLY CONNECTED STEINER SUBGRAPH WITH FIXED NUMBER OF TERMINALS (AND EXTENSIONS)2020 | Faculty of Mathematics and Physics
- A Survey on Approximation in Parameterized Complexity: Hardness and Algorithms2020 | Faculty of Mathematics and Physics
Loading network view...