J. Abello, M. Resende, and S. Sudarsky, Massive quasi-clique detection, Lecture Notes in Computer Science, vol.2286, pp.598-612, 2002.

M. R. De-andrade, P. M. De-andrade, S. L. Martins, and A. Plastino, GRASP with path-relinking for the maximum diversity problem, Lecture Notes in Computer Science, vol.3503, pp.558-569, 2005.

D. V. Andrade, M. G. Resende, and R. F. Werneck, Fast local search for the maximum independent set problem, Journal of Heuristics, vol.18, issue.4, pp.525-547, 2012.

R. Aringhieri, M. Bruglieri, and R. Cordone, Optimal results and tight bounds for the maximum diversity problem, Foundations of Computing and Decision Sciences, vol.34, issue.2, pp.73-86, 2009.

R. Aringhieri and R. Cordone, Comparing local search metaheuristics for the maximum diversity problem, Journal of the Operational Research Society, vol.62, issue.2, pp.266-280, 2011.

G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. M. Spaccamela et al., Complexity and approximation: combinatorial optimization problems and their approximability properties, 1999.

L. Babel and G. Tinhofer, A branch and bound algorithm for the maximum clique problem, Methods and Models of Operations Research, vol.34, issue.3, pp.207-217, 1990.

B. Balasundaram and S. Butenko, Graph domination, coloring and cliques in telecommunications, Handbook of Optimization in Telecommunications, pp.865-890, 2006.

B. Balasundaram, S. Butenko, and I. V. Hicks, Clique relaxations in social network analysis: The maximum k-plex problem, Operations Research, vol.59, issue.1, pp.133-142, 2011.

D. Ballard and C. Brown, Computer Vision, 1982.

F. Barahona, A. Weintraub, and R. Epstein, Habitat dispersion in forest planning and the stable set problem, Operations Research, vol.40, issue.1, pp.14-21, 1992.

R. Battiti and G. Tecchiolli, The reactive tabu search, ORSA Journal on Computing, vol.6, issue.2, pp.126-140, 1994.

R. Battiti and M. Protasi, Reactive local search for the maximum clique problem, Algorithmica, vol.29, issue.4, pp.610-637, 2001.

R. Battiti and F. Mascia, Reactive and dynamic local search for the Max-Clique problem: engineering effective building blocks, Computers & Operations Research, vol.37, issue.3, pp.534-542, 2010.

U. Benlic and J. K. Hao, Breakout local search for maximum clique problems, Computers & Operations Research, vol.40, issue.1, pp.192-206, 2013.

M. Bhattacharyya and S. Bandyopadhyay, Mining the largest quasiclique in human protein interactome, Proceedings of IEEE International Conference on Artificial Intelligence Systems, pp.194-199, 2009.

A. Billionnet, Different formulations for solving the heaviest k-subgraph problem, Information Systems and Operational Research, vol.43, issue.3, pp.171-186, 2005.
URL : https://hal.archives-ouvertes.fr/hal-01124973

V. Boginski, S. Butenko, and P. M. Pardalos, Mining market data: a network approach, Computers & Operations Research, vol.33, issue.11, pp.3171-3184, 2006.

I. M. Bomze, M. Budinich, P. M. Pardalos, and M. Pelillo, The maximum clique problem, Handbook of combinatorial optimization, pp.1-74, 1999.

I. M. Bomze, M. Pelillo, and V. Stix, Approximating the maximum weight clique using replicator dynamics, IEEE Transactions on Neural Networks, vol.11, issue.6, pp.1228-1241, 2000.

N. Bourgeoisa, B. Escoffiera, and V. T. Paschosa, Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms, Discrete Applied Mathematics, vol.159, issue.17, pp.1954-1970, 2011.

N. Bourgeoisa, A. Giannakos, G. Lucarelli, I. Milis, V. T. Paschos et al., The max quasi-independent set problem, Journal of Combinatorial Optimization, vol.23, issue.1, pp.94-117, 2012.

N. Bourgeois, A. Giannakos, G. Lucarelli, I. Milis, and V. T. Paschos, Exact and approximation algorithms for densest k-subgraph, Lecture Notes in Computer Science, vol.7748, pp.114-125, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00874586

J. M. Bourjolly, G. Laporteb, and G. Pesant, An exact algorithm for the maximum k-club problem in an undirected graph, European Journal of Operational Research, vol.138, pp.21-28, 2002.

