Statistical Cooling : A General Approach to Combinatorial Optimization Problems, Philips Journal of Research, vol.40, issue.14, 1985. ,
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
A Linear-Time Algorithm for Testing the Truth of Certain Quantied Boolean Formulas, Inf. Process. Lett, vol.8, issue.3, p.121123, 1979. ,
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
Complexity and approximation : Combinatorial optimization problems and their approximability properties, pp.22-26, 2000. ,
DOI : 10.1007/978-3-642-58412-1
On Chromatic Sums and Distributed Resource Allocation, Information and Computation, vol.140, issue.2, pp.183-202, 1998. ,
Dynamic programming, 2003. ,
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
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
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
An Algorithm Based on Hopeld Network Learning for Minimum Vertex Cover Problem, Advances in Neural Networks -ISNN 2004, p.430435, 2004. ,
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
The complexity of theorem-proving procedures, Proceedings of the third annual ACM symposium on Theory of computing, STOC '71, p.151158, 1971. ,
Introduction à l'algorithmique, 1990. ,
Paths, trees and matchings under disjunctive constraints, Discrete Applied Mathematics, vol.159, issue.16, p.17261735, 2011. ,
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. ,
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. ,
Fixed-Parameter Intractability, Structure in Complexity Theory Conference, p.3649, 1992. ,
Fixed-parameter tractability and completeness II : On completeness for W [1], Theoretical Computer Science, vol.141, issue.12, p.109131, 1995. ,
Heuristic search : Theory and applications, 2011. ,
On random graphs. I. Publ, Math. Debrecen, vol.6, p.290297, 1959. ,
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. ,
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
The Rectilinear Steiner Tree Problem is $NP$-Complete, SIAM Journal on Applied Mathematics, vol.32, issue.4, p.826834, 1977. ,
DOI : 10.1137/0132071
Computers and intractability : A guide to the theory of NP-completeness (series of books in the mathematical sciences, pp.8-20, 1979. ,
On Independent Sets and Bicliques in Graphs, Theoretic Concepts in Computer Science, p.171182, 2008. ,
URL : https://hal.archives-ouvertes.fr/hal-00460773
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
A Bounded Approximation for the Minimum Cost 2-Sat Problem, Algorithmica, vol.8, issue.2, p.103117, 1992. ,
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
Independent domination in hypercubes, Applied Mathematics Letters, vol.6, issue.3, pp.27-28, 1993. ,
Frédéric Havet Exact Algorithms for L(2,1)-Labeling of Graphs, Algorithmica, vol.59, issue.2, pp.169194-2011, 2011. ,
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
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
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
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. ,
A better approximation ratio for the vertex cover problem, ACM Transactions on Algorithms, vol.51418, issue.41, 2009. ,
Reducibility Among Combinatorial Problems, Complexity of Computer Computations, 1972. ,
An Evolutionary Heuristic for the Minimum Vertex Cover Problem, KI-94 Workshops (Extended Abstracts, p.8690, 1994. ,
The art of computer programming, volume i : Fundamental algorithms, 1968. ,
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
Local approximation schemes for ad hoc and sensor networks, DIALM-POMC, pages 97103, 2005. ,
An Automatic Method of Solving Discrete Programming Problems, Econometrica, vol.28, issue.3, p.497520, 1960. ,
An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph, J. ACM, vol.21, issue.4, p.569575, 1974. ,
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
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
Parameterized complexity of the clique partition problem, Proceedings of the fourteenth symposium on Computing : the Australasian theory, p.7578, 2008. ,
Combinatorial optimization : Algorithms and complexity, 1982. ,
The Knapsack Problem with Conict Graphs, 2009. ,
Matching theory. Numeéro n o 121 de Annals of discrete mathematics, 1986. ,
Linear graphs and electrical networks, 1961. ,
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
Practical mathematical optimization : An introduction to basic optimization theory and classical and new gradient-based algorithms. Applied Optimization, 2005. ,
The cauchy-schwarz master class : an introduction to the art of mathematical inequalities. MAA problem books series, 2004. ,
DOI : 10.1017/CBO9780511817106
Resolving conicts in problems from computational biology, 2000. ,
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
On Computable Numbers, with an application to the Entscheidungsproblem, Proceedings of the London Mathematical Society, p.230265, 1936. ,
Approximation algorithms, pp.12-84, 2001. ,
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
A new technique for optimization problems in graph theory. Computers, IEEE Transactions on, vol.47, issue.2, p.190196, 1998. ,
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
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