]. E. Aarts-1985, P. J. Aarts, and . Van-laarhoven, Statistical Cooling : A General Approach to Combinatorial Optimization Problems, Philips Journal of Research, vol.40, issue.14, 1985.

A. Allahverdi and S. Fawaz, A branch-and-bound algorithm for three-machine flowshop scheduling problem to minimize total completion time with separate setup times, European Journal of Operational Research, vol.169, issue.3, pp.767-780, 2006.
DOI : 10.1016/j.ejor.2004.07.074

. Aspvall, M. F. Aspvall, and . Plass-et-robert-endre-tarjan, A Linear-Time Algorithm for Testing the Truth of Certain Quantied Boolean Formulas, Inf. Process. Lett, vol.8, issue.3, p.121123, 1979.

A. Atamtürk, G. L. Nemhauser, W. P. Martin, and . Savelsbergh, Conflict graphs in solving integer programming problems, European Journal of Operational Research, vol.121, issue.1, pp.40-55, 2000.
DOI : 10.1016/S0377-2217(99)00015-6

]. G. Ausiello, P. Crescenzi, V. Kann, G. Marchetti-sp, A. M. Gambosi et al., Complexity and approximation : Combinatorial optimization problems and their approximability properties, pp.22-26, 2000.
DOI : 10.1007/978-3-642-58412-1

M. Noy, . Bellare, M. Magnús, H. Halldórsson, T. Shachnai et al., On Chromatic Sums and Distributed Resource Allocation, Information and Computation, vol.140, issue.2, pp.183-202, 1998.

]. and E. Bellman, Dynamic programming, 2003.

]. N. Bourgeois, F. Croce, B. Escoer, V. Th, and . Paschos, Exact Algorithms for Dominating Clique Problems, Algorithms and Computation Lecture Notes in Computer Science, vol.5878, p.413, 2009.
DOI : 10.1007/978-3-642-10631-6_3

URL : https://hal.archives-ouvertes.fr/hal-00877043

]. Bourgeois, B. Escoer, V. Th, and . Paschos, Fast algorithms for min independent dominating set, Discrete Applied Mathematics, vol.161, issue.4-5, 1993.
DOI : 10.1016/j.dam.2012.01.003

URL : https://hal.archives-ouvertes.fr/hal-01508849

J. Cheetham, F. Dehne, A. Rau-chaplin, U. Stege, J. Peter et al., Solving large FPT problems on coarse-grained parallel machines, Journal of Computer and System Sciences, vol.67, issue.4, p.691706, 2003.
DOI : 10.1016/S0022-0000(03)00075-8

X. Chen, Z. Tang, X. Xu, S. Li, G. Xia et al., An Algorithm Based on Hopeld Network Learning for Minimum Vertex Cover Problem, Advances in Neural Networks -ISNN 2004, p.430435, 2004.

]. Chen, A. Iyad, G. Kanj, and . Xia, Improved upper bounds for vertex cover, Theoretical Computer Science, vol.411, issue.40-42, pp.40-42, 2010.
DOI : 10.1016/j.tcs.2010.06.026

A. Stephen and . Cook, The complexity of theorem-proving procedures, Proceedings of the third annual ACM symposium on Theory of computing, STOC '71, p.151158, 1971.

H. Thomas, C. E. Cormen, R. L. Leiserson, C. Rivest, and . Stein, Introduction à l'algorithmique, 1990.

. Woeginger, Paths, trees and matchings under disjunctive constraints, Discrete Applied Mathematics, vol.159, issue.16, p.17261735, 2011.

]. F. Delbot, Au delà de l'évaluationvaluation en pire cas : comparaison et évaluationvaluation en moyenne de processus d'optimisation pour le problème du vertex cover et des arbres de connexion de groupes dynamiques, 2009.

J. Denzinger, M. Fuchs, and M. Fuchs, High performance ATP systems by combining several AI methods, Proceedings of the 15th international joint conference on Artical intelligence -Volume 1, IJCAI'97, p.102107, 1997.

G. Rodney, M. R. Downey, and . Fellows, Fixed-Parameter Intractability, Structure in Complexity Theory Conference, p.3649, 1992.

