[ACM|DBLP|Google Scholar]

 Preprints 

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

(with C. Carbonnel and M. Romero), 2017.

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

(with J. Focke and L. Goldberg), full version of C29, submitted for publication, 2017.

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

(with P. Fulla and H. Uppman), full version of C28, submitted for publication, 2017.

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

(with C. Carbonnel, D. Cohen, and M. Cooper), submitted for publication, 2017.

[P] Discrete convexity in joint winner property [arXiv]

(with Y. Iwamasa and K. Murota), submitted for publication, 2017.

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

(with D. Cohen, M. Cooper, and P. Jeavons), full version of C21, submitted for publication, 2016.

 Books 

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

(with A. Krokhin), Dagstuhl Follow-Ups Series, Volume 7, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, ISBN 978-3-95977-003-3, 2017.

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

(single author), Springer, ISBN 978-3-642-33973-8, 2012.

 Refereed Journals 

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

(with M. Cooper), LMCS.

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

(with D. Cohen, M. Cooper, P. Jeavons, A. Krokhin, and R. Powell), SIDMA 31(4), pp. 2279-2300, 2017.

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

(with J. Thapper), SICOMP 46(4), pp. 1241-1279, 2017.

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

(with A. Bulatov, L. Goldberg, M. Jerrum, and D. Richerby), TCS 687, pp. 11-39, 2017.

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

(with P. Fulla), JCSS 87, pp. 104-118, 2017.

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

(with S. Gaspers, N. Misra, S. Ordyniak, and S. Szeider), JCSS 85, pp. 38-56, 2017.

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

(with J. Thapper), JACM 63(4), Article No. 37, 2016.

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

(with J. Ward), ACM TALG 12(4), Article No. 47, 2016.

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

(with P. Fulla), ACM ToCT 8(3), Article No. 9, 2016.

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

(with J. Thapper), SIDMA 29(4), pp. 2361-2384, 2015.

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

(with D. Cohen, M. Cooper, and G. Escamocher), JCSS 81(7), pp. 1127-1143, 2015.

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

(with V. Kolmogorov and J. Thapper), SICOMP 44(1), pp. 1-36, 2015.

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

(with D. Cohen, M. Cooper, P. Creed, and P. Jeavons), SICOMP 42(5), pp. 1915-1939, 2013.

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

(with V. Kolmogorov), JACM 60(2), Article No. 10, 2013.

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

(with M. Cooper), JAIR 44, pp. 455-490, 2012.

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

(with M. Cooper), AIJ 175(9-10), pp. 1555-1569, 2011.

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

(with P. Jeavons), Constraints 15(3), pp. 430-452, 2010.

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

(with D. Cohen and P. Jeavons), DAM 157(15), pp. 3347-3358, 2009.

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

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

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

(with B. Zanuttini), IPL 109(11), pp. 534-538, 2009.

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

(with D. Cohen and P. Jeavons), TCS 409(1), pp. 137-153, 2008.

 Refereed Conference Proceedings 

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

(with J. Focke and L. Goldberg), SODA'18, 2018.

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

(with P. Fulla), MFCS'17, 2017.

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

(with J. Thapper), LICS’17, pp. 1-12, 2017.

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

(with P. Fulla), 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|©]

(with M. Cooper), LICS’16, pp. 652-661, 2016. (superseded by J21)

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

(with P. Jeavons and A. Vaicenavičius), ISMVL’16, pp. 90-95, 2016.

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

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

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

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

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

(with D. Cohen, M. Cooper, and P. Jeavons), IJCAI'15, pp. 1945-1951, 2015.

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

(with D. Cohen, M. Cooper, and P. Jeavons), AAAI'15, pp. 3731-3737, 2015. (superseded by J20)

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

(with S. Gaspers, M. Neeldhara, S. Ordyniak, and S. Szeider), AAAI'14, pp. 2652-2658, 2014. (superseded by J16)

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

(with J. Ward), SODA'14, pp. 1468-1481, 2014. (superseded by J14)

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