D. Brélaz, New methods to color the vertices of a graph, Communications of the ACM, vol.22, issue.4, pp.251-256, 1979.

J. Brimberg, N. Mladenovi?, D. Uro?evi?, and E. Ngai, Variable neighborhood search for the heaviest k-subgraph. Computers & Operations Research, vol.36, pp.2885-2891, 2009.

L. Brotcorne, G. Laporte, and F. Semet, Fast heuristic for large scale covering location problems, Computers & Operations Research, vol.29, issue.6, pp.651-665, 2002.

M. Brunato, H. Hoos, and R. Battiti, On effectively finding maximal quasi-cliques in graphs, Lecture Notes in Computer Science, vol.5313, pp.41-55, 2008.

E. Burke, E. Hart, G. Kendall, J. Newall, P. Ross et al., , 2003.

, Hyper-heuristics: an emerging direction in modern search technology

. Glover, Handbook of Meta-heuristics, pp.457-474

S. Burer, R. D. Monteiro, and Y. Zhang, Maximum stable set formulations and heuristics based on continuous optimization, Mathematical Programming, vol.94, issue.1, pp.137-166, 2002.

S. Busygin, A new trust region technique for the maximum weight clique problem, Discrete Applied Mathematics, vol.154, issue.15, pp.2080-2096, 2006.

S. Butenko, Maximum independent set and related problems, with applications, 2003.

S. Cai, K. Su, and Q. Chen, EWLS: A new local search for minimum vertex cover, Proc. of AAAI-10, pp.45-50, 2010.

S. Cai, K. Su, and A. Sattar, Local search with edge weighting and configuration checking heuristics for minimum vertex cover, Artificial Intelligence, vol.175, issue.9, pp.1672-1696, 2011.

R. Carmo and A. Züge, Branch and bound algorithms for the maximum clique problem under a unified framework, Journal of the Brazilian Computer Society, vol.18, issue.2, pp.137-151, 2012.

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.

B. Carter and K. Park, How good are genetic algorithms at finding large cliques: an experimental study, 1993.

M. W. Carter, G. Laporte, and S. Y. Lee, Examination timetabling: algorithmic strategies and applications, Journal of Operational Research Society, vol.47, issue.3, pp.373-383, 1996.

M. W. Carter and D. G. Johnson, Extended clique initialisation in examination timetabling, Journal of Operational Research Society, vol.52, issue.5, pp.538-544, 2001.

M. Chams, A. Hertz, and D. De-werra, Some experiments with simulated annealing for coloring graphs, European Journal of Operational Research, vol.32, issue.2, pp.260-266, 1987.

P. Chalermsook, B. Laekhanukit, and D. Nanongkai, Independent set, induced matching, and pricing: Connections and tight (subexponential time) approximation hardnesses, Proceedings of the 54th Annual Symposium on Foundations of Computer Science, pp.370-379, 2013.

B. Chandra and M. M. Halldórsson, Approximation algorithms for dispersion problems, Journal of Algorithms, vol.38, issue.2, pp.438-465, 2001.

F. Chen, H. Zhai, and Y. Fang, Available bandwidth in multirate and multihop wireless ad hoc networks, IEEE Journal on Selected Areas in Communications, vol.28, issue.3, pp.299-307, 2010.

R. Chitnis, M. Hajiaghayi, and G. Kortsarz, Fixed-parameter and approximation algorithms: a new look, Lecture Notes in Computer Science, vol.8246, pp.110-122, 2013.

N. Christofides, Graph theory, An algorithmic approach, 1975.

F. D. Croce, A. Grosso, and M. Locatelli, A heuristic approach for the max-min diversity problem based on max-clique, Computers & Operations Research, vol.36, issue.8, pp.2429-2433, 2009.

G. Dijkhuizen and U. Faigle, A cutting-plane approach to the edgeweighted maximal clique problem, European Journal of Operational Research, vol.69, issue.1, pp.121-130, 1993.

N. M. Dognin, R. Andonov, and N. Yanev, Maximum cliques in protein structure comparison, Lecture Notes in Computer Science, vol.6049, pp.106-117, 2010.
URL : https://hal.archives-ouvertes.fr/inria-00422198

U. Dorndorf, F. Jaehn, and E. Pesch, Modelling robust flight gate scheduling as a clique partitioning problem, Transportation Science, vol.42, issue.3, pp.292-301, 2008.

