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
- Efficient fully dynamic elimination forests with applications to detecting long paths and cycles2021 | 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
- Recoloring interval graphs with limited recourse budget2020 | Faculty of Mathematics and Physics
- Fixed-Parameter Approximations for k-Center Problems in Low Highway Dimension Graphs2019 | Faculty of Mathematics and Physics
- A Tight Lower Bound for Planar Steiner Orientation2019 | Faculty of Mathematics and Physics
- FPT Inapproximability of Directed Cut and Connectivity Problems2019 | 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
Loading network view...