International journals

[J9] Johan Thapper and Stanislav Živný. The Power of Sherali-Adams Relaxations for General-Valued CSPs. SIAM Journal on Computing, 46(4):1241–1279, 2017. [ doi ]
[J8] Peter Jonsson and Johan Thapper. Constraint satisfaction and semilinear expansions of addition over the rationals and the reals. Journal of Computer and System Sciences, 82(5):912-928, 2016. [ doi ]
[J7] Johan Thapper and Stanislav Živný. The Complexity of Finite-Valued CSPs. Journal of the ACM, 63(4):1-37, 2016. [ doi ]
[J6] Johan Thapper and Stanislav Živný. Necessary Conditions for Tractability of Valued CSPs. SIAM Journal on Discrete Mathematics, 29(4):2361-2384, 2015. [ doi ]
[J5] Vladimir Kolmogorov, Johan Thapper, and Stanislav Živný. The power of linear programming for general-valued CSPs. SIAM Journal on Computing, 44(1):1-36, 2015. [ doi ]
[J4] Robert Engström, Tommy Färnqvist, Peter Jonsson, and Johan Thapper. An Approximability-related Parameter on Graphs - Properties and Applications. Discrete Mathematics & Theoretical Computer Science, 17(1):33-66, 2015. [ url ]
[J3] Manuel Bodirsky, M. Dugald Macpherson, and Johan Thapper. Constraint satisfaction tractability from semi-lattice operations on infinite sets. ACM Transactions on Computational Logic, 14(4), 2013. [ doi ]
[J2] Peter Jonsson and Johan Thapper. Approximating integer programs with positive right-hand sides. Information Processing Letters, 110(10):351-355, 2010. [ doi | pdf ]
[J1] Johan Thapper. Refined Counting of Fully Packed Loop Configurations. Séminaire Lotharingien de Combinatoire, 56:B56e, 2006. [ http | pdf ]

International conference and workshop proceedings

[C16] Johan Thapper and Stanislav Živný. The limits of SDP relaxations for general-valued CSPs. In 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS-2017), pages 1-12, 2017. [ doi ]
[C15] 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. Tropical Dominating Sets in Vertex-Coloured Graphs. In Proceedings of the 10th International Workshop on Algorithms and Computation (WALCOM-2016), pages 17-27, 2016. [ doi ]
[C14] Johan Thapper and Stanislav Živný. Sherali-Adams relaxations for valued CSPs. In Proceedings of the 42nd International Colloquium on Automata, Languages, and Programming (ICALP-2015), pages 1058-1069, 2015. [ arxiv ]
[C13] Peter Jonsson and Johan Thapper. Affine Consistency and the Complexity of Semilinear Constraints. In Proceedings of the 39th International Symposium on Mathematical Foundations of Computer Science (MFCS-2014), pages 420-431, 2014. [ doi ]
[C12] Johan Thapper and Stanislav Živný. The complexity of finite-valued CSPs. In Proceedings of the 45th ACM Symposium on the Theory of Computing (STOC-2013), pages 695-704, 2013. [ doi ]
[C11] Johan Thapper and Stanislav Živný. The power of linear programming for valued CSPs. In Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science (FOCS-2012), pages 669-678, 2012. [ arxiv ]
[C10] Peter Jonsson, Fredrik Kuivinen, and Johan Thapper. Min CSP on four elements: Moving beyond submodularity, In Proceedings of 17th International Conference on Principles and Practice of Constraint Programming (CP-2011), pages 438-453, 2011. [ doi | pdf ]
[C9] Robert Engström, Tommy Färnqvist, Peter Jonsson, and Johan Thapper. Properties of an approximability-related parameter on circular complete graphs. In Proceedings of V Latin-American Algorithms, Graphs, and Optimization Symposium (LAGOS-2009), pages 115-120, 2009. [ doi | pdf ]
[C8] Peter Jonsson and Johan Thapper. Approximability of the maximum solution problem for certain families of algebras. In Proceedings of the 4th International Computer Science Symposium in Russia (CSR-2009), pages 215-226, 2009. [ pdf ]
[C7] Tommy Färnqvist, Peter Jonsson, and Johan Thapper. Approximability distance in the space of H-colourability problems. In Proceedings of the 4th International Computer Science Symposium in Russia (CSR-2009), pages 92-104, 2009. [ pdf ]
[C6] Peter Jonsson, Gustav Nordh, and Johan Thapper. The maximum solution problem on graphs. In Proceedings of the 32nd International Symposium on Mathematical Foundations of Computer Science (MFCS-2007), pages 228-239, 2007. [ pdf ]
[C5] Ola Angelsmark and Johan Thapper. Partitioning based algorithms for some colouring problems. In Recent Advances in Constraints, Joint ERCIM/CoLogNET International Workshop on Constraint Solving and Constraint Logic Programming, volume 3978 of Lecture Notes in Computer Science, pages 44-58. Springer-Verlag, 2006. [ doi ]
[C4] Ola Angelsmark and Johan Thapper. A microstructure based approach to constraint satisfaction optimisation problems. In Proceedings of the 18th International FLAIRS Conference, 2005. [ pdf ]
[C3] Ola Angelsmark and Johan Thapper. Algorithms for the maximum hamming distance problem. In Constraint Satisfaction and Constraint Logic Programming: ERCIM/CoLogNet International Workshop (CSCLP-2004), volume 3419 of Lecture Notes in Computer Science, pages 128-141. Springer-Verlag, March 2005. Revised Selected and Invited Papers. [ pdf ]
[C2] Ola Angelsmark and Johan Thapper. New algorithms for the maximum hamming distance problem. In Boi Faltings, François Fages, Francesca Rossi, and Adrian Petcu, editors, Proceedings of the Joint Annual Workshop of ERCIM/CoLogNet on Constraint Solving and Constraint Logic Programming (CSCLP-2004), pages 271-285, 2004. [ pdf ]
[C1] Ola Angelsmark, Peter Jonsson, Svante Linusson, and Johan Thapper. Determining the number of solutions to binary CSP instances. In Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming (CP-2002), pages 327-340, 2002. [ pdf ]

French natinonal conference and workshop proceedings

[F3] Johan Thapper. Cohérences et dichotomies parmi des CSP pondérés. In Actes des Douziemes Journees Francophones de Programmation par Contraintes (JFPC-2016) (plenary presentation), pages 5-6, 2016. [ http ]
[F2] Johan Thapper and Stanislav Živný. Linear Programming and the Complexity of Finite-valued CSPs. In Actes des Neuvièmes Journées Francophones de Programmation par Contraintes (JFPC-2013), pages 299-302, 2013. [ http ]
[F1] Johan Thapper. The complexity of valued constraint satisfaction problems in a nutshell In Actes des Huitièmes Journées Francophones de Programmation par Contraintes (JFPC-2012), pages 298-301, 2012. [ http ]

Technical reports

[P1] Johan Thapper. Independence complexes of cylinders constructed from square and hexagonal grid graphs. arXiv:0812.1165 [math.CO], 38 pages, 2008. [ arxiv ]

Theses

[T2] Johan Thapper. Aspects of a Constraint Optimisation Problem. Phd thesis, Linköpings universitet, Linköping studies in science and technology. Dissertation No. 1294, 2010. [ http ]
[T1] Johan Thapper. Combinatorial Considerations on Two Models from Statistical Mechanics. Licentiate thesis, Linköpings universitet, Linköping studies in science and technology. Thesis No. 1335, 2007. [ http ]