Abstract is missing.
- Front Matter, Table of Contents, Preface, List of Authors [doi]
- Polymorphisms, and How to Use ThemLibor Barto, Andrei A. Krokhin, Ross Willard. 1-44 [doi]
- Absorption in Universal Algebra and CSPLibor Barto, Marcin Kozik. 45-77 [doi]
- Constraint Satisfaction Problems over Numeric DomainsManuel Bodirsky, Marcello Mamino. 79-111 [doi]
- Hybrid Tractable Classes of Constraint ProblemsMartin C. Cooper, Stanislav Zivny. 113-135 [doi]
- Backdoor Sets for CSPSerge Gaspers, Sebastian Ordyniak, Stefan Szeider. 137-157 [doi]
- On the Complexity of Holant ProblemsHeng Guo, Pinyan Lu. 159-177 [doi]
- Parameterized Constraint Satisfaction Problems: a SurveyGregory Gutin, Anders Yeo. 179-203 [doi]
- Counting Constraint Satisfaction ProblemsMark Jerrum. 205-231 [doi]
- The Complexity of Valued CSPsAndrei A. Krokhin, Stanislav Zivny. 233-266 [doi]
- Algebra and the Complexity of Digraph CSPs: a SurveyBenoit Larose. 267-285 [doi]
- Approximation Algorithms for CSPsKonstantin Makarychev, Yury Makarychev. 287-325 [doi]
- Quantified Constraints in Twenty SeventeenBarnaby Martin. 327-346 [doi]