Johan Thapper

41 papers A* 3A 2B 2C 1Misc 3Journal 25Unranked 4
YearRankTypeTitle / Venue / Authors
2018 J jnl
The Limits of SDP Relaxations for General-Valued CSPs.
ACM Trans. Comput. Theory
Johan Thapper, Stanislav Zivný
2018 J jnl
Tractability conditions for numeric CSPs.
Theor. Comput. Sci.
Peter Jonsson, Johan Thapper
2018 J jnl
Tropical dominating sets in vertex-coloured graphs.
J. Discrete Algorithms
Jean-Alexandre Anglès d'Auriac, Csilla Bujtás, Abdelhakim El Maftouhi, Marek Karpinski, Yannis Manoussakis, Leandro Montero, N. Narayanan, Laurent Rosaz, Johan Thapper, Zsolt Tuza
2017 J jnl
The Power of Sherali-Adams Relaxations for General-Valued CSPs.
SIAM J. Comput.
Johan Thapper, Stanislav Zivný
2017 A* conf
The limits of SDP relaxations for general-valued CSPs.
LICS
Johan Thapper, Stanislav Zivný
2016 J jnl
Constraint satisfaction and semilinear expansions of addition over the rationals and the reals.
J. Comput. Syst. Sci.
Peter Jonsson, Johan Thapper
2016 J jnl
The Complexity of Finite-Valued CSPs.
J. ACM
Johan Thapper, Stanislav Zivný
2016 J jnl
The limits of SDP relaxations for general-valued CSPs.
CoRR
Johan Thapper, Stanislav Zivný
2016 J jnl
The power of Sherali-Adams relaxations for general-valued CSPs.
CoRR
Johan Thapper, Stanislav Zivný
2016 B conf
Tropical Dominating Sets in Vertex-Coloured Graphs.
WALCOM
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
2015 J jnl
An Approximability-related Parameter on Graphs - Properties and Applications.
Discret. Math. Theor. Comput. Sci.
Robert Engström, Tommy Färnqvist, Peter Jonsson, Johan Thapper
2015 J jnl
Constraint Satisfaction and Semilinear Expansions of Addition over the Rationals and the Reals.
CoRR
Peter Jonsson, Johan Thapper
2015 J jnl
Necessary Conditions for Tractability of Valued CSPs.
SIAM J. Discret. Math.
Johan Thapper, Stanislav Zivný
2015 J jnl
Necessary conditions for tractability of valued CSPs.
CoRR
Johan Thapper, Stanislav Zivný
2015 — conf
Sherali-Adams Relaxations for Valued CSPs.
ICALP (1)
Johan Thapper, Stanislav Zivný
2015 J jnl
Sherali-Adams relaxations for valued CSPs.
CoRR
Johan Thapper, Stanislav Zivný
2015 J jnl
The Power of Linear Programming for General-Valued CSPs.
SIAM J. Comput.
Vladimir Kolmogorov, Johan Thapper, Stanislav Zivný
2015 J jnl
Tropical Dominating Sets in Vertex-Coloured Graphs.
CoRR
Jean-Alexandre Anglès d'Auriac, Csilla Bujtás, Hakim El Maftouhi, Marek Karpinski, Yannis Manoussakis, Leandro Montero, N. Narayanan, Laurent Rosaz, Johan Thapper, Zsolt Tuza
2014 — conf
Affine Consistency and the Complexity of Semilinear Constraints.
MFCS (2)
Peter Jonsson, Johan Thapper
2013 J jnl
Constraint satisfaction tractability from semi-lattice operations on infinite sets.
ACM Trans. Comput. Log.
Manuel Bodirsky, H. Dugald Macpherson, Johan Thapper
2013 A* conf
The complexity of finite-valued CSPs.
STOC
Johan Thapper, Stanislav Zivný
2013 J jnl
The power of linear programming for general-valued CSPs.
CoRR
Vladimir Kolmogorov, Johan Thapper, Stanislav Zivný
2012 J jnl
The Power of Linear Programming for Valued CSPs
CoRR
Johan Thapper, Stanislav Zivný
2012 A* conf
The Power of Linear Programming for Valued CSPs.
FOCS
Johan Thapper, Stanislav Zivný
2012 J jnl
The complexity of finite-valued CSPs
CoRR
Johan Thapper, Stanislav Zivný
2011 J jnl
Constraint Satisfaction Tractability from Semi-lattice Operations on Infinite Sets
CoRR
Manuel Bodirsky, Dugald Macpherson, Johan Thapper
2011 J jnl
Min CSP on Four Elements: Moving Beyond Submodularity
CoRR
Peter Jonsson, Fredrik Kuivinen, Johan Thapper
2011 A conf
Min CSP on Four Elements: Moving beyond Submodularity.
CP
Peter Jonsson, Fredrik Kuivinen, Johan Thapper
2010 J jnl
Approximating integer programs with positive right-hand sides.
Inf. Process. Lett.
Peter Jonsson, Johan Thapper
2010 — —
Aspects of a Constraint Optimisation Problem.
Johan Thapper
2009 Misc conf
Approximability Distance in the Space of
CSR
Tommy Färnqvist, Peter Jonsson, Johan Thapper
2009 Misc conf
Approximability of the Maximum Solution Problem for Certain Families of Algebras.
CSR
Peter Jonsson, Johan Thapper
2009 J jnl
Graph Homomorphisms, Circular Colouring, and Fractional Covering by H-cuts
CoRR
Robert Engström, Tommy Färnqvist, Peter Jonsson, Johan Thapper
2009 J jnl
Properties of an Approximability-related Parameter on Circular Complete Graphs.
Electron. Notes Discret. Math.
Robert Engström, Tommy Färnqvist, Peter Jonsson, Johan Thapper
2008 J jnl
Approximability Distance in the Space of H-Colourability Problems
CoRR
Tommy Färnqvist, Peter Jonsson, Johan Thapper
2007 B conf
The Maximum Solution Problem on Graphs.
MFCS
Peter Jonsson, Gustav Nordh, Johan Thapper
2005 Misc conf
A Microstructure Based Approach to Constraint Satisfaction Optimisation Problems.
FLAIRS
Ola Angelsmark, Johan Thapper
2005 — conf
Partitioning Based Algorithms for Some Colouring Problems.
CSCLP
Ola Angelsmark, Johan Thapper
2004 — conf
Algorithms for the Maximum Hamming Distance Problem.
CSCLP
Ola Angelsmark, Johan Thapper
2002 A conf
Determining the Number of Solutions to Binary CSP Instances.
CP
Ola Angelsmark, Peter Jonsson, Svante Linusson, Johan Thapper
2000 C conf
The NOAI Team Description.
RoboCup
Anneli Dahlström, Fredrik Heintz, Martin Jacobsson, Johan Thapper, Martin Öberg