| Publication | Date of Publication | Type |
|---|
| An algorithmic framework for locally constrained homomorphisms | 2024-05-08 | Paper |
| SAT backdoors: depth beats size | 2024-03-11 | Paper |
| CSP beyond tractable constraint languages | 2024-02-14 | Paper |
| Solving infinite-domain CSPs using the patchwork property | 2023-06-19 | Paper |
| An algorithmic framework for locally constrained homomorphisms | 2023-05-05 | Paper |
| Group activity selection with few agent types | 2023-04-28 | Paper |
| Structure-Aware Lower Bounds and Broadening the Horizon of Tractability for QBF | 2023-04-26 | Paper |
| On the parameterized complexity of clustering problems for incomplete data | 2023-03-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874290 | 2023-02-07 | Paper |
| Treewidth is NP-Complete on Cubic Graphs (and related results) | 2023-01-24 | Paper |
| Computational Short Cuts in Infinite Domain Constraint Satisfaction | 2023-01-09 | Paper |
| Parameterized complexity of envy-free resource allocation in social networks | 2023-01-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5075791 | 2022-05-11 | Paper |
| The complexity landscape of decompositional parameters for ILP: programs with few global variables and constraints | 2021-11-02 | Paper |
| Backdoor Sets for CSP. | 2021-06-15 | Paper |
| On structural parameterizations of the edge disjoint paths problem | 2021-06-11 | Paper |
| Towards a polynomial kernel for directed feedback vertex set | 2021-04-19 | Paper |
| Parameterized Pre-Coloring Extension and List Coloring Problems | 2021-03-30 | Paper |
| The power of cut-based parameters for computing edge-disjoint paths | 2021-03-26 | Paper |
| On structural parameterizations of the bounded-degree vertex deletion problem | 2021-02-01 | Paper |
| Cost-optimal Planning, Delete Relaxation, Approximability, and Heuristics | 2021-01-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5136255 | 2020-11-25 | Paper |
| Small Resolution Proofs for QBF using Dependency Treewidth | 2020-08-05 | Paper |
| On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem | 2020-08-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111250 | 2020-05-26 | Paper |
| Using decomposition-parameters for QBF: mind the prefix! | 2020-03-13 | Paper |
| The power of cut-based parameters for computing edge disjoint paths | 2020-02-24 | Paper |
| Integer programming and incidence treedepth | 2020-02-06 | Paper |
| A SAT Approach to Branchwidth | 2019-11-22 | Paper |
| SAT-Encodings for Treecut Width and Treedepth | 2019-09-13 | Paper |
| Backdoors to planning | 2019-08-28 | Paper |
| On the complexity landscape of connected \(f\)-factor problems | 2019-05-17 | Paper |
| Backdoors for linear temporal logic | 2019-02-14 | Paper |
| Clique-Width and Directed Width Measures for Answer-Set Programming | 2018-07-12 | Paper |
| The complexity landscape of decompositional parameters for ILP | 2018-05-16 | Paper |
| Backdoors for Linear Temporal Logic | 2018-04-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4608602 | 2018-03-21 | Paper |
| Counting Linear Extensions: Parameterizations by Treewidth | 2018-03-02 | Paper |
| SAT-encodings for special treewidth and pathwidth | 2017-11-15 | Paper |
| First order limits of sparse graphs: Plane trees and path-width | 2017-08-10 | Paper |
| Backdoors to q-Horn | 2017-01-30 | Paper |
| Backdoors into heterogeneous classes of SAT and CSP | 2016-12-28 | Paper |
| Kernelization using structural parameters on sparse graph classes | 2016-11-14 | Paper |
| SOBRA - Shielding Optimization for BRAchytherapy | 2016-09-29 | Paper |
| A SAT Approach to Branchwidth | 2016-09-05 | Paper |
| A parameterized study of maximum generalized pattern matching problems | 2016-06-28 | Paper |
| Tree-depth and vertex-minors | 2016-05-11 | Paper |
| Edge-Editing to a Dense and a Sparse Graph Class | 2016-05-03 | Paper |
| Complexity and monotonicity results for domination games | 2016-04-13 | Paper |
| Backdoors to q-Horn | 2016-03-23 | Paper |
| Faster Existential FO Model Checking on Posets | 2016-01-07 | Paper |
| Directed elimination games | 2015-12-10 | Paper |
| On finding optimal polytrees | 2015-10-08 | Paper |
| Parameterized Algorithms for Parity Games | 2015-09-16 | Paper |
| A parameterized study of maximum generalized pattern matching problems | 2015-09-15 | Paper |
| Finite Integer Index of Pathwidth and Treewidth | 2015-09-15 | Paper |
| Faster Existential FO Model Checking on Posets | 2015-09-11 | Paper |
| A complete parameterized complexity analysis of bounded planning | 2015-07-13 | Paper |
| The Complexity of Repairing, Adjusting, and Aggregating of Extensions in Abstract Argumentation | 2014-03-31 | Paper |
| Parameterized Algorithms for Modular-Width | 2013-12-10 | Paper |
| Satisfiability of acyclic and almost acyclic CNF formulas | 2013-11-29 | Paper |
| Kernelization Using Structural Parameters on Sparse Graph Classes | 2013-09-17 | Paper |
| Upper and Lower Bounds for Weak Backdoor Set Detection | 2013-08-05 | Paper |
| Parameterized Complexity and Kernel Bounds for Hard Planning Problems | 2013-06-07 | Paper |
| Parameterized Complexity Results for Exact Bayesian Network Structure Learning | 2013-04-09 | Paper |
| Augmenting tractable fragments of abstract argumentation | 2012-11-15 | Paper |
| Satisfiability of Acyclic and Almost Acyclic CNF Formulas. | 2012-08-29 | Paper |
| Algorithms and complexity results for persuasive argumentation | 2011-11-17 | Paper |
| Digraph decompositions and monotonicity in digraph searching | 2011-09-12 | Paper |
| Satisfiability of Acyclic and almost Acyclic CNF Formulas (II) | 2011-06-17 | Paper |
| Distance d-Domination Games | 2010-01-21 | Paper |
| Digraph Decompositions and Monotonicity in Digraph Searching | 2009-01-20 | Paper |
