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


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI