May 15 – 20 , 2022, Dagstuhl Seminar 22201

The Constraint Satisfaction Problem: Complexity and Approximability


Martin Grohe (RWTH Aachen, DE)
Venkatesan Guruswami (Carnegie Mellon University – Pittsburgh, US)
Dániel Marx (CISPA – Saarbrücken, DE)
Stanislav Živný (University of Oxford, GB)

For support, please contact

Simone Schilke for administrative matters

Michael Gerke for scientific matters

Dagstuhl Seminar Series


  • Computational Complexity
  • Data Structures And Algorithms
  • Logic In Computer Science


  • Constraint satisfaction problem
  • Computational complexity
  • Hardness of approximation
  • Universal algebra
  • Semidefinite programming


In the series Dagstuhl Reports each Dagstuhl Seminar and Dagstuhl Perspectives Workshop is documented. The seminar organizers, in cooperation with the collector, prepare a report that includes contributions from the participants' talks together with a summary of the seminar.


Download overview leaflet (PDF).


Furthermore, a comprehensive peer-reviewed collection of research papers can be published in the series Dagstuhl Follow-Ups.

Dagstuhl's Impact

Please inform us when a publication was published as a result from your seminar. These publications are listed in the category Dagstuhl's Impact and are presented on a special shelf on the ground floor of the library.