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
- Travelling on Graphs with Small Highway Dimension +12019 | Matematicko-fyzikální fakulta
- Parameterized approximation schemes for steiner trees with small number of Steiner vertices2018 | Matematicko-fyzikální fakulta
- A (1+epsilon)-EMBEDDING OF LOW HIGHWAY DIMENSION GRAPHS INTO BOUNDED TREEWIDTH GRAPHS2018 | Matematicko-fyzikální fakulta
- On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree2016 | Matematicko-fyzikální fakulta
- The Complexity Landscape of Fixed-Parameter Directed Steiner Network Problems2016 | Matematicko-fyzikální fakulta
- Generalized k-Center: Distinguishing Doubling and Highway Dimension2022 | Matematicko-fyzikální fakulta
- A note on the approximability of deepest-descent circuit steps2021 | Matematicko-fyzikální fakulta
Loading network view...