Publikace
- FPT Inapproximability of Directed Cut and Connectivity Problems2019 | Matematicko-fyzikální fakulta
- On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree2016 | 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
- The Parameterized Complexity of the Survivable Network Design Problem2022 | Matematicko-fyzikální fakulta
- A note on the approximability of deepest-descent circuit steps2021 | 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
- Near-linear Time Approximation Schemes for Clustering in Doubling Metrics2021 | Matematicko-fyzikální fakulta
- Efficient fully dynamic elimination forests with applications to detecting long paths and cycles2021 | Matematicko-fyzikální fakulta
Loading network view...