| Publication | Date of Publication | Type |
|---|
| Point-width and max-CSPs | 2024-12-19 | Paper |
| CLAP: a new algorithm for promise CSPs | 2024-07-19 | Paper |
| Linearly ordered colourings of hypergraphs | 2024-06-24 | Paper |
| Approximate graph colouring and the hollow shadow | 2024-05-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147278 | 2024-01-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147392 | 2024-01-15 | Paper |
| PTAS for Sparse General-valued CSPs | 2023-10-23 | Paper |
| Additive Sparsification of CSPs. | 2023-09-20 | Paper |
| QCSP on Reflexive Tournaments | 2023-09-20 | Paper |
| Point-Width and Max-CSPs | 2023-04-26 | Paper |
| CLAP: A New Algorithm for Promise CSPs | 2023-04-04 | Paper |
| Topology and Adjunction in Promise Constraint Satisfaction | 2023-04-04 | Paper |
| Beyond PCSP (\textbf{1-in-3}, \textbf{NAE}) | 2022-12-08 | Paper |
| The Complexity of Approximately Counting Retractions | 2022-12-05 | Paper |
| Approximate Counting CSP Seen from the Other Side | 2022-12-05 | Paper |
| Approximate Graph Colouring and Crystals | 2022-10-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5092423 | 2022-07-21 | Paper |
| Sparsification of Binary CSPs | 2022-07-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5089260 | 2022-07-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5090503 | 2022-07-18 | Paper |
| Hierarchies of Minion Tests for PCSPs through Tensors | 2022-07-05 | Paper |
| Linearly ordered colourings of hypergraphs | 2022-04-12 | Paper |
| The Complexity of Promise SAT on Non-Boolean Domains | 2022-03-29 | Paper |
| The Combined Basic LP and Affine IP Relaxation for Promise VCSPs on Infinite Domains | 2022-02-16 | Paper |
| The Complexity of Approximately Counting Retractions to Square-free Graphs | 2022-02-16 | Paper |
| The Complexity of General-Valued Constraint Satisfaction Problems Seen from the Other Side | 2022-02-08 | Paper |
| Counting Homomorphisms to $K_4$-Minor-Free Graphs, Modulo 2 | 2021-12-01 | Paper |
| On rainbow-free colourings of uniform hypergraphs | 2021-09-06 | Paper |
| Galois connections for patterns: an algebra of labelled graphs | 2021-08-04 | Paper |
| The Complexity of Valued CSPs | 2021-06-15 | Paper |
| Hybrid Tractable Classes of Constraint Problems | 2021-06-15 | Paper |
| On rainbow-free colourings of uniform hypergraphs | 2021-06-13 | Paper |
| Improved hardness for H-colourings of G-colourable graphs | 2021-02-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5144633 | 2021-01-19 | Paper |
| The Power of the Combined Basic Linear Programming and Affine Relaxation for Promise Constraint Satisfaction Problems | 2020-12-04 | Paper |
| Using a Min-Cut generalisation to go beyond Boolean surjective VCSPs | 2020-11-11 | Paper |
| On Singleton Arc Consistency for CSPs Defined by Monotone Patterns | 2020-08-05 | Paper |
| Beyond JWP: A Tractable Class of Binary VCSPs via M-Convex Intersection. | 2020-08-05 | Paper |
| The Complexity of Boolean Surjective General-Valued CSPs | 2020-05-26 | Paper |
| Sparsification of Binary CSPs | 2020-03-26 | Paper |
| Topology and adjunction in promise constraint satisfaction | 2020-03-25 | Paper |
| Boolean approximate counting CSPs with weak conservativity, and implications for ferromagnetic two-spin | 2020-02-24 | Paper |
| The Complexity of Boolean Surjective General-Valued CSPs | 2019-12-16 | Paper |
| A Galois Connection for Weighted (Relational) Clones of Infinite Size | 2019-12-06 | Paper |
| The Limits of SDP Relaxations for General-Valued CSPs | 2019-12-06 | Paper |
| A Tractable Class of Binary VCSPs via M-Convex Intersection | 2019-11-25 | Paper |
| The Complexity of Approximately Counting Retractions | 2019-10-15 | Paper |
| The Complexity of Counting Surjective Homomorphisms and Compactions | 2019-08-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4967163 | 2019-07-03 | Paper |
| Maximizing Bisubmodular and k-Submodular Functions | 2019-06-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743434 | 2019-05-10 | Paper |
| On singleton arc consistency for CSPs defined by monotone patterns | 2019-04-25 | Paper |
| Binary constraint satisfaction problems defined by excluded topological minors | 2018-12-21 | Paper |
| Maximizing k -Submodular Functions and Beyond | 2018-11-05 | Paper |
| Discrete convexity in joint winner property | 2018-08-17 | Paper |
| The Complexity of Finite-Valued CSPs | 2018-08-02 | Paper |
| The Power of Arc Consistency for CSPs Defined by Partially-Ordered Forbidden Patterns | 2018-04-23 | Paper |
| On Planar Valued CSPs | 2018-03-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4608005 | 2018-03-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4600768 | 2018-01-12 | Paper |
| The Power of Sherali--Adams Relaxations for General-Valued CSPs | 2017-08-16 | Paper |
| Functional clones and expressibility of partition functions | 2017-06-13 | Paper |
| On planar valued CSPs | 2017-05-24 | Paper |
| Backdoors into heterogeneous classes of SAT and CSP | 2016-12-28 | Paper |
| Necessary Conditions for Tractability of Valued CSPs | 2015-12-04 | Paper |
| A Galois Connection for Valued Constraint Languages of Infinite Size | 2015-10-27 | Paper |
| Sherali-Adams Relaxations for Valued CSPs | 2015-10-27 | Paper |
| Variable and value elimination in binary constraint satisfaction via forbidden patterns | 2015-07-13 | Paper |
| The Power of Linear Programming for General-Valued CSPs | 2015-06-02 | Paper |
| The Complexity of Finite-Valued CSPs | 2014-08-07 | Paper |
| The complexity of conservative valued CSPs | 2014-02-17 | Paper |
| An Algebraic Theory of Complexity for Discrete Optimization | 2014-02-04 | Paper |
| The Complexity of Valued Constraint Satisfaction Problems | 2013-03-20 | Paper |
| Tractable triangles and cross-free convexity in discrete optimisation | 2012-08-27 | Paper |
| Hybrid tractability of valued constraint problems | 2011-11-17 | Paper |
| An Algebraic Theory of Complexity for Valued Constraints: Establishing a Galois Connection | 2011-08-17 | Paper |
| Classes of submodular constraints expressible by graph cuts | 2010-11-19 | Paper |
| Structural properties of oracle classes | 2010-09-01 | Paper |
| A note on some collapse results of valued constraints | 2010-08-16 | Paper |
| The expressive power of binary submodular functions | 2010-04-28 | Paper |
| The Expressive Power of Binary Submodular Functions | 2009-10-16 | Paper |
| The expressive power of valued constraints: Hierarchies and collapses | 2008-12-12 | Paper |
| The Expressive Power of Valued Constraints: Hierarchies and Collapses | 2008-09-02 | Paper |
| Pliability and Approximating Max-CSPs | N/A | Paper |
| A logarithmic approximation of linearly-ordered colourings | N/A | Paper |
