Publikace
- The Parameterized Complexity of the Survivable Network Design Problem2022 | Matematicko-fyzikální fakulta
- On extended formulations for parameterized steiner trees2021 | Matematicko-fyzikální fakulta
- PARAMETERIZED APPROXIMATION SCHEMES FOR STEINER TREES WITH SMALL NUMBER OF STEINER VERTICES2021 | Matematicko-fyzikální fakulta
- TIGHT BOUNDS FOR PLANAR STRONGLY CONNECTED STEINER SUBGRAPH WITH FIXED NUMBER OF TERMINALS (AND EXTENSIONS)2020 | Matematicko-fyzikální fakulta
- FPT Inapproximability of Directed Cut and Connectivity Problems2019 | Matematicko-fyzikální fakulta
- Parameterized approximation schemes for steiner trees with small number of Steiner vertices2018 | Matematicko-fyzikální fakulta
- Parameterized Approximation Algorithms for Bidirected Steiner Network Problems +12018 | Matematicko-fyzikální fakulta
- The Complexity Landscape of Fixed-Parameter Directed Steiner Network Problems2016 | Matematicko-fyzikální fakulta
- Fast Approximation Algorithms for the Generalized Survivable Network Design Problem2016 | Matematicko-fyzikální fakulta
- Generalized k-Center: Distinguishing Doubling and Highway Dimension2022 | Matematicko-fyzikální fakulta
Loading network view...
