Johan Thapper

ACM Trans. Comput. Theory, 2018

Tractability conditions for numeric CSPs.

[BibT_eX]

[DOI]

Jean-Alexandre Anglès d'Auriac

Theor. Comput. Sci., 2018

Tropical dominating sets in vertex-coloured graphs.

[BibT_eX]

[DOI]

Csilla Bujtás

Abdelhakim El Maftouhi

J. Discrete Algorithms, 2018

2017

The Power of Sherali-Adams Relaxations for General-Valued CSPs.

[BibT_eX]

[DOI]

SIAM J. Comput., 2017

2016

Constraint satisfaction and semilinear expansions of addition over the rationals and the reals.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2016

The Complexity of Finite-Valued CSPs.

[BibT_eX]

[DOI]

Jean-Alexandre Anglès d'Auriac

J. ACM, 2016

Tropical Dominating Sets in Vertex-Coloured Graphs.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation - 10th International Workshop, 2016

2015

Necessary Conditions for Tractability of Valued CSPs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2015

The Power of Linear Programming for General-Valued CSPs.

[BibT_eX]

[DOI]

Vladimir Kolmogorov

SIAM J. Comput., 2015

An Approximability-related Parameter on Graphs - Properties and Applications.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2015

Sherali-Adams Relaxations for Valued CSPs.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

2014

Affine Consistency and the Complexity of Semilinear Constraints.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

2013

Constraint satisfaction tractability from semi-lattice operations on infinite sets.

[BibT_eX]

[DOI]

Manuel Bodirsky

H. Dugald Macpherson

ACM Trans. Comput. Log., 2013

2012

The Power of Linear Programming for Valued CSPs.

[BibT_eX]

[DOI]

Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, 2012

2011

Min CSP on Four Elements: Moving beyond Submodularity.

[BibT_eX]

[DOI]

Fredrik Kuivinen

Proceedings of the Principles and Practice of Constraint Programming - CP 2011, 2011

2010

Approximating integer programs with positive right-hand sides.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2010

2009

Properties of an Approximability-related Parameter on Circular Complete Graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2009

Graph Homomorphisms, Circular Colouring, and Fractional Covering by H-cuts

[BibT_eX]

[DOI]

CoRR, 2009

Approximability of the Maximum Solution Problem for Certain Families of Algebras.

[BibT_eX]

[DOI]

Proceedings of the Computer Science, 2009

Approximability Distance in the Space of <i>H</i>-Colourability Problems.

[BibT_eX]

[DOI]

Tommy Färnqvist

Proceedings of the Computer Science, 2009

2008

Approximability Distance in the Space of H-Colourability Problems

[BibT_eX]

[DOI]

Tommy Färnqvist

CoRR, 2008

2007

The Maximum Solution Problem on Graphs.

[BibT_eX]

[DOI]

Gustav Nordh

Proceedings of the Mathematical Foundations of Computer Science 2007, 2007

2005

A Microstructure Based Approach to Constraint Satisfaction Optimisation Problems.

[BibT_eX]

[DOI]

Ola Angelsmark

Proceedings of the Eighteenth International Florida Artificial Intelligence Research Society Conference, 2005

Partitioning Based Algorithms for Some Colouring Problems.

[BibT_eX]

[DOI]

Ola Angelsmark

Proceedings of the Recent Advances in Constraints, 2005

2004

Algorithms for the Maximum Hamming Distance Problem.

[BibT_eX]

[DOI]

Ola Angelsmark