Dagstuhl Follow-Ups, Volume 7, DFU - Vol. 7

• Andrei Krokhin and Stanislav Zivny DFU, Volume 7, The Constraint Satisfaction Problem: Complexity and Approximability, Complete Volume 10.4230/DFU.Vol7.15301
• Andrei Krokhin and Stanislav Zivny Front Matter, Table of Contents, Preface, List of Authors 10.4230/DFU.Vol7.15301.i
• Libor Barto, Andrei Krokhin, and Ross Willard Polymorphisms, and How to Use Them 10.4230/DFU.Vol7.15301.1
• Libor Barto and Marcin Kozik Absorption in Universal Algebra and CSP 10.4230/DFU.Vol7.15301.45
• Manuel Bodirsky and Marcello Mamino Constraint Satisfaction Problems over Numeric Domains 10.4230/DFU.Vol7.15301.79
• Martin C. Cooper and Stanislav Zivny Hybrid Tractable Classes of Constraint Problems 10.4230/DFU.Vol7.15301.113
• Serge Gaspers, Sebastian Ordyniak, and Stefan Szeider Backdoor Sets for CSP 10.4230/DFU.Vol7.15301.137
• Heng Guo and Pinyan Lu On the Complexity of Holant Problems 10.4230/DFU.Vol7.15301.159
• Gregory Gutin and Anders Yeo Parameterized Constraint Satisfaction Problems: a Survey 10.4230/DFU.Vol7.15301.179
• Mark Jerrum Counting Constraint Satisfaction Problems 10.4230/DFU.Vol7.15301.205
• Andrei Krokhin and Stanislav Zivny The Complexity of Valued CSPs 10.4230/DFU.Vol7.15301.233
• Benoit Larose Algebra and the Complexity of Digraph CSPs: a Survey 10.4230/DFU.Vol7.15301.267
• Konstantin Makarychev and Yury Makarychev Approximation Algorithms for CSPs 10.4230/DFU.Vol7.15301.287
• Barnaby Martin Quantified Constraints in Twenty Seventeen 10.4230/DFU.Vol7.15301.327