|
[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 ]
|