| No. |
Title |
Author |
Year |
| 1 |
CSP Beyond Tractable Constraint Languages |
Dreier, Jan et al. |
2022 |
| 2 |
Finding a Cluster in Incomplete Data |
Eiben, Eduard et al. |
2022 |
| 3 |
SAT Backdoors: Depth Beats Size |
Dreier, Jan et al. |
2022 |
| 4 |
Reasoning Short Cuts in Infinite Domain Constraint Satisfaction: Algorithms and Lower Bounds for Backdoors |
Jonsson, Peter et al. |
2021 |
| 5 |
Parameterized Pre-Coloring Extension and List Coloring Problems |
Gutin, Gregory et al. |
2020 |
| 6 |
Group Activity Selection with Few Agent Types |
Ganian, Robert et al. |
2019 |
| 7 |
On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem |
Ganian, Robert et al. |
2018 |
| 8 |
Small Resolution Proofs for QBF using Dependency Treewidth |
Eiben, Eduard et al. |
2018 |
| 9 |
Backdoor Sets for CSP |
Gaspers, Serge et al. |
2017 |
| 10 |
Backdoors for Linear Temporal Logic |
Meier, Arne et al. |
2017 |
| 11 |
On Structural Parameterizations of the Edge Disjoint Paths Problem |
Ganian, Robert et al. |
2017 |
| 12 |
Towards a Polynomial Kernel for Directed Feedback Vertex Set |
Bergougnoux, Benjamin et al. |
2017 |
| 13 |
Counting Linear Extensions: Parameterizations by Treewidth |
Eiben, Eduard et al. |
2016 |
| 14 |
On the Complexity Landscape of Connected f-Factor Problems |
Ganian, Robert et al. |
2016 |
| 15 |
Backdoors to q-Horn |
Gaspers, Serge et al. |
2013 |
| 16 |
Satisfiability of Acyclic and Almost Acyclic CNF Formulas |
Ordyniak, Sebastian et al. |
2010 |
