Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJohan Thapper
Person information
- affiliation: Université Paris-Est, Laboratoire d'Informatique Gaspard-Monge, France
- affiliation (former): University of Paris-Sud, Laboratory for Computer Science (LRI), France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2018
[j12]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:
Tropical dominating sets in vertex-coloured graphs. J. Discrete Algorithms 48: 27-41 (2018)- [j11]Peter Jonsson, Johan Thapper:
Tractability conditions for numeric CSPs. Theor. Comput. Sci. 715: 21-34 (2018) - [j10]Johan Thapper, Stanislav Zivný:
The Limits of SDP Relaxations for General-Valued CSPs. ACM Trans. Comput. Theory 10(3): 12:1-12:22 (2018) - 2017
- [j9]Johan Thapper, Stanislav Zivný:
The Power of Sherali-Adams Relaxations for General-Valued CSPs. SIAM J. Comput. 46(4): 1241-1279 (2017) - 2016
- [j8]Johan Thapper, Stanislav Zivný:
The Complexity of Finite-Valued CSPs. J. ACM 63(4): 37:1-37:33 (2016) - [j7]Peter Jonsson, Johan Thapper:
Constraint satisfaction and semilinear expansions of addition over the rationals and the reals. J. Comput. Syst. Sci. 82(5): 912-928 (2016) - 2015
- [j6]Robert Engström, Tommy Färnqvist, Peter Jonsson, Johan Thapper:
An Approximability-related Parameter on Graphs - Properties and Applications. Discret. Math. Theor. Comput. Sci. 17(1): 33-66 (2015) - [j5]Vladimir Kolmogorov, Johan Thapper, Stanislav Zivný:
The Power of Linear Programming for General-Valued CSPs. SIAM J. Comput. 44(1): 1-36 (2015) - [j4]Johan Thapper, Stanislav Zivný:
Necessary Conditions for Tractability of Valued CSPs. SIAM J. Discret. Math. 29(4): 2361-2384 (2015) - 2013
- [j3]Manuel Bodirsky, H. Dugald Macpherson, Johan Thapper:
Constraint satisfaction tractability from semi-lattice operations on infinite sets. ACM Trans. Comput. Log. 14(4): 30:1-30:19 (2013) - 2010
- [j2]Peter Jonsson, Johan Thapper:
Approximating integer programs with positive right-hand sides. Inf. Process. Lett. 110(10): 351-355 (2010) - 2009
- [j1]Robert Engström, Tommy Färnqvist, Peter Jonsson, Johan Thapper:
Properties of an Approximability-related Parameter on Circular Complete Graphs. Electron. Notes Discret. Math. 35: 115-120 (2009)
Conference and Workshop Papers
- 2017
- [c15]Johan Thapper, Stanislav Zivný:
The limits of SDP relaxations for general-valued CSPs. LICS 2017: 1-12 - 2016
- [c14]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. WALCOM 2016: 17-27 - 2015
- [c13]Johan Thapper, Stanislav Zivný:
Sherali-Adams Relaxations for Valued CSPs. ICALP (1) 2015: 1058-1069 - 2014
- [c12]Peter Jonsson, Johan Thapper:
Affine Consistency and the Complexity of Semilinear Constraints. MFCS (2) 2014: 420-431 - 2013
- [c11]Johan Thapper, Stanislav Zivný:
The complexity of finite-valued CSPs. STOC 2013: 695-704 - 2012
- [c10]Johan Thapper, Stanislav Zivný:
The Power of Linear Programming for Valued CSPs. FOCS 2012: 669-678 - 2011
- [c9]Peter Jonsson, Fredrik Kuivinen, Johan Thapper:
Min CSP on Four Elements: Moving beyond Submodularity. CP 2011: 438-453 - 2009
- [c8]Tommy Färnqvist, Peter Jonsson, Johan Thapper:
Approximability Distance in the Space of H-Colourability Problems. CSR 2009: 92-104 - [c7]Peter Jonsson, Johan Thapper:
Approximability of the Maximum Solution Problem for Certain Families of Algebras. CSR 2009: 215-226 - 2007
- [c6]Peter Jonsson, Gustav Nordh, Johan Thapper:
The Maximum Solution Problem on Graphs. MFCS 2007: 228-239 - 2005
- [c5]Ola Angelsmark, Johan Thapper:
Partitioning Based Algorithms for Some Colouring Problems. CSCLP 2005: 44-58 - [c4]Ola Angelsmark, Johan Thapper:
A Microstructure Based Approach to Constraint Satisfaction Optimisation Problems. FLAIRS 2005: 155-160 - 2004
- [c3]Ola Angelsmark, Johan Thapper:
Algorithms for the Maximum Hamming Distance Problem. CSCLP 2004: 128-141 - 2002
- [c2]Ola Angelsmark, Peter Jonsson, Svante Linusson, Johan Thapper:
Determining the Number of Solutions to Binary CSP Instances. CP 2002: 327-340 - 2000
- [c1]Anneli Dahlström, Fredrik Heintz, Martin Jacobsson, Johan Thapper, Martin Öberg:
The NOAI Team Description. RoboCup 2000: 413-416
Informal and Other Publications
- 2016
- [i13]Johan Thapper, Stanislav Zivný:
The power of Sherali-Adams relaxations for general-valued CSPs. CoRR abs/1606.02577 (2016) - [i12]Johan Thapper, Stanislav Zivný:
The limits of SDP relaxations for general-valued CSPs. CoRR abs/1612.01147 (2016) - 2015
- [i11]Johan Thapper, Stanislav Zivný:
Necessary conditions for tractability of valued CSPs. CoRR abs/1502.03482 (2015) - [i10]Johan Thapper, Stanislav Zivný:
Sherali-Adams relaxations for valued CSPs. CoRR abs/1502.05301 (2015) - [i9]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:
Tropical Dominating Sets in Vertex-Coloured Graphs. CoRR abs/1503.01008 (2015) - [i8]Peter Jonsson, Johan Thapper:
Constraint Satisfaction and Semilinear Expansions of Addition over the Rationals and the Reals. CoRR abs/1506.00479 (2015) - 2013
- [i7]Vladimir Kolmogorov, Johan Thapper, Stanislav Zivný:
The power of linear programming for general-valued CSPs. CoRR abs/1311.4219 (2013) - 2012
- [i6]Johan Thapper, Stanislav Zivný:
The Power of Linear Programming for Valued CSPs. CoRR abs/1204.1079 (2012) - [i5]Johan Thapper, Stanislav Zivný:
The complexity of finite-valued CSPs. CoRR abs/1210.2987 (2012) - 2011
- [i4]Peter Jonsson, Fredrik Kuivinen, Johan Thapper:
Min CSP on Four Elements: Moving Beyond Submodularity. CoRR abs/1102.2880 (2011) - [i3]Manuel Bodirsky, Dugald Macpherson, Johan Thapper:
Constraint Satisfaction Tractability from Semi-lattice Operations on Infinite Sets. CoRR abs/1111.6616 (2011) - 2009
- [i2]Robert Engström, Tommy Färnqvist, Peter Jonsson, Johan Thapper:
Graph Homomorphisms, Circular Colouring, and Fractional Covering by H-cuts. CoRR abs/0904.4600 (2009) - 2008
- [i1]Tommy Färnqvist, Peter Jonsson, Johan Thapper:
Approximability Distance in the Space of H-Colourability Problems. CoRR abs/0802.0423 (2008)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2023-10-01 22:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