(with D. Cohen, P. Jeavons, and E. Thorstensen), CP'13, LNCS 8124, pp. 230-246, 2013.

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

(with D. Cohen, M. Cooper, and G. Escamocher), IJCAI'13, pp. 517-523, 2013. (superseded by J11)

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

(with J. Thapper), STOC'13, pp. 695-704, 2013. (superseded by J15)

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

(with J. Thapper), FOCS'12, pp. 669-678, 2012. (superseded by J10)

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

(with M. Cooper and G. Escamocher), CP'12, LNCS 7514, pp. 265-273, 2012.

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

(with M. Järvisalo, A. Matsliah, and J. Nordström), CP'12, LNCS 7514, pp. 316-331, 2012.

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

(with V. Kolmogorov), SODA'12, pp. 750-759, 2012. (superseded by J8)

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

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

[C9] Tractable triangles [pdf|©]

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

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

(with M. Cooper), 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|©]

(with D. Cohen, P. Creed, and P. Jeavons), MFCS'11, LNCS 6907, pp. 231-242, 2011. (superseded by J9)

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

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

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

(with C. Jefferson, S. Kadioglu, K. Petrie, and M. Sellmann), CP'09, LNCS 5732, pp. 470-485, 2009.

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

(with P. Jeavons), CP'09, LNCS 5732, pp. 833-841, 2009.

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

(with D. Cohen and P. Jeavons), MFCS'09, LNCS 5734, pp . 744-757, 2009. (superseded by J4)

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

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

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

(with D. Cohen and P. Jeavons), CP'07, LNCS 4741, pp. 798-805, 2007. (superseded by J1)

 Book Chapters 

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

(with M. Cooper), pp. 113-135 in B.2, 2017.

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

(with A. Krokhin), pp. 233-266 in B.2, 2017.

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

(with P. Jeavons and A. Krokhin), Algorithmics Column of the Bulletin of EATCS, Number 113, 21-55, 2014. (superseded by BC4)

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

(with T. Werner and D. Průša), 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|©]

(with P. Jeavons), Chapter 4 in 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|©]

Doctoral thesis, Department of Computer Science, University of Oxford, 2009. (superseded by B1)
ACP (Association for Constraint Programming) Doctoral Research Award 2011.

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

Master's thesis, Vrije Universiteit in Amsterdam, 2005.

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

Masters's thesis, Charles University in Prague, 2005.

 Miscellaneous 

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

(co-chair with M. Lombardi), 2012.

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

(co-chair with P. Nightingale), 2010.

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

(co-chair with with S. Faily), 2008.

 Co-Authors 

Andrei Bulatov (SFU), Clément Carbonnel (Oxford), David Cohen (Royal Holloway), Martin Cooper (Toulouse), Páidí Creed (Stratified Medical), Guillaume Escamocher (Cork), Jacob Focke (Oxford), Peter Fulla (Oxford), Serge Gaspers (UNSW and NICTA), Leslie Goldberg (Oxford), Yuni Iwamasa (Tokyo) Matti Järvisalo (Helsinki), Peter Jeavons (Oxford), Chris Jefferson (St Andrews), Mark Jerrum (Queen Mary, University of London), Serdar Kadioglu (Oracle), Vladimir Kolmogorov (IST), Andrei Krokhin (Durham), Arie Matsliah (Google), Neeldhara Misra (IISc), Kazuo Murota (Tokyo Metropolitan), Jakob Nordström (KTH), Sebastian Ordyniak (TU Wien), Karen Petrie (Dundee), Robert Powell (Durham), David Richerby (Oxford), Miguel Romero (Oxford), Meinolf Sellmann (IBM Research), Stefan Szeider (TU Wien), Johan Thapper (Paris-Est Marne-la-Vallée), Andrius Vaicenavičius (Oxford), Justin Ward (Queen Mary, University of London), Bruno Zanuttini (Caen)

This is what Wordle thinks of the abstracts of my publications:

Keywords by Wordle