L. Engebretsen and J. Holmerin, Towards optimal lower bounds for clique and chromatic number, Theoretical Computer Science, vol.299, issue.1-3, pp.537-584, 2003.

T. Etzion and P. R. &östergård, Greedy and heuristic algorithms for codes and colorings, IEEE Transactions on Information Theory, vol.44, issue.1, pp.382-388, 1998.

T. Fahle, Simple and Fast: Improving a branch-and-bound algorithm for maximum clique, Lecture Notes in Computer Science, vol.2461, pp.485-498, 2002.

U. Feige, G. Kortsarz, and D. Peleg, The dense k-subgraph problem, Algorithmica, vol.29, issue.3, pp.410-421, 2001.

U. Feige, Approximating maximum clique by removing subgraphs, SIAM Journal on Discrete Mathematics, vol.18, issue.2, pp.219-225, 2004.

B. Feng, Z. Z. Jiang, Z. P. Fan, and N. Fu, A method for member selection of cross-functional teams using the individual and collaborative performances, European Journal of Operational Research, vol.203, issue.3, pp.652-661, 2010.

C. Fleurent and J. A. Ferland, Object-oriented implementation of heuristic search methods for graph coloring, maximum clique, and satisfiability. S, Johnson & Trick, pp.619-652, 1996.

C. Fleurent and J. A. Ferland, Genetic and hybrid algorithms for graph coloring, Annals of Operations Research, vol.63, issue.3, pp.437-461, 1996.

C. Friden, A. Hertz, and D. De-werra, Stabulus: a technique for finding stable sets in large graphs with tabu search, Computing, vol.42, issue.1, pp.35-44, 1989.

M. Gallego, A. Duarte, M. Laguna, and R. Martí, Hybrid heuristics for the maximum diversity problem, Computational Optimization and Applications, vol.44, issue.3, pp.411-426, 2009.

M. Gendreau, P. Soriano, and L. Salvail, Solving the maximum clique problem using a tabu search approach, Annals of Operations Research, vol.41, issue.4, pp.385-403, 1993.

F. Gortázar, A. Duarte, M. Laguna, and R. Martí, Black box scatter search for general classes of binary optimization problems, Computers & Operations Research, vol.37, issue.11, pp.1977-1986, 2010.

A. Grosso, M. Locatelli, and F. D. Croce, Combining swaps and node weights in an adaptive greedy approach for the maximum clique problem, Journal of Heuristics, vol.10, issue.2, pp.135-152, 2004.

A. Grosso, M. Locatelli, and W. Pullan, Simple ingredients leading to very efficient heuristics for the maximum clique problem, Journal of Heuristics, vol.14, issue.6, pp.587-612, 2008.

P. Guturu and R. Dantu, An impatient evolutionary algorithm with probabilistic tabu search for unified solution of some NP-Hard problems in graph and set theory via clique finding, IEEE Transactions on Systems, Man, and Cybernetics, vol.38, issue.3, pp.645-666, 2008.

P. Hansen, N. Mladenovi?, and D. Uro?evié, Variable neighborhood search for the maximum clique, Discrete Applied Mathematics, vol.145, issue.1, pp.117-125, 2004.

J. K. Hao, Memetic algorithms in discrete optimization, Studies in Computational Intelligence, vol.379, pp.73-94, 2012.

J. Håstad, Clique is hard to approximate within n 1??, Acta Mathematica, vol.182, issue.1, pp.105-142, 1999.

T. S. Motzkin and E. G. Straus, Maxima for graphs and a new proof of a theorem of Turán, Canadian Journal of Mathematics, vol.17, pp.533-540, 1965.

A. Jagota and L. A. Sanchis, Adaptive, restart, randomized greedy heuristics for maximum clique, Journal of Heuristics, vol.7, issue.6, pp.565-585, 2001.

K. Jain, J. Padhye, V. N. Padmanabhan, and L. Qiu, Impact of interference on multi-hop wireless network performance, Wireless Networks, vol.11, issue.4, pp.471-487, 2005.

Y. Jin and J. K. Hao, General swap-based multiple neighborhood tabu search for finding maximum independent set, Engineering Application of Artificial Intelligence, vol.37, pp.20-33, 2015.

D. S. Johnson and M. A. Trick, Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol.26, 1996.

