** Preprints **

[P] Boolean approximate counting CSPs with weak conservativity, and implications for ferromagnetic two-spin [arXiv]

[P] A tractable class of binary VCSPs via M-convex intersection [arXiv]

[P] On singleton arc consistency for CSPs defined by monotone patterns [arXiv]

[P] The complexity of counting surjective homomorphisms and compactions [arXiv]

[P] The complexity of general-valued CSPs seen from the other side [arXiv]

[P] The complexity of Boolean surjective general-valued CSPs [arXiv]

[P] Binary constraint satisfaction problems defined by excluded topological minors [arXiv]

** Books **

[B2]
* The Constraint Satisfaction Problem: Complexity and Approximability*
[©]

[B1]
* The complexity of valued constraint satisfaction problems*
[©|errata]

** Refereed Journals **

[J23] The limits of SDP relaxations for general-valued CSPs [pdf|©]

**ACM ToCT**, 10(3), Article No. 12, 2018.

[J22] Discrete convexity in joint winner property [pdf|©]

**DO**28, pp. 78-88, 2018.

[J21] The power of arc consistency for CSPs defined by partially-ordered forbidden patterns [pdf|©]

**LMCS**13(4:26), pp. 1-32, 2017.

[J20] Binarisation for valued constraint satisfaction problems [pdf|©]

**SIDMA**31(4), pp. 2279-2300, 2017.

[J19] The power of Sherali-Adams relaxations for general-valued CSPs [pdf|©]

**SICOMP**46(4), pp. 1241-1279, 2017.

[J18] Functional clones and expressibility of partition functions [pdf|©]

**TCS**687, pp. 11-39, 2017.

[J17] On planar valued CSPs [pdf|©]

**JCSS**87, pp. 104-118, 2017.

[J16] Backdoors into heterogeneous classes of SAT and CSP [pdf|©]

**JCSS**85, pp. 38-56, 2017.

[J15] The complexity of finite-valued CSPs [pdf|©]

**JACM**63(4), Article No. 37, 2016.

[J14]
Maximizing *k*-submodular functions and beyond
[pdf|©]

**ACM TALG**12(4), Article No. 47, 2016.

[J13] A Galois connection for weighted (relational) clones of infinite size [pdf|©]

**ACM ToCT**8(3), Article No. 9, 2016.

[J12] Necessary conditions for tractability of valued CSPs [pdf|©]

**SIDMA**29(4), pp. 2361-2384, 2015.

[J11] Variable and value elimination in binary constraint satisfaction via forbidden patterns [pdf|©]

**JCSS**81(7), pp. 1127-1143, 2015.

[J10] The power of linear programming for general-valued CSPs [pdf|©]

**SICOMP**44(1), pp. 1-36, 2015.

[J9] An algebraic theory of complexity for discrete optimisation [pdf|©]

**SICOMP**42(5), pp. 1915-1939, 2013.

[J8] The complexity of conservative valued CSPs [pdf|©]

**JACM**60(2), Article No. 10, 2013.

[J7] Tractable triangles and cross-free convexity in discrete optimisation [pdf|©]

**JAIR**44, pp. 455-490, 2012.

[J6] Hybrid tractability of valued constraint problems [pdf|©]

**AIJ**175(9-10), pp. 1555-1569, 2011.

[J5] Classes of submodular constraints expressible by graph cuts [pdf|©]

**Constraints**15(3), pp. 430-452, 2010.

[J4] The expressive power of binary submodular functions [pdf|©]

**DAM**157(15), pp. 3347-3358, 2009.

[J3] Structural properties of oracle classes [pdf|©]

**IPL**109(19), pp. 1131-1135, 2009.

[J2] A note on some collapse results of valued constraints [pdf|©]

**IPL**109(11), pp. 534-538, 2009.

[J1] The expressive power of valued constraints: Hierarchies and collapses [pdf|©]

**TCS**409(1), pp. 137-153, 2008.

** Refereed Conference Proceedings **

[C31] Beyond JWP: A tractable class of binary VCSPs via M-convex intersection [pdf|©]

**STACS'18**, pp. 39:1-39:14, 2018.

[C30] On singleton arc consistency for CSPs defined by monotone patterns [pdf|©]

**STACS'18**, pp. 19:1-19:15, 2018.

[C29] The complexity of counting surjective homomorphisms and compactions [pdf|©]

**SODA'18**, pp. 1772-1781, 2018.

[C28] The complexity of Boolean surjective general-valued CSPs [pdf|©]

**MFCS'17**, pp. 4:1-4:14, 2017.

[C27] The limits of SDP relaxations for general-valued CSPs [pdf|©]

**LICS’17**, pp. 1-12, 2017. (superseded by J23)

[C26] On planar valued CSPs [pdf|©]

**MFCS'16**, pp. 39:1-39:14, 2016. (superseded by J17)

[C25] The power of arc consistency for CSPs defined by partially-ordered forbidden patterns [pdf|©]

**LICS’16**, pp. 652-661, 2016. (superseded by J21)

[C24] Minimal weighted clones with Boolean support [pdf|©]

