.. Abstraction-et-généralisation-de-la-technique, Algorithme pour les problèmes à une seule contrainte, p.155

. Dans-la-suite, nous commençons par abstraire la technique trier-et-chercher puis nous la généralisons . Essentiellement, nous montrons qu'il est possible de considérer des problèmes à plusieurs contraintes et de continuer d'utiliser l'approche

A. , F. N. Mouawad, A. E. Et, L. , and M. , An exact algorithm for connected red-blue dominating set, J. Discrete Algorithms, vol.9, issue.3, pp.252-262, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00461066

A. , N. Et, W. , N. , G. Schrijver et al., High Degree Graphs Contain Large-Star Factors, KATONA, pp.9-21, 2010.

A. , S. Et, B. , and B. , Computational Complexity : A Modern Approach, 2009.

B. , E. Et, F. , and J. , A finite-difference sieve to count paths and cycles by length, Information Processing Letters, vol.60, issue.4, pp.171-176, 1996.

B. , R. , R. E. Et, W. , and T. , Finding Maximum Independent Sets in Sparse and General Graphs, TARJAN Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp.856-857, 1999.

B. , R. Et, E. , and D. , 3-coloring in time O(1.3289 n ), J. Algorithms, vol.54, issue.2, pp.168-204, 2005.

M. D. Berg, O. Cheong, M. V. Kreveld, O. Et, and M. , Computational Geometry : Algorithms and Applications, pp.157-158, 2008.

P. Berman, F. Et, and T. , On Approximation Properties of the Independent Set Problem for Low Degree Graphs, Theory of Computing Systems, vol.32, issue.2, pp.115-132, 1999.
DOI : 10.1007/s002240000113

B. , D. Fernau, H. Gaspers, S. Et, L. et al., Exact and Parameterized Algorithms for Max Internal Spanning Tree, Algorithmica, vol.65, issue.1, pp.95-128, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00942924

B. , A. Husfeldt, T. Kaski, P. Et, K. et al., Fourier meets Möbius : fast subset convolution, Proceedings of the 39th Annual ACM Symposium on Theory of Computing, pp.67-74, 2007.

B. , A. Husfeldt, T. Et, K. , and M. , Set Partitioning via Inclusion-Exclusion, 2009.

B. , J. Lenstra, J. Kan, and A. , Scheduling subject to resource constraints : classification and complexity, Discrete Applied Mathematics, vol.5, issue.1, pp.11-24, 1983.

B. , H. L. Kloks, T. Tan, R. B. Van, L. et al., Approximations for lambda-Colorings of Graphs, Comput. J, vol.47, issue.2, pp.193-204, 2004.

B. , H. L. Lokshtanov, D. Et, P. , and E. , Planar Capacitated Dominating Set Is W[1]-Hard, pp.50-60, 2009.

N. Bourgeois, Algorithmes exponentiels pour la résolution exacte et approchée de problèmes NP-difficiles, 2009.

N. Bourgeois, B. Escoffier, V. T. Paschos, R. Van, and J. M. , Fast Algorithms for max independent set, Algorithmica, vol.7, issue.3, pp.382-415, 2012.
DOI : 10.1007/s00453-010-9460-7
URL : https://hal.archives-ouvertes.fr/hal-00880187

B. , A. Le, V. Et, S. , and J. , Graph Classes : A Survey, Monographs on Discrete Mathematics and Applications. Society for Industrial and Applied Mathematics, 1999.

B. , A. Le, V. B. Et, S. , and J. P. , Graph Classes : A Survey, Monographs on Discrete Mathematics and Applications. Society for Industrial and Applied Mathematics, pp.8-11, 1999.

C. , L. Cheng, S. Et, L. , and T. W. , Algorithms and Computation -24th International Symposium, Proceedings, pp.182-186, 2013.

C. , G. J. Et, K. , and D. , The L(2, 1)-Labeling Problem on Graphs, SIAM J. Discrete Math, vol.9, issue.2, pp.309-316, 1996.

C. , J. Et, F. , and F. , Parameterized and Exact Computation, Lecture Notes in Computer Science, vol.5917, pp.176-182, 2009.

