- The Complexity Landscape of Fixed-Parameter Directed Steiner Network Problems2016 | 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
- Parameterized Approximation Algorithms for Bidirected Steiner Network Problems +12021 | Faculty of Mathematics and Physics
- Parameterized Complexity of Arc-Weighted Directed Steiner Problems +12009 | Faculty of Mathematics and Physics