| 115 | -- | 144 | Clément Carbonnel, Martin C. Cooper. Tractability in constraint satisfaction problems: a survey |
| 145 | -- | 162 | Jean-Guillaume Fages, Xavier Lorca, Louis-Martin Rousseau. The salesman and the tree: the importance of search in CP |
| 163 | -- | 197 | Anastasia Paparrizou, Kostas Stergiou. Strong local consistency algorithms for table constraints |
| 198 | -- | 222 | Evgenij Thorstensen. Structural decompositions for problems with global constraints |
| 223 | -- | 250 | Mark H. Liffiton, Alessandro Previti, Ammar Malik, Joao Marques-Silva. Fast, flexible MUS enumeration |
| 251 | -- | 276 | Faten Nabli, Thierry Martinez, François Fages, Sylvain Soliman. On enumerating minimal siphons in Petri nets using CLP and SAT solvers: theoretical and practical complexity |
| 277 | -- | 302 | Alexey Ignatiev, Mikolás Janota, Joao Marques-Silva. Quantified maximum satisfiability |
| 303 | -- | 317 | Amira Dems, Louis-Martin Rousseau, Jean-Marc Frayret. A hybrid constraint programming approach to a wood procurement problem with bucking decisions |
| 318 | -- | 348 | Luca Di Gaspero, Andrea Rendl, Tommaso Urli. Balancing bike sharing systems with constraint programming |
| 349 | -- | 354 | El Mehdi El Graoui, Imade Benelallam, El-Houssine Bouyakhf. A commentary on "Hybrid search for minimal perturbation in Dynamic CSPs" |