Source: OpenCitations

• Uniform Constraint Satisfaction Problems and Database Theory

  Lecture notes in computer science

  Authors : Francesco Scarcello , Georg Gottlob , Gianluigi Greco

  Journal reference : Volume , 2008, pp. 156-195

  DOI : 10.1007/978-3-540-92800-3_7

• Generalized Hypertree Decomposition for solving non binary CSP with compressed table constraints

  French digital mathematics library (Numdam)

  Authors : Zineb Habbas , Kamal Amroun , Daniel Singer

  Journal reference : Volume 50, 2015, pp. 241-267

  DOI : 10.1051/ro/2015017

• A compressed Generalized Hypertree Decomposition-based solving technique for non-binary Constraint Satisfaction Problems

  AI Communications

  Authors : Kamal Amroun , Zineb Habbas , Wassila Aggoune-Mtalaa

  Journal reference : Volume 29, 2016, pp. 371-392

  DOI : 10.3233/aic-150694

• The Structure of Tractable Constraint Satisfaction Problems

  Lecture notes in computer science

  Authors : Martin Grohe

  Journal reference : Volume , 2006, pp. 58-72

  DOI : 10.1007/11821069_5

• An annotated bibliography on guaranteed graph searching

  Theoretical Computer Science

  Authors : Fedor V. Fomin , Dimitrios M. Thilikos

  Journal reference : Volume 399, 2008, pp. 236-245

  DOI : 10.1016/j.tcs.2008.02.040

• HSJ-Solver: a new method based on GHD for answering conjunctive queries and solving constraint satisfaction problems

  Applied Intelligence

  Authors : Zineb Younsi, Kamal Amroun , Farida Bouarab-Dahmani, Sofia Bennai

  Journal reference : Volume 53, 2022, pp. 17226-17239

  DOI : 10.1007/s10489-022-04361-y

• HyperConsistency Width for Constraint Satisfaction: Algorithms and Complexity Results

  Lecture notes in computer science

  Authors : Georg Gottlob , Gianluigi Greco , Bruno Marnette

  Journal reference : Volume , 2009, pp. 87-99

  DOI : 10.1007/978-3-642-02029-2_9