R. M. Karp, Reducibility among combinatorial problems, Complexity of Computer Computations, pp.85-103, 1972.

K. Katayama, A. Hamamoto, and H. Narihisa, An effective local search for the maximum clique problem, Information Processing Letters, vol.95, issue.5, pp.503-511, 2005.

S. Khot, Improved inapproximability results for maxclique, chromatic number and approximate graph coloring, Proceedings of the 42nd IEEE Annual Symposium on Foundations of Computer Science, pp.600-609, 2001.

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

D. Kumlander, A new exact algorithm for the maximum-weight clique problem based on a heuristic vertex-coloring and a backtrack search, Proceedings of The Forth International Conference on Engineering Computational Technology, pp.202-208, 2004.

D. Kumlander, Problems of optimization: an exact algorithm for finding a maximum clique optimized for dense graphs, Proceedings of the Estonian Academy of Sciences, vol.54, pp.79-86, 2005.

M. J. Kuby, Programming models for facility dispersion: the p-dispersion and maxisum dispersion problems, Geographical Analysis, vol.19, issue.4, pp.315-329, 1987.

C. Li and Z. Quan, An efficient branch-and-bound algorithm based on MaxSAT for the maximum clique problem, Proceedings of the 24th AAAI Conference on Artificial Intelligence, pp.128-133, 2010.

M. Lozano, D. Molina, and C. García-martínez, Iterated greedy for the maximum diversity problem, European Journal of Operational Research, vol.214, issue.1, pp.31-38, 2011.

E. M. Macambira, An application of tabu search heuristic for the maximum edge weighted subgraph problem, Annals of Operational Research, vol.117, issue.1-4, pp.175-190, 2003.

C. Mannino and A. Sassano, Edge projection and the maximum cardinality stable set problem, DIMACS series in Discrete Mathematics and Theoretical Computer Science, vol.26, pp.249-261, 1996.

C. Mannino and E. Stefanutti, An augmentation algorithm for the maximum weighted stable set problem, Computational Optimization and Applications, vol.14, issue.3, pp.367-381, 1999.

E. Marchiori, Genetic, iterated and multistart local search for the maximum clique problem, Lecture Notes in Computer Science, vol.2279, pp.112-121, 2002.

R. Martí, M. Gallego, A. Duarte, and E. G. Pardo, Heuristics and metaheuristics for the maximum diversity problem, Journal of Heuristics, vol.19, issue.4, pp.591-615, 2013.

R. Martí, M. Gallego, and A. Duarte, A branch and bound algorithm for the maximum diversity problem, European Journal of Operational Research, vol.200, issue.1, pp.36-44, 2010.

P. Martins, Extended and discretized formulations for the maximum clique problem, Computers & Operations Research, vol.37, issue.7, pp.1348-1358, 2011.

P. Martins, Cliques with maximum/minimum edge neighborhood and neighborhood density, Computers & Operations Research, vol.39, issue.3, pp.594-608, 2012.

E. Maslov, M. Batsyn, and P. M. Pardalos, Speeding up branch and bound algorithms for solving the maximum clique problem, Journal of Global Optimization, vol.59, issue.1, pp.1-21, 2013.

A. Massaro, M. Pelillo, and I. M. Bomze, A complementary pivoting approach to the maximum weight clique problem, SIAM Journal on Optimization, vol.12, issue.4, pp.928-948, 2001.

H. Matsuda, T. Ishihara, and A. Hashimoto, Classifying molecular sequences using a linkage graph with their pairwise similarities, Theoretical Computer Science, vol.210, issue.2, pp.305-325, 1999.

C. Mccreesh and P. Prosser, Multi-threading a state-of-the-art maximum clique algorithm, Algorithms, vol.6, issue.4, pp.618-635, 2013.

G. L. Nemhauser and L. E. Trotter, Vertex packing: structural properties and algorithms. Mathematical Programming, vol.8, pp.232-248, 1975.

P. R. Ostergård, A fast algorithm for the maximum clique problem, Discrete Applied Mathematics, vol.120, issue.1, pp.197-207, 2002.

P. R. Ö-stergård, A new algorithm for the maximum-weight clique problem, Electronic Notes in Discrete Mathematics, vol.3, pp.153-156, 1999.

F. M. Pajouh, Z. Miao, and B. Balasundaram, A branch-and-bound approach for maximum quasi-cliques, Annals of Operations Research, vol.216, issue.1, pp.145-161, 2014.

