| The complexity of finite-valued CSPs J Thapper, S Zivny Proceedings of the forty-fifth annual ACM symposium on Theory of computing …, 2013 | 159 | 2013 |
| The power of linear programming for valued CSPs J Thapper, S Zivny Foundations of Computer Science (FOCS), 2012 IEEE 53rd Annual Symposium on …, 2012 | 104 | 2012 |
| The power of linear programming for general-valued CSPs V Kolmogorov, J Thapper, S Zivny SIAM Journal on Computing 44 (1), 1-36, 2015 | 94 | 2015 |
| Min CSP on four elements: Moving beyond submodularity P Jonsson, F Kuivinen, J Thapper Principles and Practice of Constraint Programming–CP 2011, 438-453, 2011 | 39 | 2011 |
| Sherali-Adams relaxations for valued CSPs J Thapper, S Zivny arXiv preprint arXiv:1502.05301, 2015 | 23 | 2015 |
| Tropical Dominating Sets in Vertex-Coloured Graphs JA d'Auriac, C Bujtás, HE Maftouhi, M Karpinski, Y Manoussakis, ... arXiv preprint arXiv:1503.01008, 2015 | 19 | 2015 |
| Partitioning based algorithms for some colouring problems O Angelsmark, J Thapper Recent Advances in Constraints, 44-58, 2006 | 18 | 2006 |
| Algorithms for the maximum hamming distance problem O Angelsmark, J Thapper Recent Advances in Constraints, 128-141, 2005 | 18 | 2005 |
| The maximum solution problem on graphs P Jonsson, G Nordh, J Thapper Mathematical Foundations of Computer Science 2007, 228-239, 2007 | 16 | 2007 |
| Refined counting of fully packed loop configurations J Thapper Séminaire Lotharingien de Combinatoire 56, B56e, 2007 | 16 | 2007 |
| Necessary conditions for tractability of valued CSPs J Thapper, S Zivny arXiv preprint arXiv:1502.03482, 2015 | 13 | 2015 |
| Constraint Satisfaction and Semilinear Expansions of Addition over the Rationals and the Reals P Jonsson, J Thapper arXiv preprint arXiv:1506.00479, 2015 | 12 | 2015 |
| Constraint satisfaction tractability from semi-lattice operations on infinite sets M Bodirsky, HD Macpherson, J Thapper ACM Transactions on Computational Logic (TOCL) 14 (4), 30, 2013 | 11 | 2013 |
| Aspects of a constraint optimisation problem J Thapper Linköping University Electronic Press, 2010 | 10 | 2010 |
| Independence complexes of cylinders constructed from square and hexagonal grid graphs J Thapper arXiv preprint arXiv:0812.1165, 2008 | 9 | 2008 |
| Determining the number of solutions to binary CSP instances O Angelsmark, P Jonsson, S Linusson, J Thapper Principles and Practice of Constraint Programming-CP 2002, 327-340, 2002 | 9 | 2002 |
| Approximability of the maximum solution problem for certain families of algebras P Jonsson, J Thapper Computer Science-Theory and Applications, 215-226, 2009 | 6 | 2009 |
| Approximability distance in the space of H-colourability Problems T Färnqvist, P Jonsson, J Thapper Computer Science-Theory and Applications, 92-104, 2009 | 6 | 2009 |
| A Microstructure Based Approach to Constraint Satisfaction Optimisation Problems. O Angelsmark, J Thapper FLAIRS Conference, 155-160, 2005 | 6 | 2005 |
| An Approximability-related Parameter on Graphs-Properties and Applications R Engström, T Färnqvist, P Jonsson, J Thapper Discrete Mathematics & Theoretical Computer Science 17 (1), 33-66, 2015 | 4 | 2015 |
