| No. |
Title |
Author |
Year |
| 1 |
Approximation Algorithms and Lower Bounds for Graph Burning |
Lieskovský, Matej et al. |
2023 |
| 2 |
On Sparse Hitting Sets: From Fair Vertex Cover to Highway Dimension |
Blum, Johannes et al. |
2022 |
| 3 |
On Extended Formulations For Parameterized Steiner Trees |
Feldmann, Andreas Emil et al. |
2021 |
| 4 |
Fixed-Parameter Tractability of the Weighted Edge Clique Partition Problem |
Feldmann, Andreas Emil et al. |
2020 |
| 5 |
Polynomial Time Approximation Schemes for Clustering in Low Highway Dimension Graphs |
Feldmann, Andreas Emil et al. |
2020 |
| 6 |
Recoloring Interval Graphs with Limited Recourse Budget |
Bosek, Bartłomiej et al. |
2020 |
| 7 |
FPT Inapproximability of Directed Cut and Connectivity Problems |
Chitnis, Rajesh et al. |
2019 |
| 8 |
Parameterized Approximation Algorithms for Bidirected Steiner Network Problems |
Chitnis, Rajesh et al. |
2018 |
| 9 |
Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices |
Dvorák, Pavel et al. |
2018 |
| 10 |
The Parameterized Hardness of the k-Center Problem in Transportation Networks |
Feldmann, Andreas Emil et al. |
2018 |
| 11 |
Fast Approximation Algorithms for the Generalized Survivable Network Design Problem |
Feldmann, Andreas Emil et al. |
2016 |
| 12 |
The Complexity Landscape of Fixed-Parameter Directed Steiner Network Problems |
Feldmann, Andreas Emil et al. |
2016 |
| 13 |
On the Equivalence of the Bidirected and Hypergraphic Relaxations for Steiner Tree |
Feldmann, Andreas Emil et al. |
2014 |
| 14 |
Balanced Partitions of Trees and Applications |
Feldmann, Andreas Emil et al. |
2012 |