C. , G. Gaspers, S. Narodytska, N. Schutt, A. Et et al., On the Complexity of Global Scheduling Constraints under Structural Restrictions, IJCAI 2013, Proceedings of the 23rd International Joint Conference on Artificial Intelligence, 2013.

C. , T. H. Leiserson, C. E. Rivest, R. L. Stein, and C. , Introduction to Algorithms, pp.27-89, 2009.

C. , J. Golovach, P. A. Kratsch, D. Liedloff, M. Et et al., Colorings with few Colors : Counting, Enumeration and Combinatorial Bounds, Theory Comput. Syst, vol.52, issue.52, pp.645-667, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00942919

C. , J. Letourneur, R. Et, L. , and M. , On the number of minimal dominating sets on some graph classes, Theor. Comput. Sci, vol.562, issue.120, pp.634-642, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01105097

C. , J. Heggernes, P. Van-'t, H. , P. Et et al., Minimal Dominating Sets in Graph Classes : Combinatorial Bounds and Enumeration, BIELIKOVÁ, pp.202-213, 2012.

C. , J. Heggernes, P. Van-'t, H. , P. Et et al., Minimal dominating sets in graph classes : Combinatorial bounds and enumeration, Theoretical Computer Science, vol.487, issue.120, pp.82-94, 2013.

C. , M. Et, K. , and L. , Channel assignment via fast zeta transform, Inf. Process. Lett, vol.111, issue.15, pp.727-730, 2011.

C. , M. Pilipczuk, M. Pilipczuk, M. Et, W. et al., Scheduling Partially Ordered Jobs Faster than 2 n, Algorithmica, vol.68, issue.3, pp.692-714, 2014.

C. , M. Pilipczuk, M. Et, W. , and J. O. , Capacitated domination faster than O(2 n ), Inf. Process. Lett, vol.111, issue.109, pp.23-241099, 2011.

D. , M. Logemann, G. Et, L. , and D. W. , A machine program for theorem-proving, Communications of the ACM, vol.5, issue.7, pp.394-397, 1962.

R. De and H. N. , Information System on Graph Classes and their Inclusions (ISGCI), 2015.

D. , M. Lokshtanov, D. Saurabh, S. Et, V. et al., Capacitated Domination and Covering : A Parameterized Perspective, Parameterized and Exact Computation, Third International Workshop, pp.78-90, 2008.

D. , R. G. Et, F. , and M. R. , Parameterized Complexity. Monographs in Computer Science, pp.19-105, 1999.

D. , S. E. Et, W. , and R. A. , The steiner problem in graphs, Networks, vol.1, issue.3, pp.195-207, 1971.

E. , N. Havet, F. Et, N. , and S. D. , k-L(2, 1)-labelling for planar graphs is NPcomplete for k ? 4, Discrete Applied Mathematics, vol.158, issue.16, pp.1777-1788, 2010.
URL : https://hal.archives-ouvertes.fr/inria-00360505

E. , D. , F. K. Sack, J. Smid, and M. H. , The Traveling Salesman Problem for Cubic Graphs, DEHNE Algorithms and Data Structures Proceedings, volume 2748 of Lecture Notes in Computer Science, pp.307-318, 2003.

F. , H. Kneis, J. Kratsch, D. Langer, A. Liedloff et al., An exact algorithm for the Maximum Leaf Spanning Tree problem, Theor. Comput. Sci, vol.412, issue.45, pp.6290-6302, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00460824

F. , J. Golovach, P. A. Et, K. , J. et al., Distance Constrained Labelings of Graphs of Bounded Treewidth, CAIRES Automata, Languages and Programming, 32nd International Colloquium, ICALP 2005 Proceedings, pp.360-372, 2005.

F. , J. Golovach, P. A. Et, K. , J. Aceto et al., Computational Complexity of the Distance Constrained Labeling Problem for Trees (Extended Abstract), Automata, Languages and Programming, 35th International Colloquium Proceedings, Part I : Tack A : Algorithms, Automata, Complexity, and Games, pp.294-305, 2008.

F. , J. Kloks, T. Et, K. , and J. , Fixed-parameter complexity of lambda-labelings, Discrete Applied Mathematics, vol.113, issue.1, pp.59-72, 2001.

