R. Carraghan and P. M. Pardalos, An exact algorithm for the maximum clique problem, Operations Research Letters, vol.9, issue.6, pp.375-382, 1990.
DOI : 10.1016/0167-6377(90)90057-C

T. Fahle, Simple and Fast: Improving a Branch-And-Bound Algorithm for Maximum Clique, Proceedings of ESA-2002, pp.485-498, 2002.
DOI : 10.1007/3-540-45749-6_44

F. Heras and J. Larrosa, A Max-SAT Inference-Based Preprocessing for Max-Clique, in proceedings of SAT, LNCS, vol.4996, pp.139-152, 2008.

F. Heras, J. Larrosa, and A. Oliveras, MiniMaxSAT : An efficient weighted Max-SAT solver, Journal of Artificial Intelligence Research, vol.31, pp.1-32, 2008.

J. Konc and D. , Janezic, An improved branch and bound algorithm for the maximum clique problem, Communications in Mathematical and in Computer Chemistry, vol.58, pp.569-590, 2007.

C. M. Li and F. Manyà, Max-sat, hard and soft constraints, Handbook of Satisfiability. Pages, pp.613-631, 2009.

C. M. Li, F. Manyà, and J. Planes, New inference rules for Max-SAT, Journal of Artificial Intelligence Research, vol.30, pp.321-359, 2007.

C. M. Li, F. Manyà, and J. , Planes, Detecting disjoint inconsistent subformulas for computing lower bounds for maxsat, Proceedings of AAAI'06, pp.86-91, 2006.

C. M. Li, F. Manyà, and J. Planes, Exploiting unit propagation to compute lower bounds in branch and bound MaxSAT solvers, proceedings of CP'05, pp.403-414, 2005.

P. R. Ostergard, A fast algorithm for the maximum clique problem, Discrete Applied Mathematics, vol.120, issue.1-3, pp.197-207, 2002.
DOI : 10.1016/S0166-218X(01)00290-6

P. M. Pardalos and J. Xue, The maximum clique problem, Journal of Global Optimization, vol.46, issue.1, pp.301-328, 1994.
DOI : 10.1007/BF01098364

W. Pullan and H. H. Hoos, Dynamic Local Search for the Maximum Clique Problem Solving the maximum clique problem with constraint programming, Proceedings of CPAIOR'03, pp.159-185, 2003.

E. Tomita and T. Kameda, An Efficient Branch-and-bound Algorithm for Finding a Maximum Clique with Computational Experiments, Journal of Global Optimization, vol.21, issue.1, pp.95-111, 2007.
DOI : 10.1007/s10898-006-9039-7

E. Tomita and T. Seki, An Efficient Branch-and-Bound Algorithm for Finding a Maximum Clique, Proc. Discrete Mathematics and Theoretical Computer Science. LNCS 2731, pp.278-289, 2003.
DOI : 10.1007/3-540-45066-1_22