Publikace
- PARAMETERIZED APPROXIMATION SCHEMES FOR STEINER TREES WITH SMALL NUMBER OF STEINER VERTICES2021 | Matematicko-fyzikální fakulta
- A Survey on Approximation in Parameterized Complexity: Hardness and Algorithms2020 | Matematicko-fyzikální fakulta
- Polynomial time approximation schemes for clustering in low highway dimension graphs +12020 | Matematicko-fyzikální fakulta
- Parameterized Inapproximability of Independent Set in H-Free Graphs +12020 | 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
- The Parameterized Hardness of the k-Center Problem in Transportation Networks +12018 | Matematicko-fyzikální fakulta
- Parameterized Approximation Algorithms for Bidirected Steiner Network Problems +12018 | 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
Loading network view...