| No. |
Title |
Author |
Year |
| 1 |
5-Approximation for ℋ-Treewidth Essentially as Fast as ℋ-Deletion Parameterized by Solution Size |
Jansen, Bart M. P. et al. |
2023 |
| 2 |
Finding Long Directed Cycles Is Hard Even When DFVS Is Small or Girth Is Large |
Jacob, Ashwin et al. |
2023 |
| 3 |
Tight Bounds for Chordal/Interval Vertex Deletion Parameterized by Treewidth |
Włodarczyk, Michał |
2023 |
| 4 |
On the Hardness of Compressing Weights |
Jansen, Bart M. P. et al. |
2021 |
| 5 |
Preprocessing for Outerplanar Vertex Deletion: An Elementary Kernel of Quartic Size |
Donkers, Huib et al. |
2021 |
| 6 |
Optimal Polynomial-Time Compression for Boolean Max CSP |
Jansen, Bart M. P. et al. |
2020 |
| 7 |
Parameterized Inapproximability for Steiner Orientation by Gap Amplification |
Włodarczyk, Michał |
2020 |
| 8 |
Constant-Factor FPT Approximation for Capacitated k-Median |
Adamczyk, Marek et al. |
2019 |
| 9 |
On Problems Equivalent to (min,+)-Convolution |
Cygan, Marek et al. |
2017 |
| 10 |
Clifford Algebras Meet Tree Decompositions |
Wlodarczyk, Michal |
2017 |
| 11 |
When the Optimum is also Blind: a New Perspective on Universal Optimization |
Adamczyk, Marek et al. |
2017 |
