| Publication | Date of Publication | Type |
|---|
| Separable convex mixed-integer optimization: improved algorithms and lower bounds | 2026-05-26 | Paper |
| Covering and partitioning of split, chain and cographs with isometric paths | 2026-05-12 | Paper |
Covering and partitioning of split, chain and cographs with isometric paths
Theoretical Computer Science | 2026-05-11 | Paper |
Algorithms and complexity of difference logic
Journal of Computer and System Sciences | 2026-05-08 | Paper |
SOBRA - shielding optimization for BRAchytherapy
Theoretical Computer Science | 2026-03-30 | Paper |
| Structure-aware lower bounds and broadening the horizon of tractability for QBF | 2026-02-27 | Paper |
A general theoretical framework for learning smallest interpretable models
Artificial Intelligence | 2026-01-22 | Paper |
| A tight subexponential-time algorithm for two-page book embedding | 2026-01-14 | Paper |
From data completion to problems on hypercubes: a parameterized analysis of the independent set problem
Algorithmica | 2025-11-25 | Paper |
Almost consistent systems of linear equations
ACM Transactions on Algorithms | 2025-11-03 | Paper |
Treewidth is NP-complete on cubic graphs
The Electronic Journal of Combinatorics | 2025-09-25 | Paper |
| From data completion to problems on hypercubes: a parameterized analysis of the independent set problem | 2025-09-24 | Paper |
| Parameterized complexity classification for interval constraints | 2025-09-24 | Paper |
| Treewidth is NP-complete on cubic graphs | 2025-09-24 | Paper |
| FO model checking on posets of bounded width | 2025-08-05 | Paper |
| Finding a cluster in incomplete data | 2025-06-19 | Paper |
| SAT backdoors: depth beats size | 2025-06-19 | Paper |
Backdoor DNFs
Journal of Computer and System Sciences | 2024-07-01 | Paper |
| Almost consistent systems of linear equations | 2024-05-14 | Paper |
An algorithmic framework for locally constrained homomorphisms
SIAM Journal on Discrete Mathematics | 2024-05-08 | Paper |
SAT backdoors: depth beats size
Journal of Computer and System Sciences | 2024-03-11 | Paper |
CSP beyond tractable constraint languages
Constraints | 2024-02-14 | Paper |
Solving infinite-domain CSPs using the patchwork property
Artificial Intelligence | 2023-06-19 | Paper |
An algorithmic framework for locally constrained homomorphisms
Graph-Theoretic Concepts in Computer Science | 2023-05-05 | Paper |
An algorithmic framework for locally constrained homomorphisms
Graph-Theoretic Concepts in Computer Science | 2023-05-05 | Paper |
Group activity selection with few agent types
Algorithmica | 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
Journal of Computer and System Sciences | 2023-03-10 | Paper |
| scientific article; zbMATH DE number 7650904 (Why is no real title available?) | 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
Journal of Artificial Intelligence Research | 2023-01-09 | Paper |
Parameterized complexity of envy-free resource allocation in social networks
Artificial Intelligence | 2023-01-04 | Paper |
scientific article; zbMATH DE number 7525485 (Why is no real title available?)
(available as arXiv preprint) | 2022-05-11 | Paper |
The complexity landscape of decompositional parameters for ILP: programs with few global variables and constraints
Artificial Intelligence | 2021-11-02 | Paper |
| Backdoor sets for CSP | 2021-06-15 | Paper |
On structural parameterizations of the edge disjoint paths problem
Algorithmica | 2021-06-11 | Paper |
Towards a polynomial kernel for directed feedback vertex set
Algorithmica | 2021-04-19 | Paper |
Parameterized pre-coloring extension and list coloring problems
SIAM Journal on Discrete Mathematics | 2021-03-30 | Paper |
The power of cut-based parameters for computing edge-disjoint paths
Algorithmica | 2021-03-26 | Paper |
On structural parameterizations of the bounded-degree vertex deletion problem
Algorithmica | 2021-02-01 | Paper |
Cost-optimal planning, delete relaxation, approximability, and heuristics
Journal of Artificial Intelligence Research | 2021-01-22 | Paper |
scientific article; zbMATH DE number 7278041 (Why is no real title available?)
(available as arXiv preprint) | 2020-11-25 | Paper |
| On structural parameterizations of the bounded-degree vertex deletion problem | 2020-08-05 | Paper |
Small resolution proofs for QBF using dependency treewidth
(available as arXiv preprint) | 2020-08-05 | Paper |
| Towards a polynomial kernel for directed feedback vertex set | 2020-05-26 | Paper |
Using decomposition-parameters for QBF: mind the prefix!
Journal of Computer and System Sciences | 2020-03-13 | Paper |
The power of cut-based parameters for computing edge disjoint paths
(available as arXiv preprint) | 2020-02-24 | 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 |
Integer programming and incidence treedepth
(available as arXiv preprint) | 2020-02-06 | Paper |
A SAT approach to branchwidth
ACM Transactions on Computational Logic | 2019-11-22 | Paper |
SAT-encodings for treecut width and treedepth
2019 Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-13 | Paper |
Backdoors to planning
Artificial Intelligence | 2019-08-28 | Paper |
On the complexity landscape of connected \(f\)-factor problems
Algorithmica | 2019-05-17 | Paper |
Backdoors for linear temporal logic
Algorithmica | 2019-02-14 | Paper |
Clique-width and directed width measures for answer-set programming
(available as arXiv preprint) | 2018-07-12 | Paper |
The complexity landscape of decompositional parameters for ILP
Artificial Intelligence | 2018-05-16 | Paper |
The complexity landscape of decompositional parameters for ILP
Artificial Intelligence | 2018-05-16 | Paper |
Backdoors for linear temporal logic
(available as arXiv preprint) | 2018-04-10 | Paper |
On the complexity landscape of connected \(f\)-factor problems
(available as arXiv preprint) | 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
Random Structures & Algorithms | 2017-08-10 | Paper |
First order limits of sparse graphs: plane trees and path-width
Random Structures & Algorithms | 2017-08-10 | Paper |
| Backdoors to q-Horn | 2017-01-30 | Paper |
Backdoors into heterogeneous classes of SAT and CSP
Journal of Computer and System Sciences | 2016-12-28 | Paper |
Kernelization using structural parameters on sparse graph classes
Journal of Computer and System Sciences | 2016-11-14 | Paper |
Kernelization using structural parameters on sparse graph classes
Journal of Computer and System Sciences | 2016-11-14 | Paper |
SOBRA -- shielding optimization for brachytherapy
Lecture Notes in Computer Science | 2016-09-29 | Paper |
A SAT approach to branchwidth
Theory and Applications of Satisfiability Testing – SAT 2016 | 2016-09-05 | Paper |
A parameterized study of maximum generalized pattern matching problems
Algorithmica | 2016-06-28 | Paper |
Tree-depth and vertex-minors
European Journal of Combinatorics | 2016-05-11 | Paper |
Edge-editing to a dense and a sparse graph class
LATIN 2016: Theoretical Informatics | 2016-05-03 | Paper |
Complexity and monotonicity results for domination games
Theoretical Computer Science | 2016-04-13 | Paper |
Backdoors to q-Horn
Algorithmica | 2016-03-23 | Paper |
Faster existential FO model checking on posets
Logical Methods in Computer Science | 2016-01-07 | Paper |
Directed elimination games
Discrete Applied Mathematics | 2015-12-10 | Paper |
On finding optimal polytrees
Theoretical Computer Science | 2015-10-08 | Paper |
Parameterized Algorithms for Parity Games
Mathematical Foundations of Computer Science 2015 | 2015-09-16 | Paper |
Finite integer index of pathwidth and treewidth
Parameterized and Exact Computation | 2015-09-15 | Paper |
A parameterized study of maximum generalized pattern matching problems
Lecture Notes in Computer Science | 2015-09-15 | Paper |
Faster existential FO model checking on posets
Algorithms and Computation | 2015-09-11 | Paper |
A complete parameterized complexity analysis of bounded planning
Journal of Computer and System Sciences | 2015-07-13 | Paper |
The complexity of repairing, adjusting, and aggregating of extensions in abstract argumentation
Theory and Applications of Formal Argumentation | 2014-03-31 | Paper |
Parameterized Algorithms for Modular-Width
Parameterized and Exact Computation | 2013-12-10 | Paper |
Satisfiability of acyclic and almost acyclic CNF formulas
Theoretical Computer Science | 2013-11-29 | Paper |
Kernelization using structural parameters on sparse graph classes
Lecture Notes in Computer Science | 2013-09-17 | Paper |
Upper and lower bounds for weak backdoor set detection
Theory and Applications of Satisfiability Testing – SAT 2013 | 2013-08-05 | Paper |
Parameterized complexity and kernel bounds for hard planning problems
Lecture Notes in Computer Science | 2013-06-07 | Paper |
Parameterized complexity results for exact Bayesian network structure learning
Journal of Artificial Intelligence Research | 2013-04-09 | Paper |
Augmenting tractable fragments of abstract argumentation
Artificial Intelligence | 2012-11-15 | Paper |
| Satisfiability of acyclic and almost acyclic CNF formulas | 2012-08-29 | Paper |
Algorithms and complexity results for persuasive argumentation
Artificial Intelligence | 2011-11-17 | Paper |
Digraph decompositions and monotonicity in digraph searching
Theoretical Computer Science | 2011-09-12 | Paper |
Satisfiability of acyclic and almost acyclic CNF formulas. II
Theory and Applications of Satisfiability Testing - SAT 2011 | 2011-06-17 | Paper |
Distance \(d\)-domination games
Graph-Theoretic Concepts in Computer Science | 2010-01-21 | Paper |
Digraph Decompositions and Monotonicity in Digraph Searching
Graph-Theoretic Concepts in Computer Science | 2009-01-20 | Paper |
