Publications
- The Parameterized Complexity of the Survivable Network Design Problem2022 | Faculty of Mathematics and Physics
- On extended formulations for parameterized steiner trees2021 | Faculty of Mathematics and Physics
- PARAMETERIZED APPROXIMATION SCHEMES FOR STEINER TREES WITH SMALL NUMBER OF STEINER VERTICES2021 | Faculty of Mathematics and Physics
- TIGHT BOUNDS FOR PLANAR STRONGLY CONNECTED STEINER SUBGRAPH WITH FIXED NUMBER OF TERMINALS (AND EXTENSIONS)2020 | Faculty of Mathematics and Physics
- A Tight Lower Bound for Planar Steiner Orientation2019 | Faculty of Mathematics and Physics
- Travelling on Graphs with Small Highway Dimension +12019 | Faculty of Mathematics and Physics
- Parameterized approximation schemes for steiner trees with small number of Steiner vertices2018 | Faculty of Mathematics and Physics
- A (1+epsilon)-EMBEDDING OF LOW HIGHWAY DIMENSION GRAPHS INTO BOUNDED TREEWIDTH GRAPHS2018 | Faculty of Mathematics and Physics
- A Tight Lower Bound for Steiner Orientation2018 | Faculty of Mathematics and Physics
- Parameterized Approximation Algorithms for Bidirected Steiner Network Problems +12018 | Faculty of Mathematics and Physics
Loading network view...