The NOAI Team Description. - Anneli Dahlström; Fredrik Heintz; Martin Jacobsson; Johan Thapper; Martin Öberg (RoboCup, 2000)

Determining the Number of Solutions to Binary CSP Instances. - Ola Angelsmark; Peter Jonsson; Svante Linusson; Johan Thapper (CP, 2002)

Algorithms for the Maximum Hamming Distance Problem. - Ola Angelsmark; Johan Thapper (CSCLP, 2004)

Partitioning Based Algorithms for Some Colouring Problems. - Ola Angelsmark; Johan Thapper (CSCLP, 2005)

A Microstructure Based Approach to Constraint Satisfaction Optimisation Problems. - Ola Angelsmark; Johan Thapper (FLAIRS, 2005)

The Maximum Solution Problem on Graphs. - Peter Jonsson; Gustav Nordh; Johan Thapper (MFCS, 2007)

Approximability Distance in the Space of H-Colourability Problems - Tommy Färnqvist; Peter Jonsson; Johan Thapper (CoRR, 2008)

Approximability Distance in the Space of H-Colourability Problems. - Tommy Färnqvist; Peter Jonsson; Johan Thapper (CSR, 2009)

Approximability of the Maximum Solution Problem for Certain Families of Algebras. - Peter Jonsson; Johan Thapper (CSR, 2009)

Graph Homomorphisms, Circular Colouring, and Fractional Covering by H-cuts - Robert Engström; Tommy Färnqvist; Peter Jonsson; Johan Thapper (CoRR, 2009)

Properties of an Approximability-related Parameter on Circular Complete Graphs. - Robert Engström; Tommy Färnqvist; Peter Jonsson; Johan Thapper (Electron. Notes Discret. Math., 2009)

Approximating integer programs with positive right-hand sides. - Peter Jonsson; Johan Thapper (Inf. Process. Lett., 2010)

Aspects of a Constraint Optimisation Problem. - Johan Thapper (2010)

Min CSP on Four Elements: Moving beyond Submodularity. - Peter Jonsson; Fredrik Kuivinen; Johan Thapper (CP, 2011)

The Power of Linear Programming for Valued CSPs. - Johan Thapper; Stanislav Zivný (FOCS, 2012)

Constraint satisfaction tractability from semi-lattice operations on infinite sets. - Manuel Bodirsky; H. Dugald Macpherson; Johan Thapper (ACM Trans. Comput. Log., 2013)

Affine Consistency and the Complexity of Semilinear Constraints. - Peter Jonsson; Johan Thapper (MFCS (2), 2014)

Sherali-Adams Relaxations for Valued CSPs. - Johan Thapper; Stanislav Zivný (ICALP (1), 2015)

An Approximability-related Parameter on Graphs - Properties and Applications. - Robert Engström; Tommy Färnqvist; Peter Jonsson; Johan Thapper (Discret. Math. Theor. Comput. Sci., 2015)

The Power of Linear Programming for General-Valued CSPs. - Vladimir Kolmogorov; Johan Thapper; Stanislav Zivný (SIAM J. Comput., 2015)

Necessary Conditions for Tractability of Valued CSPs. - Johan Thapper; Stanislav Zivný (SIAM J. Discret. Math., 2015)

Tropical Dominating Sets in Vertex-Coloured Graphs. - Jean-Alexandre Anglès d'Auriac; Csilla Bujtás; Hakim El Maftouhi; Marek Karpinski; Yannis Manoussakis; Leandro Montero; Narayanan Narayanan; Laurent Rosaz; Johan Thapper; Zsolt Tuza (WALCOM, 2016)

The Complexity of Finite-Valued CSPs. - Johan Thapper; Stanislav Zivný (J. ACM, 2016)

Constraint satisfaction and semilinear expansions of addition over the rationals and the reals. - Peter Jonsson; Johan Thapper (J. Comput. Syst. Sci., 2016)

The Power of Sherali-Adams Relaxations for General-Valued CSPs. - Johan Thapper; Stanislav Zivný (SIAM J. Comput., 2017)

Tropical dominating sets in vertex-coloured graphs. - Jean-Alexandre Anglès d'Auriac; Csilla Bujtás; Abdelhakim El Maftouhi; Marek Karpinski; Yannis Manoussakis; Leandro Montero; N. Narayanan 001; Laurent Rosaz; Johan Thapper; Zsolt Tuza (J. Discrete Algorithms, 2018)

Tractability conditions for numeric CSPs. - Peter Jonsson; Johan Thapper (Theor. Comput. Sci., 2018)

The Limits of SDP Relaxations for General-Valued CSPs. - Johan Thapper; Stanislav Zivný (ACM Trans. Comput. Theory, 2018)