THI - Materials

A New Look at Survey Propagation

Elitza Maneva

Abstract, Slides.

A short overview of hinges

Marc Gyssens

Abstract, Slides.

A Unifying Theory of Structural Decompostions for the CSP problem

David Cohen

Abstract, Slides,

Proceedings Paper.

Advanced Universal Algebra and the CSP

Matt Valeriote

Abstract, Slides.

Basic Universal Algebra

Ferdinand Börner

Abstract, Slides.

Boolean Constraint Satisfaction Problems

Heribert Vollmer

Abstract, Slides.

Complexity of Clausal Constraints Over Chains

Miki Hermann

Abstract, Slides.

Complexity of Maximum Solution: Max-Ones Generalised to Larger Domains

Gustav Nordh

Abstract, Slides.

Complexity of Temporal Constraint Satisfaction

Manuel Bodirsky

Abstract, Slides.

Connectivity of Boolean Satisfiability: Structural and Computational Dichotomies

Elitza Maneva

Abstract, Slides.

Constraint satisfaction problems and dualities

Andrei Krokhin

Abstract, Slides.

Constraint satisfaction, structure homomorphisms and fragments of second order logic.

Florent R. Madelaine

Abstract, Slides.

Constraint Satisfaction with Succinctly Specified Relations

Martin Grohe

Abstract, Slides, Proceedings Paper.

CSP, algebras, and varieties

Andrei A. Bulatov

Abstract, Slides.

CSPs in clausal form: Autarkies, minimal unsatisfiability, hypergraphs

Oliver Kullmann

Abstract, Slides, Proceedings Paper.

Definability of CSPs in Fixed-point logics

Anuj Dawar

Abstract, Slides.

Efficient Enumeration Algorithms for Constraint Satisfaction Problems

Henning Schnoor

Abstract, Slides, Proceedings Paper.

Enumeration Complexity of Query Problems and Quantifier Elimination

Arnaud Durand

Abstract, Slides.

Exponential Lower Bound for tree-like Lovasz-Schrijver proof systems

Dmitry Itsykson

Abstract, Slides.

Expressibility of VCSPs

David Cohen

Abstract, Slides.

Fixed-parameter tractable constraint satisfaction

Stefan Szeider

Abstract, Slides.

Islands of Tractability for Uniform CSP, and their Relationship to Database Theory

Francesco Scarcello

Abstract, Slides.

Non FO CSP's are Logspace hard

Benoit Larose

Abstract, Slides.

On the power of k-consistency

Albert Atserias

Abstract, Slides.

On XPath Dialects with Variables

Joachim Niehren

Abstract, Slides.

Partial clones and Constraint Satisfaction

Ilka Schnoor

Abstract, Slides, Proceedings Paper.

Practical SAT algorithms

Oliver Kullmann

Abstract, Slides, Other.

Quantified equality constraints

Hubie Chen

Abstract.

Random Constraint Optimization: The Case of Max-Cut

Lefteris M. Kirousis

Abstract, Slides, Proceedings Paper.

Some other Galois connections

Ferdinand Börner

Abstract, Slides.

Systems of equations over finite semigroups and the #CSP dichotomy

Pascal Tesson

Abstract, Slides.