The Constraint Satisfaction Problem 2017

3 papers
The 2017 edition of The Constraint Satisfaction Problem featured research focused on the theoretical foundations of computational complexity and algorithmic efficiency. With three papers published, the year’s contributions addressed several core areas, including the identification of backdoor sets to manage CSP tractability and the development of approximation algorithms. Another significant theme involved investigating the complexity of Holant problems, which provides a framework for analyzing counting problems. Notable contributors included Sebastian Ordyniak, Serge Gaspers, and Stefan Szeider, who collaborated on research regarding backdoor sets for CSPs. Yury Makarychev contributed to the study of approximation algorithms, while Heng Guo and Pinyan Lu focused on the complexity of Holant problems. These works reflect a trend toward understanding the mathematical boundaries of constraint satisfaction and the refinement of techniques for solving complex instances.

Top Research Directions

The 2 research directions with The Constraint Satisfaction Problem 2017 papers, ranked by paper count. Share is the fraction of the edition’s papers in the direction.

#DirectionPapersShare
1Complexity Dichotomies for Constraint Satisfaction and Counting Problems133.3%
2Holographic Reductions for Counting Problems133.3%

Download all directions as CSV

Institutions

Institutions credited by The Constraint Satisfaction Problem 2017 papers: a paper credits every institution named in its affiliations, once. 2 institutions share 1 credited papers.

#InstitutionPapersShare
1Queen Mary University of London 1100.0%
2Shanghai University of Finance and Economics 1100.0%

Download all institutions as CSV

About this data

Papers. The Constraint Satisfaction Problem 2017 lists 3 papers on Lacuna, duplicate versions counted once; rejected and withdrawn submissions are left out.

Directions. Directions are Lacuna’s clustering of the concept elements extracted from each paper, so a paper can belong to several and direction counts add up to more than the paper count. A direction’s share is its papers divided by the edition’s papers.

Institutions. A paper credits each institution named in its affiliations, resolved to a ROR record, once. 1 of 3 papers (33.3%) credit at least one institution and are the base for institution shares; the rest have no resolved affiliation yet.

Data. Counts come from Lacuna’s data build of 2026-11-19 and change as papers are added. Tables as CSV: directions · institutions. Cite as: Lacuna, “The Constraint Satisfaction Problem 2017”, https://lacuna.tiptreesystems.com/venue/the-constraint-satisfaction-problem/2017.

Top Authors

AuthorPapers
Pinyan Lu1
Sebastian Ordyniak1
Stefan Szeider1

Papers

Title
Approximation Algorithms for CSPs
Backdoor Sets for CSP
On the Complexity of Holant Problems