**ISMVL’16**, pp. 90-95, 2016.

[C23] Sherali-Adams relaxations for valued CSPs [pdf|©]

**ICALP’15**, LNCS 9134, pp. 1058-1069, 2015. (superseded by J19)

[C22] A Galois connection for valued constraint languages of infinite size [pdf|©]

**ICALP’15**, LNCS 9134, pp. 517-528, 2015. (superseded by J13)

[C21] Tractable classes of binary CSPs defined by excluded topological minors [pdf|©]

**IJCAI'15**, pp. 1945-1951, 2015.

[C20] Binarisation via dualisation for valued constraints [pdf|©]

**AAAI'15**, pp. 3731-3737, 2015. (superseded by J20)

[C19] Backdoors into heterogeneous classes of SAT and CSP [pdf|©]

**AAAI'14**, pp. 2652-2658, 2014. (superseded by J16)

[C18]
Maximizing bisubmodular and *k*-submodular functions
[pdf|©]

**SODA'14**, pp. 1468-1481, 2014. (superseded by J14)

[C17] Tractable combinations of global constraints [pdf|©]

**CP'13**, LNCS 8124, pp. 230-246, 2013.

[C16] Variable elimination in binary CSP via forbidden patterns [pdf|©]

**IJCAI'13**, pp. 517-523, 2013. (superseded by J11)

[C15] The complexity of finite-valued CSPs [pdf|©]

**STOC'13**, pp. 695-704, 2013. (superseded by J15)

[C14] The power of linear programming for valued CSPs [pdf|©]

**FOCS'12**, pp. 669-678, 2012. (superseded by J10)

[C13] A characterisation of the complexity of forbidding subproblems in binary Max-CSP [pdf|©]

**CP'12**, LNCS 7514, pp. 265-273, 2012.

[C12] Relating proof complexity measures and practical hardness of SAT [pdf|©]

**CP'12**, LNCS 7514, pp. 316-331, 2012.

[C11] The complexity of conservative valued CSPs [pdf|©]

**SODA'12**, pp. 750-759, 2012. (superseded by J8)

[C10] On minimal weighted clones [pdf|©]

**CP'11**, LNCS 6876, pp. 210-224, 2011. (superseded by J9)

[C9] Tractable triangles [pdf|©]

**CP'11**, LNCS 6876, pp. 195-209, 2011. (superseded by J7)

[C8] Hierarchically nested convex VCSP [pdf|©]

**CP'11**, LNCS 6876, pp. 187-194, 2011. (superseded by J7)

[C7] An algebraic theory of complexity for valued constraints: Establishing a Galois connection [pdf|©]

**MFCS'11**, LNCS 6907, pp. 231-242, 2011. (superseded by J9)

[C6] A new hybrid tractable class of soft constraint problems [pdf|©]

**CP'10**, LNCS 6308, pp. 152-166, 2010. (superseded by J6)

[C5] Same-relation constraints [pdf|©]

**CP'09**, LNCS 5732, pp. 470-485, 2009.

[C4] The complexity of valued constraint models [pdf|©]

**CP'09**, LNCS 5732, pp. 833-841, 2009.

[C3] The expressive power of binary submodular functions [pdf|©]

**MFCS'09**, LNCS 5734, pp . 744-757, 2009. (superseded by J4)

[C2] Classes of submodular constraints expressible by graph cuts [pdf|©]

**CP'08**, LNCS 5202, pp. 112-127, 2008. (superseded by J5)

[C1] The expressive power of valued constraints: Hierarchies and collapses [pdf|©]

**CP'07**, LNCS 4741, pp. 798-805, 2007. (superseded by J1)

** Book Chapters **

[BC5] Hybrid tractable classes of constraint problems [pdf|©]

[BC4] The complexity of valued CSPs [pdf|©]

[BC3] The complexity of valued constraint satisfaction [pdf|©|errata]

*Bulletin of EATCS*, Number 113, 21-55, 2014. (superseded by BC4)

[BC2] The power of LP relaxaion for MAP inference [pdf|©]

*Advanced Structured Prediction*, S. Nowozin, P. Gehler, J. Jancsary, and C. Lampert (editors), MIT Press, 2014. (apart from Section 1.4 superseded by BC4)

[BC1] Tractable valued constraints [pdf|©]

*Tractability: Practical Approaches to Hard Problemss*, L. Bordeaux, Y. Hamadi, and P. Kohli (editors), Cambridge University Press, 2014. (superseded by BC4)

** Theses **

[T3] The complexity and expressive power of valued constraints [pdf|©]

**ACP (Association for Constraint Programming) Doctoral Research Award 2011**.

[T2] Properties of oracle classes that collapse or separate complexity classes

[T1] Relation between accepting languages and complexity of questions on oracle

** Miscellaneous **

[M3] Proceedings of the Doctoral Programme of the 18th CP [link]

[M2] Proceedings of the Doctoral Programme of the 16th CP [link]

[M1] Proceedings of the Student CS Conference, University of Oxford [link]

** Co-Authors **