G. Rod, M. R. Downey, and . Fellows, Fixed-parameter tractability and completeness II : On completeness for W [1], Theoretical Computer Science, vol.141, issue.12, p.109131, 1995.

]. S. Edelkamp and S. Schroedl, Heuristic search : Theory and applications, 2011.

]. P. Erd®s and A. Rényi, On random graphs. I. Publ, Math. Debrecen, vol.6, p.290297, 1959.

L. Bruno-escoer, J. Gourvès, and . Monnot, Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs, J. Discrete Algorithms, vol.8, issue.1, pp.3649-2010, 2010.

]. M. Garey, D. S. Johnson, and L. Stockmeyer, Some simplified NP-complete graph problems, Theoretical Computer Science, vol.1, issue.3, pp.237-267, 1976.
DOI : 10.1016/0304-3975(76)90059-1

URL : http://doi.org/10.1016/0304-3975(76)90059-1

]. M. Garey and D. S. Johnson, The Rectilinear Steiner Tree Problem is $NP$-Complete, SIAM Journal on Applied Mathematics, vol.32, issue.4, p.826834, 1977.
DOI : 10.1137/0132071

R. Michael, D. S. Garey, and . Johnson, Computers and intractability : A guide to the theory of NP-completeness (series of books in the mathematical sciences, pp.8-20, 1979.

S. Gaspers, D. Kratsch, and M. Liedlo, On Independent Sets and Bicliques in Graphs, Theoretic Concepts in Computer Science, p.171182, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00460773

]. Gaspers, D. Kratsch, and M. Liedlo, On Independent Sets and Bicliques in Graphs, Algorithmica, vol.62, issue.3-4, pp.637658-2012, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00460773

D. Guseld and L. Pitt, A Bounded Approximation for the Minimum Cost 2-Sat Problem, Algorithmica, vol.8, issue.2, p.103117, 1992.

T. Peter-hahn, N. Grant, and . Hall, A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method, European Journal of Operational Research, vol.108, issue.3, pp.629-640, 1998.
DOI : 10.1016/S0377-2217(97)00063-5

H. Frank and M. Livingston, Independent domination in hypercubes, Applied Mathematics Letters, vol.6, issue.3, pp.27-28, 1993.

D. Kratochvil, M. Kratsch, and . Liedlo, Frédéric Havet Exact Algorithms for L(2,1)-Labeling of Graphs, Algorithmica, vol.59, issue.2, pp.169194-2011, 2011.

]. R. Hwang, R. C. Chang, and R. C. Lee, The searching over separators strategy to solve some NP-hard problems in subexponential time, Algorithmica, vol.133, issue.No. 1, p.398423, 1993.
DOI : 10.1007/BF01228511

K. Jansen and S. Öhring, Approximation algorithms for time constrained scheduling, Proceedings 1st International Conference on Algorithms and Architectures for Parallel Processing, pp.85-108, 1997.
DOI : 10.1109/ICAPP.1995.472254

D. S. Johnson and C. H. , Papadimitriou et Mihalis Yannakakis On Generating All Maximal Independent Sets, Inf. Process. Lett, vol.27, issue.3, p.119123, 1988.
DOI : 10.1016/0020-0190(88)90065-8

C. Mamadou-moustapha-kanté, B. Laforest, and . Momège, An Exact Algorithm to Check the Existence of (Elementary) Paths and a Generalisation of the Cut Problem in Graphs with Forbidden Transitions, In SOFSEM Lecture Notes in Computer Science, vol.7741, pp.257267-2013, 2013.

]. Karakostas, A better approximation ratio for the vertex cover problem, ACM Transactions on Algorithms, vol.51418, issue.41, 2009.

M. Richard and . Karp, Reducibility Among Combinatorial Problems, Complexity of Computer Computations, 1972.

K. Sami and T. Bäck, An Evolutionary Heuristic for the Minimum Vertex Cover Problem, KI-94 Workshops (Extended Abstracts, p.8690, 1994.

E. Donald and . Knuth, The art of computer programming, volume i : Fundamental algorithms, 1968.

]. M. Krom, The Decision Problem for a Class of First-Order Formulas in Which all Disjunctions are Binary, Zeitschrift f??r Mathematische Logik und Grundlagen der Mathematik, vol.24, issue.1-2, p.1520, 1967.
DOI : 10.1002/malq.19670130104

