| Publication | Date of Publication | Type |
|---|
New perspectives on semiring applications to dynamic programming
Discrete Applied Mathematics | 2026-02-24 | Paper |
General lower bounds and improved algorithms for infinite-domain CSPs
Algorithmica | 2023-04-21 | Paper |
Computational Short Cuts in Infinite Domain Constraint Satisfaction
Journal of Artificial Intelligence Research | 2023-01-09 | Paper |
Sparsification of SAT and CSP Problems via Tractable Extensions
ACM Transactions on Computation Theory | 2022-12-05 | Paper |
The (Coarse) Fine-Grained Structure of NP-Hard SAT and CSP Problems
ACM Transactions on Computation Theory | 2022-09-24 | Paper |
scientific article; zbMATH DE number 7561680 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-21 | Paper |
| C-maximal strong partial clones and the inclusion structure of Boolean weak bases | 2022-06-03 | Paper |
| scientific article; zbMATH DE number 7536562 (Why is no real title available?) | 2022-06-03 | Paper |
Fine-grained time complexity of constraint satisfaction problems
ACM Transactions on Computation Theory | 2022-03-14 | Paper |
Acyclic orders, partition schemes and CSPs: unified hardness proofs and improved algorithms
Artificial Intelligence | 2021-11-02 | Paper |
| Why are CSPs based on partition schemes computationally hard? | 2021-08-04 | Paper |
Complexity of inverse constraint problems and a dichotomy for the inverse satisfiability problem
Journal of Computer and System Sciences | 2021-02-02 | Paper |
| A dichotomy theorem for the inverse satisfiability problem | 2020-11-25 | Paper |
Time complexity of constraint satisfaction via universal algebra
(available as arXiv preprint) | 2020-05-26 | Paper |
On the Strength of Uniqueness Quantification in Primitive Positive Formulas
(available as arXiv preprint) | 2019-06-17 | Paper |
Complexity of SAT Problems, Clone Theory and the Exponential Time Hypothesis
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
| A preliminary investigation of satisfiability problems not harder than 1-in-3-SAT | 2018-03-21 | Paper |
The power of primitive positive definitions with polynomially many variables
Journal Of Logic And Computation | 2018-02-13 | Paper |
An initial study of time complexity in infinite-domain constraint satisfaction
Artificial Intelligence | 2017-02-28 | Paper |
Strong partial clones and the time complexity of SAT problems
Journal of Computer and System Sciences | 2016-11-14 | Paper |
Precise upper and lower bounds for the monotone constraint satisfaction problem
Mathematical Foundations of Computer Science 2015 | 2015-09-16 | Paper |
Constructing NP-intermediate problems by blowing holes with parameters of various properties
Theoretical Computer Science | 2015-05-22 | Paper |
Relating the Time Complexity of Optimization Problems in Light of the Exponential-Time Hypothesis
Mathematical Foundations of Computer Science 2014 | 2014-10-14 | Paper |
Weak bases of Boolean co-clones
Information Processing Letters | 2014-05-05 | Paper |
The Fine-Grained Complexity of Graph Homomorphism Problems: Towards the Okrasa and Rz\k{a}\.zewski Conjecture
(available as arXiv preprint) | N/A | Paper |
