| Publication | Date of Publication | Type |
|---|
| Complexity framework for forbidden subgraphs III: when problems are tractable on subcubic graphs | 2024-12-03 | Paper |
| Complexity classification transfer for CSPs via algebraic products | 2024-10-21 | Paper |
| Proof complexity and the binary encoding of combinatorial principles | 2024-06-27 | Paper |
| Depth lower bounds in stabbing planes for combinatorial principles | 2024-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147518 | 2024-01-15 | Paper |
| The complexity of \(L(p, q)\)-edge-labelling | 2023-11-17 | Paper |
| Induced disjoint paths and connected subgraphs for \(H\)-free graphs | 2023-09-27 | Paper |
| QCSP on Reflexive Tournaments | 2023-09-20 | Paper |
| Few induced disjoint paths for \(H\)-free graphs | 2023-08-03 | Paper |
| Induced disjoint paths and connected subgraphs for \(H\)-free graphs | 2023-05-05 | Paper |
| Complexity Framework for Forbidden Subgraphs IV: The Steiner Forest Problem | 2023-05-02 | Paper |
| Complexity Framework for Forbidden Subgraphs III: When Problems are Tractable on Subcubic Graphs | 2023-05-01 | Paper |
| QCSP Monsters and the Demise of the Chen Conjecture | 2023-04-27 | Paper |
| Colouring graphs of bounded diameter in the absence of small cycles | 2023-03-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874489 | 2023-02-07 | Paper |
| Complexity Framework for Forbidden Subgraphs II: When Hardness Is Not Preserved under Edge Subdivision | 2022-11-25 | Paper |
| Complexity Framework For Forbidden Subgraphs I: The Framework | 2022-11-23 | Paper |
| Few induced disjoint paths for \(H\)-free graphs | 2022-11-17 | Paper |
| Complexity Classification Transfer for CSPs via Algebraic Products | 2022-11-07 | Paper |
| When bounds consistency implies domain consistency for regular counting constraints | 2022-09-29 | Paper |
| Colouring generalized claw-free graphs and graphs of large girth: bounding the diameter | 2022-09-01 | Paper |
| Partitioning \(H\)-free graphs of bounded diameter | 2022-08-25 | Paper |
| Resolution and the binary encoding of combinatorial principles | 2022-07-27 | Paper |
| Colouring H-free graphs of bounded diameter. | 2022-07-21 | Paper |
| The complexity of \(L(p, q)\)-edge-labelling | 2022-07-13 | Paper |
| Acyclic, star, and injective colouring: bounding the diameter | 2022-06-13 | Paper |
| Acyclic, star, and injective colouring: bounding the diameter | 2022-06-08 | Paper |
| Colouring graphs of bounded diameter in the absence of small cycles | 2022-04-20 | Paper |
| Disjoint paths and connected subgraphs for \(H\)-free graphs | 2022-03-22 | Paper |
| Injective colouring for H-free graphs | 2022-03-21 | Paper |
| Few Induced Disjoint Paths for $H$-Free Graphs | 2022-03-07 | Paper |
| Hard problems that quickly become very easy | 2021-12-14 | Paper |
| Disjoint paths and connected subgraphs for \(H\)-free graphs | 2021-12-01 | Paper |
| Colouring Generalized Claw-Free Graphs and Graphs of Large Girth: Bounding the Diameter | 2021-11-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5005133 | 2021-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5009627 | 2021-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5005107 | 2021-08-04 | Paper |
| Quantified Constraints in Twenty Seventeen | 2021-06-15 | Paper |
| Disjoint Paths and Connected Subgraphs for H-Free Graphs | 2021-05-13 | Paper |
| Partitioning H-Free Graphs of Bounded Diameter | 2021-05-10 | Paper |
| Acyclic, Star, and Injective Colouring: Bounding the Diameter | 2021-04-21 | Paper |
| The complete classification for quantified equality constraints | 2021-04-01 | Paper |
| QCSP monsters and the demise of the chen conjecture | 2021-01-19 | Paper |
| Acyclic, Star and Injective Colouring: A Complexity Picture for H-Free Graphs | 2020-08-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3304148 | 2020-08-05 | Paper |
| Disconnected cuts in claw-free graphs | 2020-06-09 | Paper |
| Surjective H-Colouring over Reflexive Digraphs | 2019-12-16 | Paper |
| Surjective H-colouring: New hardness results | 2019-10-28 | Paper |
| Constraint Satisfaction Problems for Reducts of Homogeneous Graphs | 2019-09-02 | Paper |
| QCSP monsters and the demise of the Chen Conjecture | 2019-06-29 | Paper |
| Discrete Temporal Constraint Satisfaction Problems | 2018-12-06 | Paper |
| On the Complexity of the Model Checking Problem | 2018-07-19 | Paper |
| The complexity of disjunctive linear Diophantine constraints | 2018-07-03 | Paper |
| Disconnected Cuts in Claw-free Graphs | 2018-03-09 | Paper |
| Constraint satisfaction problems for reducts of homogeneous graphs | 2017-12-19 | Paper |
| Circuit satisfiability and constraint satisfaction around Skolem arithmetic | 2017-11-07 | Paper |
| First-Order Queries on Finite Abelian Groups | 2017-08-31 | Paper |
| Surjective \(H\)-colouring: new hardness results | 2017-08-04 | Paper |
| Quantified Constraint Satisfaction Problem on Semicomplete Digraphs | 2017-07-13 | Paper |
| The packing chromatic number of the infinite square lattice is between 13 and 15 | 2017-05-12 | Paper |
| The complexity of counting quantifiers on equality languages | 2017-03-16 | Paper |
| Circuit Satisfiability and Constraint Satisfaction Around Skolem Arithmetic | 2016-08-17 | Paper |
| The Complexity of Counting Quantifiers on Equality Languages | 2016-08-17 | Paper |
| Distance constraint satisfaction problems | 2016-03-10 | Paper |
| Quantified Constraints and Containment Problems | 2015-10-29 | Paper |
| Constraint Satisfaction Problems over the Integers with Successor | 2015-10-27 | Paper |
| The Complexity of Positive First-Order Logic without Equality | 2015-09-17 | Paper |
| Constraint Satisfaction with Counting Quantifiers | 2015-06-18 | Paper |
| The computational complexity of disconnected cut and \(2 K_2\)-partition | 2015-03-05 | Paper |
| QCSP on Semicomplete Digraphs | 2014-07-01 | Paper |
| Constraint Satisfaction with Counting Quantifiers 2 | 2014-06-24 | Paper |
| Relativization makes contradictions harder for resolution | 2013-12-16 | Paper |
| Parameterized Resolution with Bounded Conjunction | 2013-06-14 | Paper |
| QCSP on Partially Reflexive Cycles – The Wavy Line of Tractability | 2013-06-14 | Paper |
| Rank complexity gap for Lovász-Schrijver and Sherali-Adams proof systems | 2013-04-11 | Paper |
| Low-level dichotomy for quantified constraint satisfaction problems | 2013-04-04 | Paper |
| Cutting planes and the parameter cutwidth | 2012-12-07 | Paper |
| Finding vertex-surjective graph homomorphisms | 2012-10-15 | Paper |
| On the scope of the universal-algebraic approach to constraint satisfaction | 2012-09-25 | Paper |
| Parameterized proof complexity | 2012-09-21 | Paper |
| Finding Vertex-Surjective Graph Homomorphisms | 2012-09-10 | Paper |
| Constraint Satisfaction with Counting Quantifiers | 2012-09-10 | Paper |
| The complexity of surjective homomorphism problems-a survey | 2012-08-14 | Paper |
| The limits of tractability in resolution-based propositional proof systems | 2012-03-29 | Paper |
| QCSP on Partially Reflexive Forests | 2011-09-23 | Paper |
| Distance constraint satisfaction problems | 2010-09-03 | Paper |
| The Complexity of Positive First-Order Logic without Equality II: The Four-Element Case | 2010-09-03 | Paper |
| The Limits of Tractability in Resolution-Based Propositional Proof Systems | 2010-07-29 | Paper |
| Cutting Planes and the Parameter Cutwidth | 2010-07-28 | Paper |
| Tight rank lower bounds for the Sherali-Adams proof system | 2009-05-28 | Paper |
| First-Order Model Checking Problems Parameterized by the Model | 2008-06-19 | Paper |
| Hierarchies in Fragments of Monadic Strict NP | 2007-11-13 | Paper |
| Logical Approaches to Computational Barriers | 2007-04-30 | Paper |
