Hardness of 4-Colourings G-Colourable Graphs.
CoRR, April, 2025
A categorical perspective on constraint satisfaction: The wonderland of adjunctions.
CoRR, March, 2025
Hardness of 4-Colouring k-Colourable Graphs.
Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025
A topological proof of the Hell-Nešetřil dichotomy.
Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025
Functors on Relational Structures Which Admit Both Left and Right Adjoints.
SIAM J. Discret. Math., 2024
Hardness of Linearly Ordered 4-Colouring of 3-Colourable 3-Uniform Hypergraphs.
Proceedings of the 41st International Symposium on Theoretical Aspects of Computer Science, 2024
Local consistency as a reduction between constraint satisfaction problems.
Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science, 2024
Right-Adjoints for Datalog Programs.
Proceedings of the 27th International Conference on Database Theory, 2024
Topology and Adjunction in Promise Constraint Satisfaction.
SIAM J. Comput., February, 2023
Right-Adjoints for Datalog Programs, and Homomorphism Dualities over Restricted Classes.
CoRR, 2023
An Invitation to the Promise Constraint Satisfaction Problem.
Electron. Colloquium Comput. Complex., 2022
Algebraic Approach to Promise Constraint Satisfaction.
J. ACM, 2021
ω-categorical structures avoiding height 1 identities.
CoRR, 2020
Robust Algorithms with Polynomial Loss for Near-Unanimity CSPs.
SIAM J. Comput., 2019
The complexity of 3-colouring <i>H</i>-colourable graphs.
Electron. Colloquium Comput. Complex., 2019
Revisiting Alphabet Reduction in Dinur's PCP.
Electron. Colloquium Comput. Complex., 2019
Topology is relevant (in the infinite-domain dichotomy conjecture for constraint satisfaction problems).
CoRR, 2019
Deciding the existence of minority terms.
CoRR, 2019
Algebraic approach to promise constraint satisfaction.
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019
Topology is relevant (in a dichotomy conjecture for infinite-domain constraint satisfaction problems).
Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science, 2019
The Complexity of 3-Colouring H-Colourable Graphs.
Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019
Taylor's Modularity Conjecture and Related Problems for Idempotent Varieties.
Order, 2018
Complexity of term representations of finitary functions.
Int. J. Algebra Comput., 2018
The wonderland of reflections.
CoRR, 2015
Proceedings of the Mathematical Foundations of Computer Science 2014, 2014