Tractability in constraint satisfaction problems: a survey Clément CarbonnelMartin C. Cooper Survey 21 July 2015 Pages: 115 - 144
The salesman and the tree: the importance of search in CP Jean-Guillaume FagesXavier LorcaLouis-Martin Rousseau OriginalPaper 06 December 2014 Pages: 145 - 162
Strong local consistency algorithms for table constraints Anastasia PaparrizouKostas Stergiou OriginalPaper 30 January 2015 Pages: 163 - 197
Structural decompositions for problems with global constraints Evgenij Thorstensen OriginalPaper 19 February 2015 Pages: 198 - 222
Fast, flexible MUS enumeration Mark H. LiffitonAlessandro PrevitiJoao Marques-Silva OriginalPaper 22 March 2015 Pages: 223 - 250
On enumerating minimal siphons in Petri nets using CLP and SAT solvers: theoretical and practical complexity Faten NabliThierry MartinezSylvain Soliman OriginalPaper 10 April 2015 Pages: 251 - 276
Quantified maximum satisfiability Alexey IgnatievMikoláš JanotaJoao Marques-Silva OriginalPaper 24 May 2015 Pages: 277 - 302
A hybrid constraint programming approach to a wood procurement problem with bucking decisions Amira DemsLouis-Martin RousseauJean-Marc Frayret OriginalPaper 11 June 2015 Pages: 303 - 317
Balancing bike sharing systems with constraint programming Luca Di GasperoAndrea RendlTommaso Urli Application 26 February 2015 Pages: 318 - 348
A commentary on “Hybrid search for minimal perturbation in Dynamic CSPs” El Mehdi El GraouiImade BenelallamEl Houssine Bouyakhf Commentary 19 August 2015 Pages: 349 - 354