F. , J. Et, K. , and J. , Partial covers of graphs, Discussiones Mathematicae Graph Theory, pp.89-99, 2002.

F. , J. Kratochvíl, J. Et, P. , and A. , On the computational complexity of partial covers of Theta graphs, Discrete Applied Mathematics, vol.156, issue.7, pp.1143-1149, 2008.

F. , F. V. Gaspers, S. Pyatkin, A. V. Et, R. et al., On the Minimum Feedback Vertex Set Problem : Exact and Enumeration Algorithms, Algorithmica, vol.52, issue.2, pp.293-307, 2008.

F. , F. V. Gaspers, S. Saurabh, S. Et, S. et al., On Two Techniques of Combining Branching and Treewidth, Algorithmica, vol.54, issue.2, pp.181-207, 2009.
URL : https://hal.archives-ouvertes.fr/lirmm-00399668

F. , F. V. Golovach, P. A. Kratochvíl, J. Kratsch, D. Et et al., Sort and Search : Exact algorithms for generalized domination, Inf. Process. Lett, vol.109, issue.14, pp.795-798, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00460850

F. , F. V. Golovach, P. A. Kratochvíl, J. Kratsch, D. Et et al., Branch and Recharge : Exact Algorithms for Generalized Domination, Algorithmica, issue.2, pp.61252-273, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00460736

F. , F. V. Grandoni, F. Et, K. , and D. , Some New Techniques in Design and Analysis of Exact (Exponential) Algorithms, Bulletin of the EATCS, vol.87, pp.47-77, 2005.

F. , F. V. Grandoni, F. Et, K. , and D. , A Measure & Conquer Approach for the Analysis of Exact Algorithms, J. ACM, vol.5625, issue.5 2, pp.1-25, 2009.

F. , F. V. Grandoni, F. Pyatkin, A. V. Et, S. et al., Combinatorial bounds via measure and conquer : Bounding minimal dominating sets and applications, ACM Transactions on Algorithms, vol.5, issue.1, pp.5-120, 2008.

F. , F. V. Heggernes, P. Kratsch, D. Papadopoulos, C. Et et al., Enumerating Minimal Subset Feedback Vertex Sets, Lecture Notes in Computer Science, vol.6844, pp.399-410, 2011.

F. , F. V. Iwama, K. Kratsch, D. Kaski, P. Koivisto et al., 08431 Open Problems -Moderately Exponential Time Algorithms, Moderately Exponential Time Algorithms 08431 of Dagstuhl Seminar Proceedings. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2008.

F. , F. V. Et, K. , and P. , Exact exponential algorithms, Commun. ACM, vol.56, issue.3, pp.80-88, 2013.

F. , F. V. Et, K. , and D. , Exact Exponential Algorithms, pp.48-130, 2010.

F. , F. V. Kratsch, D. Et, W. , G. J. et al., Exact (Exponential) Algorithms for the Dominating Set Problem, HROMKOVIC Graph- Theoretic Concepts in Computer Science, 30th International Workshop, pp.245-256, 2004.

F. , F. V. Et, V. , and Y. , Finding Induced Subgraphs via Minimal Triangulations, STACS, volume 5 of LIPIcs Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, pp.383-394, 2010.

G. , M. R. Et, J. , and D. S. , Computers and Intractability : A Guide to the Theory of NP-Completeness, W. H. Freeman, pp.8-11, 1979.

G. , M. R. Johnson, D. S. Et, S. , and R. , The Complexity of Flowshop and Jobshop Scheduling, Mathematics of Operations Research, vol.1, issue.2, pp.117-129, 1976.

G. , S. Kratsch, D. Et, L. , and M. , On Independent Sets and Bicliques in Graphs, Algorithmica, vol.62, issue.3-4 2, pp.637-658, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00460773

G. , S. Et, L. , and M. , A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set, Discrete Mathematics & Theoretical Computer Science, vol.14, issue.1, pp.29-42, 2012.

G. , S. Et, M. , and S. , On the Number of Minimal Separators in Graphs, 2015.

G. , S. Et, S. , and G. B. , A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in between, J. Comput. Syst. Sci, vol.78, issue.1, pp.305-335, 2012.