G. Palubeckis, Iterated tabu search for the maximum diversity problem, Applied Mathematics and Computation, vol.189, issue.1, pp.371-383, 2007.

P. M. Pardalos and J. Xue, The maximum clique problem, Journal of Global Optimization, vol.4, issue.3, pp.301-328, 1994.

K. Park, K. Lee, and S. Park, An extended formulation approach to the edge-weighted maximal clique problem, European Journal of Operational Research, vol.95, issue.3, pp.671-682, 1996.

J. Pattillo, N. Youssef, and S. Butenko, Clique relaxation models in social network analysis, Handbook of Optimization in Complex Networks: Theory and Applications. Springer Optimization and Its Applications, vol.58, pp.143-162, 2012.

J. Patillo, A. Veremyev, S. Butenko, and V. Boginski, On the maximum quasi-clique problem, Discrete Applied Mathematics, vol.161, issue.1-2, pp.244-257, 2013.

J. Pei, D. Jiang, and A. Zhang, On mining cross-graph quasi-cliques, Proceedings of the 11th ACM SIGKDD International Conference on Knowledge Discovery in Data Mining, pp.228-238, 2005.

P. Prosser, Exact Algorithms for Maximum Clique: A Computational Study, Algorithms, vol.5, issue.4, pp.545-587, 2012.

W. Pullan, Phased local search for the maximum clique problem, Journal of Combinatorial Optimization, vol.12, issue.3, pp.303-323, 2006.

W. Pullan and H. H. Hoos, Dynamic local search for the maximum clique problem, Journal of Artificial Intelligence Research, vol.25, pp.159-185, 2006.

W. Pullan, Approximating the maximum vertex/edge weighted clique using local search, Journal of Heuristics, vol.14, issue.2, pp.117-134, 2008.

W. Pullan, F. Mascia, and M. Brunato, Cooperating local search for the maximum clique problem, Journal of Heuristics, vol.17, issue.2, pp.181-199, 2011.

M. G. Ravetti and P. Moscato, Identification of a 5-protein biomarker molecular signature for predicting alzheimer's disease, Plos One, vol.3, issue.9, p.3111, 2008.

S. S. Ravi, D. J. Rosenkrantz, and G. K. Tayi, Heuristic and special case algorithms for dispersion problems, Operations Research, vol.42, issue.2, pp.299-310, 1994.

S. Rebennack, M. Oswald, D. O. Theis, H. Seitz, G. Reinelt et al., A branch and cut solver for the maximum stable set problem, Journal of Combinatorial Optimization, vol.21, issue.4, pp.434-457, 2011.

S. Rebennack, G. Reineltb, and P. M. Pardalos, A tutorial on branch and cut algorithms for the maximum stable set problem, International Transactions in Operational Research, vol.19, issue.1-2, pp.161-199, 2012.

J. C. Régin, Solving the maximum clique problem with constraint programming, Lecture Notes in Computer Science, vol.2833, pp.634-648, 2003.

S. Richter, M. Helmert, and C. Gretton, A stochastic local search approach to vertex cover, Proceedings of the 30th German Conference on Artificial Intelligence, pp.412-426, 2007.

F. Rossi and S. Smriglio, A branch-and-cut algorithm for the maximum cardinality stable set problem, Operations Research Letters, vol.28, issue.2, pp.63-74, 2001.

S. E. Schaeffer, Graph clustering, Computer Science Review, vol.1, issue.1, pp.27-64, 2007.

P. S. Segundo, F. Matia, D. Rodriguez-losada, and M. Hernando, An improved bit parallel exact maximum clique algorithm, Optimization Letters, vol.7, issue.3, pp.467-479, 2013.

P. S. Segundo, D. Rodríguez-losada, and A. Jiménez, An exact bitparallel algorithm for the maximum clique problem, Computers & Operations Research, vol.38, issue.2, pp.571-581, 2011.

Y. Shoham, P. Cramton, and R. Steinberg, , 2006.

N. Z. Shor, Dual quadratic estimates in polynomial and Boolean programming, Annals of Operations Research, vol.25, issue.1, pp.163-168, 1990.

G. C. Silva, M. R. De-andrade, L. S. Ochi, S. L. Martins, and A. Plastino, New heuristics for the maximum diversity problem, Journal of Heuristics, vol.13, issue.4, pp.315-336, 2007.

