| Publication | Date of Publication | Type |
|---|
| Edge multiway cut and node multiway cut are hard for planar subcubic graphs | 2025-12-02 | Paper |
| 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
SIAM Journal on Computing | 2024-10-21 | Paper |
Proof complexity and the binary encoding of combinatorial principles
SIAM Journal on Computing | 2024-06-27 | Paper |
| Depth lower bounds in stabbing planes for combinatorial principles | 2024-04-23 | Paper |
| scientific article; zbMATH DE number 7788594 (Why is no real title available?) | 2024-01-15 | Paper |
The complexity of \(L(p, q)\)-edge-labelling
Algorithmica | 2023-11-17 | Paper |
Induced disjoint paths and connected subgraphs for \(H\)-free graphs
Algorithmica | 2023-09-27 | Paper |
QCSP on Reflexive Tournaments
(available as arXiv preprint) | 2023-09-20 | Paper |
Few induced disjoint paths for \(H\)-free graphs
Lecture Notes in Computer Science | 2023-08-03 | Paper |
Induced disjoint paths and connected subgraphs for \(H\)-free graphs
Graph-Theoretic Concepts in Computer Science | 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
Journal of the ACM | 2023-04-27 | Paper |
Colouring graphs of bounded diameter in the absence of small cycles
Lecture Notes in Computer Science | 2023-03-22 | Paper |
scientific article; zbMATH DE number 7651161 (Why is no real title available?)
(available as arXiv preprint) | 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
Theoretical Computer Science | 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
Constraints | 2022-09-29 | Paper |
Colouring generalized claw-free graphs and graphs of large girth: bounding the diameter
Theoretical Computer Science | 2022-09-01 | Paper |
Partitioning \(H\)-free graphs of bounded diameter
Theoretical Computer Science | 2022-08-25 | Paper |
Resolution and the binary encoding of combinatorial principles
(available as arXiv preprint) | 2022-07-27 | Paper |
| Colouring H-free graphs of bounded diameter. | 2022-07-21 | Paper |
The complexity of \(L(p, q)\)-edge-labelling
(available as arXiv preprint) | 2022-07-13 | Paper |
Acyclic, star, and injective colouring: bounding the diameter
The Electronic Journal of Combinatorics | 2022-06-13 | Paper |
Acyclic, star, and injective colouring: bounding the diameter
Graph-Theoretic Concepts in Computer Science | 2022-06-08 | Paper |
Colouring graphs of bounded diameter in the absence of small cycles
Discrete Applied Mathematics | 2022-04-20 | Paper |
Disjoint paths and connected subgraphs for \(H\)-free graphs
Lecture Notes in Computer Science | 2022-03-22 | Paper |
| Injective colouring for H-free graphs | 2022-03-21 | Paper |
Few Induced Disjoint Paths for $H$-Free Graphs
(available as arXiv preprint) | 2022-03-07 | Paper |
Hard problems that quickly become very easy
Information Processing Letters | 2021-12-14 | Paper |
Disjoint paths and connected subgraphs for \(H\)-free graphs
Theoretical Computer Science | 2021-12-01 | Paper |
Colouring Generalized Claw-Free Graphs and Graphs of Large Girth: Bounding the Diameter
(available as arXiv preprint) | 2021-11-23 | Paper |
scientific article; zbMATH DE number 7378350 (Why is no real title available?)
(available as arXiv preprint) | 2021-08-04 | Paper |
Disconnected cuts in claw-free graphs
(available as arXiv preprint) | 2021-08-04 | Paper |
| Consistency for counting quantifiers | 2021-08-04 | Paper |
| Quantified Constraints in Twenty Seventeen | 2021-06-15 | Paper |
Disjoint Paths and Connected Subgraphs for H-Free Graphs
(available as arXiv preprint) | 2021-05-13 | Paper |
Partitioning H-Free Graphs of Bounded Diameter
(available as arXiv preprint) | 2021-05-10 | Paper |
Acyclic, Star, and Injective Colouring: Bounding the Diameter
(available as arXiv preprint) | 2021-04-21 | Paper |
| The complete classification for quantified equality constraints | 2021-04-01 | Paper |
QCSP monsters and the demise of the chen conjecture
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 2021-01-19 | Paper |
QCSP monsters and the demise of the chen conjecture
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 2021-01-19 | Paper |
Acyclic, Star and Injective Colouring: A Complexity Picture for H-Free Graphs
(available as arXiv preprint) | 2020-08-21 | Paper |
| Surjective \texttt{H}-colouring over reflexive digraphs | 2020-08-05 | Paper |
Disconnected cuts in claw-free graphs
Journal of Computer and System Sciences | 2020-06-09 | Paper |
Surjective H-Colouring over Reflexive Digraphs
ACM Transactions on Computation Theory | 2019-12-16 | Paper |
Surjective H-Colouring over Reflexive Digraphs
ACM Transactions on Computation Theory | 2019-12-16 | Paper |
Surjective \(H\)-colouring: new hardness results
Computability | 2019-10-28 | Paper |
Constraint satisfaction problems for reducts of homogeneous graphs
SIAM Journal on Computing | 2019-09-02 | Paper |
QCSP monsters and the demise of the Chen Conjecture
(available as arXiv preprint) | 2019-06-29 | Paper |
Discrete temporal constraint satisfaction problems
Journal of the ACM | 2018-12-06 | Paper |
On the complexity of the model checking problem
SIAM Journal on Computing | 2018-07-19 | Paper |
On the complexity of the model checking problem
SIAM Journal on Computing | 2018-07-19 | Paper |
The complexity of disjunctive linear Diophantine constraints
(available as arXiv preprint) | 2018-07-03 | Paper |
Disconnected Cuts in Claw-free Graphs
(available as arXiv preprint) | 2018-03-09 | Paper |
Constraint satisfaction problems for reducts of homogeneous graphs
(available as arXiv preprint) | 2017-12-19 | Paper |
Circuit satisfiability and constraint satisfaction around Skolem arithmetic
Theoretical Computer Science | 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 |
Surjective \(H\)-colouring: new hardness results
(available as arXiv preprint) | 2017-08-04 | Paper |
Quantified constraint satisfaction problem on semicomplete digraphs
ACM Transactions on Computational Logic | 2017-07-13 | Paper |
The packing chromatic number of the infinite square lattice is between 13 and 15
Discrete Applied Mathematics | 2017-05-12 | Paper |
The packing chromatic number of the infinite square lattice is between 13 and 15
Discrete Applied Mathematics | 2017-05-12 | Paper |
The complexity of counting quantifiers on equality languages
Theoretical Computer Science | 2017-03-16 | Paper |
Circuit satisfiability and constraint satisfaction around Skolem arithmetic
Pursuit of the Universal | 2016-08-17 | Paper |
The Complexity of Counting Quantifiers on Equality Languages
Pursuit of the Universal | 2016-08-17 | Paper |
Distance constraint satisfaction problems
Information and Computation | 2016-03-10 | Paper |
Quantified Constraints and Containment Problems
Logical Methods in Computer Science | 2015-10-29 | Paper |
Constraint satisfaction problems over the integers with successor
Automata, Languages, and Programming | 2015-10-27 | Paper |
Constraint satisfaction problems over the integers with successor
Automata, Languages, and Programming | 2015-10-27 | Paper |
The complexity of positive first-order logic without equality
ACM Transactions on Computational Logic | 2015-09-17 | Paper |
Constraint satisfaction with counting quantifiers
SIAM Journal on Discrete Mathematics | 2015-06-18 | Paper |
The computational complexity of disconnected cut and \(2 K_2\)-partition
Journal of Combinatorial Theory. Series B | 2015-03-05 | Paper |
QCSP on semicomplete digraphs
Automata, Languages, and Programming | 2014-07-01 | Paper |
Constraint satisfaction with counting quantifiers. II
Computer Science - Theory and Applications | 2014-06-24 | Paper |
Relativization makes contradictions harder for resolution
Annals of Pure and Applied Logic | 2013-12-16 | Paper |
Parameterized resolution with bounded conjunction
Computer Science – Theory and Applications | 2013-06-14 | Paper |
QCSP on partially reflexive cycles -- the wavy line of tractability
Computer Science – Theory and Applications | 2013-06-14 | Paper |
Rank complexity gap for Lovász-Schrijver and Sherali-Adams proof systems
Computational Complexity | 2013-04-11 | Paper |
Low-level dichotomy for quantified constraint satisfaction problems
Information Processing Letters | 2013-04-04 | Paper |
Cutting planes and the parameter cutwidth
Theory of Computing Systems | 2012-12-07 | Paper |
Finding vertex-surjective graph homomorphisms
Acta Informatica | 2012-10-15 | Paper |
On the scope of the universal-algebraic approach to constraint satisfaction
Logical Methods in Computer Science | 2012-09-25 | Paper |
Parameterized proof complexity
Computational Complexity | 2012-09-21 | Paper |
Finding vertex-surjective graph homomorphisms
Computer Science – Theory and Applications | 2012-09-10 | Paper |
Finding vertex-surjective graph homomorphisms
Computer Science – Theory and Applications | 2012-09-10 | Paper |
Constraint satisfaction with counting quantifiers
Computer Science – Theory and Applications | 2012-09-10 | Paper |
Constraint satisfaction with counting quantifiers
Computer Science – Theory and Applications | 2012-09-10 | Paper |
The complexity of surjective homomorphism problems-a survey
Discrete Applied Mathematics | 2012-08-14 | Paper |
The limits of tractability in resolution-based propositional proof systems
Annals of Pure and Applied Logic | 2012-03-29 | Paper |
QCSP on partially reflexive forests
Principles and Practice of Constraint Programming – CP 2011 | 2011-09-23 | Paper |
The complexity of positive first-order logic without equality. II: The four-element case
Computer Science Logic | 2010-09-03 | Paper |
Distance constraint satisfaction problems
Lecture Notes in Computer Science | 2010-09-03 | Paper |
The limits of tractability in resolution-based propositional proof systems
Programs, Proofs, Processes | 2010-07-29 | Paper |
Cutting planes and the parameter cutwidth
Mathematical Theory and Computational Practice | 2010-07-28 | Paper |
Tight rank lower bounds for the Sherali-Adams proof system
Theoretical Computer Science | 2009-05-28 | Paper |
First-Order Model Checking Problems Parameterized by the Model
Logic and Theory of Algorithms | 2008-06-19 | Paper |
Hierarchies in Fragments of Monadic Strict NP
Lecture Notes in Computer Science | 2007-11-13 | Paper |
Logical Approaches to Computational Barriers
Lecture Notes in Computer Science | 2007-04-30 | Paper |