G. , P. Heggernes, P. Et, K. , and D. , Enumerating minimal connected dominating sets in graphs of bounded chordality, Parameterized and Exact Computation -10th International Symposium, IPEC 2015, pp.107-121, 2015.

G. , P. A. Kratsch, D. Et, C. , and J. , Colorings with Few Colors : Counting, Enumeration and Combinatorial Bounds, Graph Theoretic Concepts in Computer Science -36th International Workshop, WG 2010, pp.39-50, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00942919

G. , R. L. Lawler, E. L. Lenstra, J. K. Et, R. Kan et al., Optimization and approximation in deterministic sequencing and scheduling : a survey, Annals of discrete mathematics, vol.5, issue.2, pp.287-326, 1979.

G. , J. R. Et, Y. , and R. K. , Labelling Graphs with a Condition at Distance 2, SIAM J. Discrete Math, vol.5, issue.4, pp.586-595, 1992.

G. , J. A. Van, H. , J. J. Saldanha-da-gama, F. Et et al., Solving the job-shop scheduling problem optimally by dynamic programming, Computers & OR, vol.39, issue.12, pp.2968-2977, 2012.

G. , Y. Et, S. , and S. , Expected Computation Time for Hamiltonian Path Problem, SIAM J. Comput, vol.16, issue.3, pp.486-502, 1987.

H. , T. Ishii, T. Ono, H. Et, U. et al., A Linear Time Algorithm for L(2, 1)-Labeling of Trees, Algorithmica, vol.66, issue.3, pp.654-681, 2013.

H. , F. Klazar, M. Kratochvíl, J. Kratsch, D. Et et al., Exact Algorithms for L(2, 1)-Labeling of Graphs, Algorithmica, vol.59, issue.46, pp.169-194, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00460873

H. , F. Reed, B. A. Et, S. , and J. , L(2, 1)-labelling of graphs, Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp.621-630, 2008.
URL : https://hal.archives-ouvertes.fr/inria-00486183

H. , F. Reed, B. A. Et, S. , and J. , Griggs and Yeh's Conjecture and, p.1, 2012.

H. , T. W. Hedetniemi, S. T. Et, S. , and P. J. , Domination in graphs : advanced topics, Marcel Dekker, pp.15-105, 1998.

H. , T. W. Hedetniemi, S. T. Et, S. , and P. J. , Fundamentals of domination in graphs, Marcel Dekker, pp.15-105, 1998.

M. Held, K. Et, and R. M. , A Dynamic Programming Approach to Sequencing Problems, Journal of the Society for Industrial and Applied Mathematics, vol.10, issue.1, pp.196-210, 1962.
DOI : 10.1137/0110015

H. , E. Et, S. , and S. , Computing Partitions with Applications to the Knapsack Problem, J. ACM, vol.21, issue.135, pp.277-292, 1974.

I. , R. Paturi, R. Et, Z. , and F. , Which Problems Have Strongly Exponential Complexity, Journal of Computer and System Sciences, vol.63, issue.4 2, pp.512-530, 2001.

I. , Y. Marx, D. Et, R. , and P. , A Faster Algorithm for Dominating Set Analyzed by the Potential Method, Parameterized and Exact Computation -6th International Symposium, IPEC 2011, pp.41-54, 2011.

J. , K. Land, F. Et, L. , K. et al., Bounding the Running Time of Algorithms for Scheduling and Packing Problems, DEHNE Algorithms and Data Structures -13th International Symposium, WADS 2013 Proceedings, pp.439-450, 2013.

J. , D. S. Papadimitriou, C. H. Et, Y. , and M. , On Generating All Maximal Independent Sets, Inf. Process. Lett, vol.27, issue.3, pp.119-123, 1988.

J. , K. Kratochvíl, J. Liedloff, M. Rossmanith, P. Et et al., Fast exact algorithm for L(2, 1)-labeling of graphs, Theor. Comput. Sci, vol.505, issue.62, pp.42-54, 2013.

J. , K. Kratochvíl, J. Liedloff, M. Et, R. et al., Determining the L(2, 1)-span in polynomial space, Discrete Applied Mathematics, vol.161, issue.62, pp.13-142052, 2013.

