T. Benoist, A dynamic programming approach, IJCAI'05 Fifth Workshop on Modelling and Solving Problems with Constraints, 2005.

C. Bron and J. Kerbosch, Algorithm 457: finding all cliques of an undirected graph, Communications of the ACM, vol.16, issue.9, pp.575-577, 1973.
DOI : 10.1145/362342.362367

H. Cambazard and N. Jussien, Identifying and exploiting problem structures using explanation-based constraint programming, Proceedings (CP-AI-OR'05), pp.94-109, 2005.
URL : https://hal.archives-ouvertes.fr/hal-00869105

J. L. De-siqueira and J. F. Puget, Explanationbased generalisation of failures, Proceedings (ECAI'88), pp.339-344, 1988.

M. Garcia-de, L. Banda, and P. J. Stuckey, Dynamic programming to minimize the maximum number of open stacks, IJCAI'05 Fifth Workshop on Modelling and Solving Problems with Constraints, 2005.

U. Junker, QUICKXPLAIN : Conflict detection for arbitrary constraint propagation algorithms, IJCAI'01 Workshop on Modelling and Solving problems with constraints, 2001.

G. Katsirelos and F. Bacchus, Generalized nogoods in csps, National Conference on Artificial Intelligence (AAAI-2005), pp.390-396, 2005.

E. Donald and . Knuth, Sorting and Searching, volume 3 of The Art of Computer Programming, pp.492-512, 1997.

M. W. Moskewicz, C. F. Madigan, Y. Zhao, L. Zhang, and S. Malik, Chaff, Proceedings of the 38th conference on Design automation , DAC '01, 2001.
DOI : 10.1145/378239.379017

T. Schiex and G. Verfaillie, NOGOOD RECORDING FOR STATIC AND DYNAMIC CONSTRAINT SATISFACTION PROBLEMS, International Journal on Artificial Intelligence Tools, vol.03, issue.02, pp.187-207, 1994.
DOI : 10.1142/S0218213094000108

P. Shaw and P. Laborie, A constraint programming approach to the min-stack problem, IJ- CAI'05 Fifth Workshop on Modelling and Solving Problems with Constraints, 2005.

B. Smith and I. Gent, Constraint modelling challenge, IJCAI'05 Fifth Workshop on Modelling and Solving Problems with Constraints, 2005.