A. Singh and A. K. Gupta, A hybrid heuristic for the maximum clique problem, Journal of Heuristics, vol.12, issue.1-2, pp.5-22, 2006.

A. Singh and A. K. Gupta, A hybrid evolutionary approach to maximum weight clique problem, International Journal of Computational Intelligence Research, vol.2, issue.4, pp.349-355, 2006.

C. Solnon and S. Fenet, A study of aco capabilities for solving the maximum clique problem, Journal of Heuristics, vol.12, issue.3, pp.158-180, 2006.

M. M. Sørensen, New facets and a branch-and-cut algorithm for the weighted clique problem, European Journal of Operational Research, vol.154, issue.1, pp.57-70, 2004.

E. Tomita and T. Seki, An efficient branch-and-bound algorithm for finding a maximum clique, Lecture Notes in Computer Science, vol.2731, pp.278-289, 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.37, issue.1, pp.95-111, 2007.

E. Tomita, Y. Sutani, T. Higashi, S. Takahashi, and M. Wakatsuki, A simple and faster branch-andbound algorithm for finding a maximum clique, Lecture Notes in Computer Science, vol.5942, pp.191-203, 2010.

H. Wang, B. Alidaee, F. Glover, and G. Kochenberger, Solving group technology problem via clique partitioning, International Journal of Flexible Manufacturing Systems, vol.18, issue.2, pp.77-97, 2006.

Y. Wang, J. K. Hao, F. Glover, and Z. P. Lü, A tabu search based memetic algorithm for the maximum diversity problem, Engineering Applications of Artificial Intelligence, vol.27, pp.103-114, 2014.

J. S. Warren and I. V. Hicks, Combinatorial branch-and-bound for the maximum weight independent set problem, 2006.

O. Weide, D. Ryan, and M. Ehrgott, An iterative approach to robust and integrated aircraft routing and crew scheduling, Computers & Operations Research, vol.37, issue.5, pp.833-844, 2010.

Q. Wu and J. K. Hao, Coloring large graphs based on independent set extraction, Computers & Operations Research, vol.39, issue.2, pp.283-290, 2012.

Q. Wu and J. K. Hao, An effective heuristic algorithm for sum coloring of graphs, Computers & Operations Research, vol.39, issue.7, pp.1593-1600, 2012.

Q. Wu, J. K. Hao, and F. Glover, Multi-neighborhood tabu search for the maximum weight clique problem, Annals of Operations Research, vol.196, issue.1, pp.611-634, 2012.

Q. Wu and J. K. Hao, An adaptive multistart tabu search approach to solve the maximum clique problem, Journal of Combinatorial Optimization, vol.26, issue.1, pp.86-108, 2011.

Q. Wu and J. K. Hao, A hybrid metaheuristic method for the maximum diversity problem, European Journal of Operational Research, vol.231, issue.2, pp.452-464, 2013.

J. Xiang, C. Guo, and A. Aboulnaga, Scalable Maximum Clique Computation Using MapReduce, IEEE 29th International Conference on Data Engineering, pp.74-85, 2013.

K. Xu, F. Boussemart, F. Hemery, and C. Lecoutre, A simple model to generate hard satisfiable instances, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence (IJCAI-05), pp.337-342, 2005.
URL : https://hal.archives-ouvertes.fr/hal-00396466

K. Xu, F. Boussemart, F. Hemery, and C. Lecoutre, Random constraint satisfaction: easy generation of hard (satisfiable) instances, Artificial intelligence, vol.171, issue.8-9, pp.514-534, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00191088

G. Yang, J. Yi, Z. Zhang, and Z. Tang, A TCNN filter algorithm to maximum clique problem, Neurocomputing, vol.72, issue.4-6, pp.1312-1318, 2009.

Z. Zeng, J. Wang, L. Zhou, and G. Karypis, Out-of-core coherent closed quasi-clique mining from large dense graph databases, ACM Transactions on Database System, vol.32, issue.2, p.13, 2007.

Q. Zhang, J. Sun, and E. Tsang, An evolutionary algorithm with guided mutation for the maximum clique problem, IEEE Transactions on Evolutionary Computation, vol.9, issue.2, pp.192-200, 2005.

D. Zuckerman, Linear degree extractors and the inapproximability of max clique and chromatic number, Proceedings of the 38th ACM Symposium on Theory of Computing, pp.681-690, 2006.