J. , K. Et, R. , and P. , On Improved Exact Algorithms for L(2, 1)- Labeling of Graphs, Combinatorial Algorithms - 21st International Workshop, IWOCA 2010, pp.34-37, 2010.

J. , K. Et, R. , and P. , On the complexity of exact algorithm for L(2, 1)-labeling of graphs, Inf. Process. Lett, vol.111, issue.14, pp.697-701, 2011.

K. , M. M. Limouzy, V. Mary, A. Et, N. et al., Enumeration of Minimal Dominating Sets and Variants, Lecture Notes in Computer Science, vol.6914, pp.298-309, 2011.

K. , M. M. Limouzy, V. Mary, A. Et, N. et al., On the Neighbourhood Helly of Some Graph Classes and Applications to the Enumeration of Minimal Dominating Sets, Lecture Notes in Computer Science, vol.7676, pp.289-298, 2012.

K. , M. M. Limouzy, V. Mary, A. Nourine, L. Et et al., On the Enumeration and Counting of Minimal Dominating sets in Interval and Permutation Graphs, pp.339-349, 2013.

K. , M. M. Et, N. , and L. , Minimal Dominating Set Enumeration editor : Encyclopedia of Algorithms, 2015.

K. , J. Et, T. , and E. , Algorithm Design, 2006.

K. , J. Langer, A. Et, R. , P. et al., A Fine-grained Analysis of a Simple Independent Set Algorithm, KANNAN IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2009 Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, pp.287-298, 2009.

K. , L. Et, S. , A. Ravi, R. Et et al., Assigning Channels via the Meet-in-the-Middle Approach, Algorithm Theory -SWAT 2014 -14th Scandinavian Symposium and Workshops Proceedings, pp.282-293, 2014.

K. , D. Et, L. , and M. , An exact algorithm for the minimum dominating clique problem, Theor. Comput. Sci, vol.385, issue.1-3, pp.226-240, 2007.

L. , E. L. Hammer, E. L. Johnson, B. K. Et, N. et al., A " Pseudopolynomial Algorithm for Sequencing Jobs to Minimize Total Tardiness, Studies in Integer Programming, pp.331-342, 1977.

L. , E. L. Et, M. , and J. M. , A Functional Equation and its Application to Resource Allocation and Sequencing Problems, Management Science, vol.16, issue.1, pp.77-84, 1969.

L. Gall, F. , K. Nagasaka, K. Winkler, F. Et et al., Algebraic complexity theory and matrix multiplication, Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation, ISSAC '14, p.23, 2014.
DOI : 10.1145/2608628.2627493

L. , C. Liedloff, M. Soukhal, A. Et-t-'kindt, and V. , Exponential-time algorithms for scheduling problems, Proceedings of the Workshop on Models and Algorithms for Planning and Scheduling Problems, pp.160-165, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00943027

L. , C. Liedloff, M. Soukhal, A. Et-t-'kindt, and V. , On an extension of the Sort & Search method with application to scheduling theory, Theor. Comput. Sci, vol.511, issue.156, pp.13-22, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00942913

L. , C. Liedloff, M. Soukhal, A. Et-t-'kindt, and V. , Exponential Algorithms for Scheduling Problems, 2014.
URL : https://hal.archives-ouvertes.fr/hal-00944382

L. , C. Liedloff, M. T-'kindt, V. Et, T. et al., Algorithmes modérément exponentiels pour problèmes NP-difficiles, Informatique Mathématique une photographie en 2015, pp.18-154, 2015.

L. , M. Todinca, I. Et, V. , and Y. , Solving Capacitated Dominating Set by using covering by subsets and maximum matching, Discrete Applied Mathematics, vol.168, pp.60-68, 2014.
URL : https://hal.archives-ouvertes.fr/hal-00479645

L. , Z. Et, T. , and M. , On the number of minimal transversals in 3-uniform hypergraphs, Discrete Mathematics, vol.308, issue.16, pp.3668-3687, 2008.

M. , D. Jansen, K. Mathieu, C. Shachnai, H. Et et al., Fixed-parameter tractable scheduling problems, Packing and Scheduling Algorithms for Information and Communication Services, 2011.

