Publications
- On extended formulations for parameterized steiner trees2021 | Faculty of Mathematics and Physics
- Parameterized Inapproximability of Independent Set in H-Free Graphs +12020 | Faculty of Mathematics and Physics
- Parameterized Approximation Algorithms for Bidirected Steiner Network Problems +12018 | Faculty of Mathematics and Physics
- Fast Approximation Algorithms for the Generalized Survivable Network Design Problem2016 | 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
- 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
Loading network view...