T. Fabian-kuhn, T. Nieberg, R. Moscibroda, and . Wattenhofer, Local approximation schemes for ad hoc and sensor networks, DIALM-POMC, pages 97103, 2005.

]. A. Land and A. Doig, An Automatic Method of Solving Discrete Programming Problems, Econometrica, vol.28, issue.3, p.497520, 1960.

G. H. Philippe and . Lehot, An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph, J. ACM, vol.21, issue.4, p.569575, 1974.

]. C. Liu and Y. Song, Exact Algorithms for Finding the Minimum Independent Dominating Set in Graphs, ISAAC LNCS, vol.4288, issue.30, pp.439448-439477, 2006.
DOI : 10.1007/11940128_45

]. V. Menon, The isomorphism between graphs and their adjoint graphs, Bulletin canadien de math??matiques, vol.8, issue.0, p.716, 1965.
DOI : 10.4153/CMB-1965-002-7

E. Mujuni and F. Rosamond, Parameterized complexity of the clique partition problem, Proceedings of the fourteenth symposium on Computing : the Australasian theory, p.7578, 2008.

H. Christos, K. Papadimitriou, and . Steiglitz, Combinatorial optimization : Algorithms and complexity, 1982.

U. Pferschy and J. Schauer, The Knapsack Problem with Conict Graphs, 2009.

]. D. Plummer and L. Lovász, Matching theory. Numeéro n o 121 de Annals of discrete mathematics, 1986.

]. S. Seshu, Linear graphs and electrical networks, 1961.

]. Shyu, . T. Peng-yeng-yin-et-bertrandm, and . Lin, An Ant Colony Optimization Algorithm for the Minimum Weight Vertex Cover Problem, Annals of Operations Research, vol.131, issue.1-4, p.283304, 2004.
DOI : 10.1023/B:ANOR.0000039523.95673.33

]. J. Snyman, Practical mathematical optimization : An introduction to basic optimization theory and classical and new gradient-based algorithms. Applied Optimization, 2005.

]. J. Steele-2004 and . Steele, The cauchy-schwarz master class : an introduction to the art of mathematical inequalities. MAA problem books series, 2004.
DOI : 10.1017/CBO9780511817106

U. Stege, Resolving conicts in problems from computational biology, 2000.

]. J. Troya and M. Ortega, A study of parallel branch-and-bound algorithms with best-bound-first search, Parallel Computing, vol.11, issue.1, pp.121-126, 1989.
DOI : 10.1016/0167-8191(89)90069-0

A. M. Turing, On Computable Numbers, with an application to the Entscheidungsproblem, Proceedings of the London Mathematical Society, p.230265, 1936.

V. Vijay and . Vazirani, Approximation algorithms, pp.12-84, 2001.

J. Xu and . Ma, An efficient simulated annealing algorithm for the minimum vertex cover problem, New Issues in Neurocomputing : 13th European Symposium on Articial Neural Networks</ce :title> <xocs :full-name>13th European Symposium on Articial Neural Networks 2005. (Cité en page 66, pp.913-916, 2006.
DOI : 10.1016/j.neucom.2005.12.016

. Shih-yi-yuan, . Sy-yen, and . Kuo, A new technique for optimization problems in graph theory. Computers, IEEE Transactions on, vol.47, issue.2, p.190196, 1998.

]. Zhang, Q. Ge, R. Fleischer, T. Jiang, and H. Zhu, Approximating the minimum weight weak vertex cover, Theoretical Computer Science, vol.363, issue.1, pp.99-105, 2006.
DOI : 10.1016/j.tcs.2006.06.009

]. Zhang, N. Santosh, A. P. Kabadi, and . Punnen, The minimum spanning tree problem with conflict constraints and its variations, Discrete Optimization, vol.8, issue.2, pp.191-205, 2011.
DOI : 10.1016/j.disopt.2010.08.001