M. , M. Et, W. , A. , J. Et et al., Scheduling and Fixed-Parameter Tractability, LEE Integer Programming and Combinatorial Optimization -17th International Conference, IPCO 2014 Proceedings, pp.381-392, 2014.

M. , J. Et, M. , and L. , On cliques in graphs, Israel Journal of Mathematics, vol.3, pp.23-28, 1965.

N. , J. Van, R. , J. M. Van, D. et al., Inclusion/Exclusion Meets Measure and Conquer, Algorithmica, vol.69, issue.3, pp.685-740, 2014.

Y. Okamoto, T. Uno, U. Et, and R. , Counting the number of independent sets in chordal graphs, Journal of Discrete Algorithms, vol.6, issue.2, pp.229-242, 2008.
DOI : 10.1016/j.jda.2006.07.006

R. , B. Et, S. , and I. , Exact algorithms for Minimum Dominating Set, 2004.

R. , R. Et, S. , and S. , A Sub-Constant Error-Probability Low-Degree Test, and a Sub- Constant Error-Probability PCP Characterization of NP, Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, pp.475-484, 1997.

R. , N. Et, S. , and P. D. , Graph minors. I. Excluding a forest, J. Comb. Theory, Ser. B, vol.35, issue.1, pp.39-61, 1983.

R. , N. Et, S. , and P. D. , Graph Minors. II. Algorithmic Aspects of Tree-Width, J. Algorithms, vol.7, issue.3, pp.309-322, 1986.

S. , U. , V. Et, D. , and B. , Algorithmics in Exponential Time, DIEKERT STACS 2005, 22nd Annual Symposium on Theoretical Aspects of Computer Science Proceedings, pp.36-43, 2005.

S. , U. Cooper, S. B. Löwe, B. Et, T. et al., New Algorithmic Paradigms in Exponential Time Algorithms, New Computational Paradigms, First Conference on Computability in Europe Proceedings, pp.429-429, 2005.

S. , R. Et, S. , and A. , A T = O(2 n2 ), S = O(2 n4 ) Algorithm for Certain NP- Complete Problems, SIAM J. Comput, vol.10, issue.152, pp.456-464, 1981.

S. , L. Lenté, C. Liedloff, M. Et-t-'kindt, and V. , An exponential dynamic programming algorithm for the 3-machine flowshop scheduling problem to minimize the makespan, Proceedings of the Multidisciplinary International Conference on Scheduling : Theory and Applications, pp.144-169, 2015.

S. , M. Et, T. , and E. , A Simple Algorithm for Finding a Maximum Clique and Its Worst-Case Time Complexity, Systems and Computers in Japan, vol.21, issue.3, pp.1-13, 1990.

T. , R. Et, T. , and A. , Finding a maximum independent set, SIAM Journal on Computing, vol.6, issue.20, pp.537-546, 1977.

R. Van and J. M. , Exact exponential-time algorithms for domination problems in graphs, pp.81-105, 2011.

R. Van, J. M. Bodlaender, H. L. Van, R. , J. M. Bodlaender et al., Exact algorithms for dominating set Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution, 17th Annual European Symposium Proceedings, volume 5757 of Lecture Notes in Computer Science, pp.2147-2164, 2009.

W. , G. J. , M. Reinelt, G. Et, R. et al., Exact Algorithms for NP-Hard Problems : A Survey, JÜNGER Combinatorial Optimization -Eureka, You Shrink !, Papers Dedicated to Jack Edmonds, 5th International Workshop, pp.185-208, 2001.

W. , G. J. Downey, R. G. Fellows, M. R. Et, D. et al., Space and Time Complexity of Exact Algorithms : Some Open Problems (Invited Talk), Parameterized and Exact Computation, First International Workshop Proceedings, pp.281-290, 2004.

X. , M. Et, N. , and H. , Exact Algorithms for Maximum Independent Set, pp.328-338, 2013.

X. , M. Et, N. , and H. , An improved exact algorithm for undirected feedback vertex set, Journal of Combinatorial Optimization, vol.30, issue.2, pp.214-241, 2015.