, Non-dichotomies in Constraint Satisfaction Complexity, Proceedings of the 35th International Colloquium on Automata, Languages and Programming (ICALP-2008), pp.184-196, 2008.
DOI : 10.1007/978-3-540-70583-3_16
, Essential Convexity and Complexity of Semi-Algebraic Constraints, Logical Methods in Computer Science, vol.8, issue.4, p.2012
DOI : 10.2168/LMCS-8(4:5)2012
URL : https://hal.archives-ouvertes.fr/hal-00756926
, Horn versus full first-order: Complexity dichotomies in algebraic constraint satisfaction, Journal of Logic and Computation, vol.22, issue.3, pp.643-660, 2012.
DOI : 10.1145/321864.321877
URL : https://hal.archives-ouvertes.fr/hal-00756925
, The complexity of temporal constraint satisfaction problems, J. ACM, vol.57, issue.2, p.2010
, A dichotomy theorem for constraint satisfaction problems on a 3-element set, Journal of the ACM, vol.53, issue.1, pp.66-120, 2006.
DOI : 10.1145/1120582.1120584
, Classifying the Complexity of Constraints Using Finite Algebras, SIAM Journal on Computing, vol.34, issue.3, pp.720-742, 2005.
DOI : 10.1137/S0097539700376676
, Monotone monadic SNP and constraint satisfaction, Proceedings of the twenty-fifth annual ACM symposium on Theory of computing , STOC '93, pp.612-622, 1993.
DOI : 10.1145/167088.167245
, Colouring, constraint satisfaction, and complexity, Computer Science Review, vol.2, issue.3, pp.143-163, 2008.
DOI : 10.1016/j.cosrev.2008.10.003
URL : http://kam.mff.cuni.cz/~kamserie/serie/clanky/2008/s892.pdf
, Computational complexity of linear constraints over the integers, Artificial Intelligence, vol.195, pp.44-62, 2013.
DOI : 10.1016/j.artint.2012.10.001
, The complexity of satisfiability problems, Proceedings of the tenth annual ACM symposium on Theory of computing , STOC '78, pp.216-226, 1978.
DOI : 10.1145/800133.804350
, Theory of linear and integer programming, 1986.