T. .. Planar-f-deletion, 150 6.6.2 Construction of the kernel on H-minor-free graphs, p.153

.. .. Concluding,

N. .. Result, 163 7.3.2 Bounding the number of duplicates

.. .. Concluding,

. N-f-(x-t-)-?-n-g,

I. Adler, F. Dorn, F. V. Fomin, I. Sau, and D. M. Thilikos, Faster parameterized algorithms for minor containment, Theoretical Computer Science, vol.412, issue.50, pp.7018-7028, 2011.
URL : https://hal.archives-ouvertes.fr/lirmm-00736522

I. Adler, F. Dorn, F. V. Fomin, I. Sau, and D. M. Thilikos, Fast minor testing in planar graphs, Algorithmica, vol.64, issue.1, pp.69-84, 2012.
URL : https://hal.archives-ouvertes.fr/lirmm-00904515

J. Baste, F. Beggas, H. Kheddouci, and I. Sau, On the parameterized complexity of the edge monitoring problem, Information Processing Letters, vol.121, pp.39-44, 2017.
URL : https://hal.archives-ouvertes.fr/lirmm-01487565

J. Baste, L. Faria, S. Klein, and I. Sau, Parameterized Complexity Dichotomy for (r, )-Vertex Deletion. Theory of Computing Systems, vol.61, pp.777-794, 2017.
URL : https://hal.archives-ouvertes.fr/lirmm-01272704

J. Baste, C. Paul, I. Sau, and C. Scornavacca, Efficient FPT algorithms for (strict) compatibility of unrooted phylogenetic trees, Bulletin of Mathematical Biology, vol.79, issue.4, pp.920-938, 2017.
URL : https://hal.archives-ouvertes.fr/lirmm-01481368

J. Baste and I. Sau, The role of planarity in connectivity problems parameterized by treewidth, Theoretical Computer Science, vol.570, pp.1-14, 2015.
URL : https://hal.archives-ouvertes.fr/dumas-00854884

N. Bousquet, D. Gonçalves, G. B. Mertzios, C. Paul, I. Sau et al., Parameterized domination in circle graphs. Theory of Computing Systems, vol.54, pp.45-72, 2014.
URL : https://hal.archives-ouvertes.fr/lirmm-00738534

D. Chatzidimitriou, J. Raymond, I. Sau, and D. M. Thilikos, Minors in graphs of large ? r -girth, European Journal of Combinatorics, vol.65, pp.106-121, 2017.

N. Cohen, D. Gonçalves, E. J. Kim, C. Paul, I. Sau et al., A polynomial-time algorithm for outerplanar diameter improvement, Journal of Computer and System Sciences, vol.89, pp.315-327, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01178222

L. Faria, S. Klein, I. Sau, and R. Sucupira, Improved kernels for Signed Max Cut parameterized above lower bound on (r, )-graphs, Discrete Mathematics & Theoretical Computer Science, vol.19, issue.1, 2017.
URL : https://hal.archives-ouvertes.fr/lirmm-01272714

V. Garnero, C. Paul, I. Sau, and D. M. Thilikos, Explicit linear kernels via dynamic programming, SIAM Journal on Discrete Mathematics, vol.29, issue.4, pp.1864-1894, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01084007

V. Garnero, I. Sau, and D. M. Thilikos, A linear kernel for planar red-blue dominating set, Discrete Applied Mathematics, vol.217, pp.536-547, 2017.
URL : https://hal.archives-ouvertes.fr/lirmm-00846771

D. Gözüpek, S. Ozkan, C. Paul, I. Sau, and M. Shalom, Parameterized complexity of the MINCCA problem on graphs of bounded decomposability, Theoretical Computer Bibliography Science, vol.690, pp.91-103, 2017.

G. Joret, C. Paul, I. Sau, S. Saurabh, and S. Thomassé, Hitting and harvesting pumpkins, SIAM Journal on Discrete Mathematics, vol.28, issue.3, pp.1363-1390, 2014.
URL : https://hal.archives-ouvertes.fr/lirmm-00642341

E. J. Kim, A. Langer, C. Paul, F. Reidl, P. Rossmanith et al., Linear kernels and single-exponential algorithms via protrusion decompositions, ACM Transactions on Algorithms, vol.12, issue.2, 2016.
URL : https://hal.archives-ouvertes.fr/lirmm-01288472

E. J. Kim, C. Paul, I. Sau, and D. M. Thilikos, Parameterized algorithms for minmax multiway cut and list digraph homomorphism, Journal of Computer and System Sciences, vol.86, pp.191-206, 2017.
URL : https://hal.archives-ouvertes.fr/lirmm-01263999

G. B. Mertzios, I. Sau, M. Shalom, and S. Zaks, Placing regenerators in optical networks to satisfy multiple sets of requests, IEEE/ACM Transactions on Networking, vol.20, issue.6, pp.1870-1879, 2012.
URL : https://hal.archives-ouvertes.fr/lirmm-00736699

L. P. Montejano and I. Sau, On the complexity of computing the k-restricted edgeconnectivity of a graph, Theoretical Computer Science, vol.662, pp.31-39, 2017.
URL : https://hal.archives-ouvertes.fr/lirmm-01272707

J. Raymond, I. Sau, and D. M. Thilikos, An edge variant of the Erd? os-Pósa property, Discrete Mathematics, vol.339, issue.8, pp.2027-2035, 2016.

J. Rué, I. Sau, and D. M. Thilikos, Asymptotic enumeration of non-crossing partitions on surfaces, Discrete Mathematics, pp.635-649, 2013.

J. Rué, I. Sau, and D. M. Thilikos, Dynamic programming for graphs on surfaces, ACM Transactions on Algorithms, vol.10, issue.2, 2014.

S. R. Alves, K. K. Dabrowski, L. Faria, S. Klein, I. Sau et al., On the (parameterized) complexity of recognizing well-covered (r, )-graphs, Proc. of the 10th International Conference on Combinatorial Optimization and Applications (COCOA), vol.10043, pp.423-437, 2016.
URL : https://hal.archives-ouvertes.fr/lirmm-01481787

J. Araújo, J. Baste, and I. Sau, Ruling out FPT algorithms for Weighted Coloring on forests, Graphs and Optimization Symposium (LAGOS), volume 62 of ENDM, pp.195-200, 2017.

J. Baste, D. Gözüpek, C. Paul, I. Sau, M. Shalom et al., Parameterized complexity of finding a spanning tree with minimum reload cost diameter, Proc. of the 12th International Symposium on Parameterized and Exact Computation (IPEC, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01733767

J. Baste, M. Noy, and I. Sau, On the number of labeled graphs of bounded treewidth, Proc. of the 43rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG), vol.10520, pp.88-99, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01734085

J. Baste, D. Rautenbach, and I. Sau, Uniquely restricted matchings and edge colorings, Proc. of the 43rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG), vol.10520, pp.100-112, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01734132

J. Baste, I. Sau, and D. M. Thilikos, Optimal algorithms for hitting (topological) minors on graphs of bounded treewidth, Proc. of the 12th International Symposium on Parameterized and Exact Computation (IPEC, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01733845

M. Bougeret and I. Sau, How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs?, Proc. of the 12th International Symposium on Parameterized and Exact Computation (IPEC), 2017.
URL : https://hal.archives-ouvertes.fr/lirmm-02020500

D. Chatzidimitriou, J. Raymond, I. Sau, and D. M. Thilikos, An O(log OPT)-approximation for covering/packing minor models of ? r, Proc. of the 13th International Workshop on Approximation and Online Algorithms (WAOA), vol.9499, pp.122-132, 2015.
URL : https://hal.archives-ouvertes.fr/lirmm-01609998

N. Cohen, F. Havet, D. Mazauric, I. Sau, and R. Watrigant, Complexity dichotomies for the Minimum F-Overlay problem, Proc. of the of the 28th International Workshop on Combinatorial Algorithms (IWOCA, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01571229

E. Kim, S. Oum, C. Paul, I. Sau, and D. M. Thilikos, An FPT 2-approximation for tree-cut decomposition, Proc. of the 13th International Workshop on Approximation and Online Algorithms (WAOA), vol.9499, pp.35-46, 2015.
URL : https://hal.archives-ouvertes.fr/lirmm-01264015

H. Perret-du-cray and I. Sau, Improved FPT algorithms for weighted independent set in bull-free graphs, Proc. of the 9th International Symposium on Parameterized and Exact Computation (IPEC), vol.8894, pp.282-293, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01733496

J. Rué, I. Sau, and D. M. Thilikos, Dynamic Programming for H-minor-free Graphs (Extended Abstract), Proc. of the 18th Annual International Computing and Combinatorics Conference (COCOON), vol.7434, pp.86-97, 2012.

R. Sucupira, L. Faria, S. Klein, I. Sau, and U. S. Souza, Maximum cuts in edgecolored graphs, Proc. of the IX Latin and American Algorithms, vol.62, pp.87-92, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01733581

P. Aboulker, S. Fiorini, T. Huynh, G. Joret, J. Raymond et al., A tight Erd? os-Pósa function for wheel minors, 2017.

J. Araújo, V. A. Campos, A. K. Maia, I. Sau, and A. Silva, On the complexity of finding internally vertex-disjoint long directed paths. CoRR, abs/1706.09066, 2017.

V. Garnero, C. Paul, I. Sau, and D. M. Thilikos, Explicit linear kernels for packing problems, 2016.
DOI : 10.1007/s00453-018-0495-5
URL : http://arxiv.org/pdf/1610.06131

V. Garnero and I. Sau, A linear kernel for planar total dominating set. CoRR, 2012.

K. R. Abrahamson and M. R. Fellows, Finite automata, bounded treewidth, and well-quasiordering, Proc. of Graph Structure Theory, Contemporary Mathematics 147, pp.539-564, 1991.
DOI : 10.1090/conm/147/01199

S. Agarwal and S. De, Dynamic spectrum access for energy-constrained CR: single channel versus switched multichannel, IET Communications, vol.10, issue.7, pp.761-769, 2016.
DOI : 10.1049/iet-com.2015.0523

J. Alber, M. Fellows, and R. Niedermeier, Polynomial-Time Data Reduction for Dominating Set, Journal of the ACM, vol.51, issue.3, pp.363-384, 2004.
DOI : 10.1145/990308.990309
URL : http://arxiv.org/pdf/cs/0207066

N. Alon, R. Yuster, and U. Zwick, Color-coding, Journal of the ACM, vol.42, issue.4, pp.844-856, 1995.

E. Amaldi, G. Galbiati, and F. Maffioli, On minimum reload cost paths, tours, and flows, vol.57, pp.254-260, 2011.
DOI : 10.1002/net.20423

J. Araújo, N. Nisse, and S. Pérennes, Weighted coloring in trees, SIAM Journal on Discrete Mathematics, vol.28, issue.4, pp.2029-2041, 2014.

S. Arkoulis, E. Anifantis, V. Karyotis, S. Papavassiliou, and N. Mitrou, On the optimal, fair and channel-aware cognitive radio network reconfiguration, Computer Networks, vol.57, issue.8, pp.1739-1757, 2013.
DOI : 10.1016/j.comnet.2013.03.004

S. Arnborg, B. Courcelle, A. Proskurowski, and D. Seese, An algebraic theory of graph reduction, Journal of the ACM, vol.40, issue.5, pp.1134-1164, 1993.
DOI : 10.1007/bfb0017382
URL : http://www.labri.fr/perso/courcell/Textes1/BC-ArnbProskuSeese(1993).pdf

J. Battle, F. Harary, Y. Kadama, and J. Youngs, Additivity of the genus of a graph, Bulletin of the American Mathematical Society, vol.68, pp.565-568, 1962.

S. Bayhan and F. Alagoz, Scheduling in centralized cognitive radio networks for energy efficiency, IEEE Transactions on Vehicular Technology, vol.62, issue.2, pp.582-595, 2013.
DOI : 10.1109/tvt.2012.2225650

S. Bayhan, S. Eryigit, F. Alagoz, and T. Tugcu, Low complexity uplink schedulers for energy-efficient cognitive radio networks, IEEE Wireless Communications Letters, vol.2, issue.3, pp.363-366, 2013.
DOI : 10.1109/wcl.2013.042313.130095

L. W. Beineke and R. E. Pippert, The number of labeled k-dimensional trees, Journal of Combinatorial Theory, vol.6, issue.2, pp.200-205, 1969.
DOI : 10.1016/s0021-9800(69)80120-1
URL : https://doi.org/10.1016/s0021-9800(69)80120-1

A. Benhocine and A. P. Wojda, On the existence of specified cycles in a tournament, Journal of Graph Theory, vol.7, issue.4, pp.469-473, 1983.

U. Bertelé and F. Brioschi, Nonserial Dynamic Programming, pp.37-38, 1972.

A. P. Bianzino, C. Chaudet, D. Rossi, and J. Rougier, A survey of green networking research, IEEE Communications Surveys & Tutorials, vol.14, issue.1, pp.3-20, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00573049

M. Bodirsky, O. Giménez, M. Kang, and M. Noy, Enumeration and limit laws for series-parallel graphs, European Journal of Combinatorics, vol.28, issue.8, pp.2091-2105, 2007.
DOI : 10.1016/j.ejc.2007.04.011
URL : https://doi.org/10.1016/j.ejc.2007.04.011

H. Bodlaender and T. Kloks, Only few graphs have bounded treewidth, 1992.

H. L. Bodlaender, Dynamic programming on graphs with bounded treewidth, Proc. of the 15th International Colloquium on Automata, Languages and Programming (ICALP), vol.317, pp.105-118, 1988.

H. L. Bodlaender, A tourist guide through treewidth, Acta Cybernetica, vol.11, pp.1-21, 1993.

H. L. Bodlaender, A linear-time algorithm for finding tree-decompositions of small treewidth, SIAM Journal on Computing, vol.25, issue.6, pp.1305-1317, 1996.

H. L. Bodlaender, Kernelization: New Upper and Lower Bound Techniques, Proc. of the 4th International Workshop on Parameterized and Exact Computation (IWPEC), vol.5917, pp.17-37, 2009.

H. L. Bodlaender, M. Cygan, S. Kratsch, and J. Nederlof, Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth, Information and Computation, vol.243, pp.86-111, 2015.

H. L. Bodlaender, R. G. Downey, M. R. Fellows, and D. Hermelin, On problems without polynomial kernels, Journal of Computer and System Sciences, vol.75, issue.8, pp.423-434, 2009.

H. L. Bodlaender, P. G. Drange, M. S. Dregi, F. V. Fomin, D. Lokshtanov et al., A c k n 5-approximation algorithm for treewidth, SIAM Journal on Computing, vol.45, issue.2, pp.317-378, 2016.

H. L. Bodlaender, F. V. Fomin, D. Lokshtanov, E. Penninkx, S. Saurabh et al., Meta) Kernelization. Journal of the ACM, vol.63, issue.5, 2016.

H. L. Bodlaender, B. M. Jansen, and S. Kratsch, Kernelization lower bounds by cross-composition, SIAM Journal on Discrete Mathematics, vol.28, issue.1, pp.277-305, 2014.

H. L. Bodlaender and J. Nederlof, Subexponential time algorithms for finding small tree and path decompositions, Proc. of the 23rd Annual European Symposium on Algorithms (ESA), vol.9294, pp.179-190, 2015.

H. L. Bodlaender, J. Nederlof, and T. C. Van-der-zanden, Subexponential Time Algorithms for Embedding H-Minor Free Graphs, Proc. of the 43rd International Colloquium on Automata, Languages, and Programming (ICALP), vol.55, p.14, 2016.

H. L. Bodlaender and E. Penninkx, A linear kernel for Planar Feedback Vertex Set, Proc. of the 3rd International Workshop on Parameterized and Exact Computation (IWPEC), vol.5018, pp.160-171, 2008.

H. L. Bodlaender, E. Penninkx, and R. B. Tan, A linear kernel for the k-Disjoint Cycle problem on planar graphs, Proc. of the 19th International Symposium on Algorithms and Computation, vol.5369, pp.306-317, 2008.

H. L. Bodlaender, S. Thomassé, and A. Yeo, Kernel bounds for disjoint cycles and disjoint paths, Proc. of the 17th Annual European Symposium on Algorithms (ESA), vol.5757, pp.635-646, 2009.
URL : https://hal.archives-ouvertes.fr/lirmm-00806805

H. L. Bodlaender and B. Van-antwerpen-de-fluiter, Reduction algorithms for graphs of small treewidth. Information and Computation, vol.167, pp.86-119, 2001.

B. Bollobás and A. Thomason, Proof of a conjecture of Mader, Erd? os and Hajnal on topological complete subgraphs, European Journal of Combinatorics, vol.19, issue.8, pp.883-887, 1998.

R. B. Borie, R. G. Parker, and C. A. Tovey, Automatic Generation of LinearTime Algorithms from Predicate Calculus Descriptions of Problems on Recursively Constructed Graph Families, Algorithmica, vol.7, issue.1, pp.555-581, 1992.

A. Brandstädt, Partitions of graphs into one or two independent sets and cliques, Discrete Mathematics, vol.152, issue.1-3, pp.47-54, 1996.

J. R. Büchi, On a Decision Method in Restricted Second-Order Arithmetic, Proc. of International Congress on Logic, Methodology, and Philosophy of Science, pp.1-11, 1962.

L. Cai, Fixed-parameter tractability of graph modification problems for hereditary properties, Information Processing Letters, vol.58, pp.171-176, 1996.

L. Cai, J. Chen, R. G. Downey, and M. R. Fellows, Advice classes of parameterized tractability, Annals of Pure and Applied Logic, vol.84, issue.1, pp.119-138, 1997.

Y. Cao, Linear recognition of almost interval graphs, Proc. of the 27th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.1096-1115, 2016.

Y. Cao and D. Marx, Interval Deletion Is Fixed-Parameter Tractable, ACM Transactions on Algorithms, vol.11, issue.3, pp.1-35, 2015.

A. Celik and A. E. Kamal, Green cooperative spectrum sensing and scheduling in heterogeneous cognitive radio networks, IEEE Transactions on Cognitive Communications and Networking, vol.2, issue.3, pp.238-248, 2016.

C. Chekuri and J. Chuzhoy, Large-treewidth graph decompositions and applications, Proc. of the 45th annual ACM Symposium on Theory of Computing, pp.291-300, 2013.

C. Chekuri and J. Chuzhoy, Polynomial bounds for the grid-minor theorem, Journal of the ACM, vol.63, issue.5, 2016.

J. Chen, H. Fernau, I. Kanj, and G. Xia, Parametric duality and kernelization: lower bounds and upper bounds on kernel size, SIAM Journal on Computing, vol.37, pp.1077-1106, 2007.

J. Chen, F. V. Fomin, Y. Liu, S. Lu, and Y. Villanger, Improved algorithms for feedback vertex set problems, Journal of Computer and System Sciences, vol.74, issue.7, pp.1188-1198, 2008.

J. Chen, I. Kanj, and G. Xia, Improved upper bounds for vertex cover, Theoretical Computer Science, vol.411, pp.3736-3756, 2010.

R. Chitnis, M. Cygan, M. Hajiaghayi, M. Pilipczuk, and M. Pilipczuk, Designing FPT algorithms for cut problems using randomized contractions, SIAM Journal on Computing, vol.45, issue.4, pp.1171-1229, 2016.

M. Chudnovsky, The structure of bull-free graphs I -Three-edge-paths with centers and anticenters, Journal of Combinatorial Theory, Series B, vol.102, issue.1, pp.233-251, 2012.

M. Chudnovsky, The structure of bull-free graphs II and III -A summary, Journal of Combinatorial Theory, Series B, vol.102, issue.1, pp.252-282, 2012.

N. Cohen, F. Havet, W. Lochet, and N. Nisse, Subdivisions of oriented cycles in digraphs with large chromatic number, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01411115

D. Coudert, P. Datta, S. Pérennes, H. Rivano, and M. Voge, Shared risk resource group complexity and approximability issues, Parallel Processing Letters, vol.17, issue.2, pp.169-184, 2007.
URL : https://hal.archives-ouvertes.fr/inria-00070167

B. Courcelle, The Monadic Second-Order Logic of Graphs. I. Recognizable Sets of Finite Graphs. Information and Computation, vol.85, pp.12-75, 1990.
URL : https://hal.archives-ouvertes.fr/hal-00334069

B. Courcelle and J. Engelfriet, Graph Structure and Monadic Second-Order Logic: A Language Theoretic Approach, Number 138 in Encyclopedia of Mathematics and its Applications, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00646514

R. Crowston, G. Gutin, M. Jones, and G. Muciaccia, Maximum balanced subgraph problem parameterized above lower bound, Theoretical Computer Science, vol.513, pp.53-64, 2013.

R. Crowston, M. Jones, and M. Mnich, Max-Cut Parameterized Above the EdwardsErd? os Bound, Algorithmica, vol.72, issue.3, pp.734-757, 2015.

M. Cygan, F. V. Fomin, L. Kowalik, D. Lokshtanov, D. Marx et al., Parameterized Algorithms, 2015.

M. Cygan, D. Lokshtanov, M. Pilipczuk, M. Pilipczuk, and S. Saurabh, Minimum bisection is fixed parameter tractable, Proc. of the 46th ACM Symposium on Theory of Computing (STOC), pp.323-332, 2014.

M. Cygan, J. Nederlof, M. Pilipczuk, M. Pilipczuk, J. M. Van-rooij et al., Solving connectivity problems parameterized by treewidth in single exponential time, Proc. of the 52nd IEEE Symposium on Foundations of Computer Science (FOCS), pp.150-159, 2011.

M. Cygan, M. Pilipczuk, M. Pilipczuk, and J. O. Wojtaszczyk, An improved FPT algorithm and a quadratic kernel for pathwidth one vertex deletion, Algorithmica, vol.64, issue.1, pp.170-188, 2012.

A. Dawar, M. Grohe, and S. Kreutzer, Locally excluding a minor, Proc. of the 22nd IEEE Symposium on Logic in Computer Science (LICS), pp.270-279, 2007.

B. De-fluiter, Algorithms for Graphs of Small Treewidth, 1997.

F. K. Dehne, M. R. Fellows, M. A. Langston, F. A. Rosamond, and K. Stevens, An O(2 O(k) n 3 ) FPT algorithm for the undirected feedback vertex set problem. Theory of Computing Systems, vol.41, pp.479-492, 2007.

H. Dell and D. Van-melkebeek, Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses, Journal of the ACM, vol.61, issue.4, p.27, 2014.

E. D. Demaine, F. V. Fomin, M. T. Hajiaghayi, and D. M. Thilikos, Fixed-parameter algorithms for (k, r)-center in planar graphs and map graphs, ACM Transactions on Algorithms, vol.1, issue.1, pp.33-47, 2005.

E. D. Demaine, F. V. Fomin, M. T. Hajiaghayi, and D. M. Thilikos, Subexponential parameterized algorithms on bounded-genus graphs and h-minor-free graphs, Journal of the ACM, vol.52, issue.6, pp.866-893, 2005.

E. D. Demaine and M. Hajiaghayi, Linearity of grid minors in treewidth with applications through bidimensionality, Combinatorica, vol.28, issue.1, pp.19-36, 2008.

C. Desset, N. Ahmed, and A. Dejonghe, Energy savings for wireless terminals through smart vertical handover, Proc. of IEEE International Conference on Communications, pp.1-5, 2009.

R. Diestel, Graph Theory, vol.173, 2012.

M. J. Dinneen, Too many minor order obstructions, Journal of Universal Computer Science, vol.3, issue.11, pp.1199-1206, 1997.

M. Dom, D. Lokshtanov, and S. Saurabh, Incompressibility through colors and ids, Proc. of the 36th International Colloquium on Automata, Languages and Programming (ICALP), vol.5555, pp.378-389, 2009.

D. Dong, X. Liao, Y. Liu, C. Shen, and X. Wang, Edge self-monitoring for wireless sensor networks, IEEE Transactions on Parallel and Distributed Systems, vol.22, issue.3, pp.514-527, 2011.

F. Dorn, Planar subgraph isomorphism revisited, Proc. of the 27th International Symposium on Theoretical Aspects of Computer Science (STACS), volume 5 of LIPIcs, pp.263-274, 2010.
URL : https://hal.archives-ouvertes.fr/inria-00455215

F. Dorn, F. V. Fomin, and D. M. Thilikos, Catalan structures and dynamic programming in H-minor-free graphs, Journal of Computer and System Sciences, vol.78, issue.5, pp.1606-1622, 2012.
URL : https://hal.archives-ouvertes.fr/lirmm-00904498

F. Dorn, E. Penninkx, H. L. Bodlaender, and F. V. Fomin, Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions, Algorithmica, vol.58, issue.3, pp.790-810, 2010.

R. G. Downey and M. R. Fellows, Fixed-Parameter Tractability and Completeness I: Basic Results, SIAM Journal on Computing, vol.24, issue.4, pp.873-921, 1995.

R. G. Downey and M. R. Fellows, Fixed-Parameter Tractability and Completeness II: On Completeness for, Theoretical Computer Science, vol.141, issue.1&2, pp.109-131, 1995.

R. G. Downey and M. R. Fellows, Fundamentals of Parameterized Complexity. Texts in Computer Science, 2013.

R. G. Downey, M. R. Fellows, and U. Stege, Parameterized complexity: A framework for systematically confronting computational intractability, Proc. of a DIMACS Workshop, vol.49, pp.49-100, 1999.

M. Drmota and E. Y. Jin, An asymptotic analysis of labeled and unlabeled k-trees, Algorithmica, vol.75, issue.4, pp.579-605, 2016.

C. S. Edwards, Some extremal properties of bipartite subgraphs, Canadian Journal of Mathematics, vol.25, pp.475-485, 1973.

C. S. Edwards, An improved lower bound for the number of edges in a largest bipartite subgraph. Recent Advances in Graph Theory, pp.167-181, 1975.

P. Erd? and L. Pósa, On independent circuits contained in a graph, Canadian Journal of Mathematics, vol.17, pp.347-352, 1965.

S. Eryigit, S. Bayhan, and T. Tugcu, Channel switching cost aware and energyefficient cooperative sensing scheduling for cognitive radio networks, Proc. of IEEE International Conference on Communications (ICC), pp.2633-2638, 2013.

U. Feige, M. Hajiaghayi, and J. R. Lee, Improved approximation algorithms for minimum weight vertex separators, SIAM Journal on Computing, vol.38, issue.2, pp.629-657, 2008.

M. R. Fellows, Surfing with rod, Computability and Complexity -Essays Dedicated to Rodney G. Downey on the Occasion of His 60th Birthday, vol.10010, pp.9-18, 2017.

M. R. Fellows and M. A. Langston, Nonconstructive tools for proving polynomialtime decidability, Journal of the ACM, vol.35, pp.727-739, 1988.

M. R. Fellows and M. A. Langston, An Analogue of the Myhill-Nerode Theorem and Its Use in Computing Finite-Basis Characterizations (Extended Abstract), Proc. of the 30th IEEE Symposium on Foundations of Computer Science (FOCS), pp.520-525, 1989.

M. R. Fellows and M. A. Langston, On search, decision, and the efficiency of polynomial-time algorithms, Journal of Computer and System Sciences, vol.49, issue.3, pp.769-779, 1994.

S. Fiorini and A. Herinckx, A tighter Erd? os-Pósa function for long cycles, Journal of Graph Theory, vol.77, issue.2, pp.111-116, 2014.

S. Fiorini, G. Joret, and D. R. Wood, Excluded forest minors and the Erd? os-Pósa property, Combinatorics, Probability and Computing, vol.22, issue.5, pp.700-721, 2013.

P. Flajolet and R. Sedgewick, Analytic Combinatorics, 2009.
DOI : 10.1017/cbo9780511801655
URL : https://hal.archives-ouvertes.fr/inria-00072739

M. Flammini, A. Marchetti-spaccamela, G. Monaco, L. Moscardelli, and S. Zaks, On the complexity of the regenerator placement problem in optical networks
URL : https://hal.archives-ouvertes.fr/inria-00530955

, IEEE/ACM Transactions on Networking, vol.19, issue.2, pp.498-511, 2011.

J. Flum and M. Grohe, Parameterized Complexity Theory. Texts in Theoretical Computer Science, 2006.

D. Foata, Enumerating k-trees, Discrete Mathematics, vol.1, issue.2, pp.181-186, 1971.
DOI : 10.1016/0012-365x(71)90023-9
URL : https://doi.org/10.1016/0012-365x(71)90023-9

F. Fomin, D. Lokshtanov, S. Saurabh, and D. M. Thilikos, Linear kernels for (connected) dominating set on graphs with excluded topological subgraphs, Proc. of the 30th International Symposium on Theoretical Aspects of Computer Science (STACS), vol.20, pp.92-103, 2013.
URL : https://hal.archives-ouvertes.fr/lirmm-00804758

F. V. Fomin, P. A. Golovach, and D. M. Thilikos, Contraction obstructions for treewidth, Journal of Combinatorial Theory, Series B, vol.101, issue.5, pp.302-314, 2011.

F. V. Fomin, D. Lokshtanov, N. Misra, G. Philip, and S. Saurabh, Hitting forbidden minors: Approximation and kernelization, SIAM Journal on Discrete Mathematics, vol.30, issue.1, pp.383-410, 2016.
DOI : 10.1137/140997889
URL : https://hal.archives-ouvertes.fr/hal-00573641

F. V. Fomin, D. Lokshtanov, N. Misra, and S. Saurabh, Nearly optimal FPT algorithms for Planar-F-Deletion. Unpublished manuscript, 2011.

F. V. Fomin, D. Lokshtanov, N. Misra, and S. Saurabh, Planar F-Deletion: Approximation, Kernelization and Optimal FPT Algorithms, Proc. of the 53rd IEEE Symposium on Foundations of Computer Science (FOCS), pp.470-479, 2012.
DOI : 10.1109/focs.2012.62
URL : http://www.ii.uib.no/~daniello/papers/PFDFullV1.pdf

F. V. Fomin, D. Lokshtanov, F. Panolan, and S. Saurabh, Efficient computation of representative families with applications in parameterized and exact algorithms, Journal of the ACM, vol.63, issue.4, 2016.

F. V. Fomin, D. Lokshtanov, V. Raman, and S. Saurabh, Bidimensionality and EP-TAS, Proc. of the 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.748-759, 2011.
DOI : 10.1007/978-1-4939-2864-4_47

F. V. Fomin, D. Lokshtanov, S. Saurabh, and D. M. Thilikos, Bidimensionality and kernels, Proc. of the 21st ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.503-510, 2010.
DOI : 10.1137/1.9781611973075.43
URL : http://arxiv.org/pdf/1606.05689

F. V. Fomin, D. Lokshtanov, S. Saurabh, and D. M. Thilikos, Linear kernels for (connected) dominating set on H-minor-free graphs, Proc. of the 23rd ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.82-93, 2012.
DOI : 10.1137/1.9781611973099.7
URL : https://epubs.siam.org/doi/pdf/10.1137/1.9781611973099.7

F. V. Fomin, S. Oum, and D. M. Thilikos, Rank-width and tree-width of H-minorfree graphs, European Journal of Combinatorics, vol.31, issue.7, pp.1617-1628, 2010.

L. Fortnow and R. Santhanam, Infeasibility of instance compression and succinct PCPs for NP, Journal of Computer and System Sciences, vol.77, issue.1, pp.91-106, 2011.
DOI : 10.1016/j.jcss.2010.06.007
URL : https://doi.org/10.1016/j.jcss.2010.06.007

M. Frick and M. Grohe, The complexity of first-order and monadic second-order logic revisited, Annals of Pure and Applied Logic, vol.130, issue.1-3, pp.3-31, 2004.

A. Gainer-dewar, ?-species and the enumeration of k-trees, Electronic Journal of Combinatorics, vol.19, issue.4, p.45, 2012.

A. Gainer-dewar and I. M. Gessel, Counting unlabeled k-trees, Journal of Combinatorial Theory, Series A, vol.126, pp.177-193, 2014.
DOI : 10.1016/j.jcta.2014.05.002
URL : http://arxiv.org/pdf/1309.1429

J. Gajarsk´ygajarsk´y, P. Hlinen´yhlinen´y, J. Obdrzálek, S. Ordyniak, F. Reidl et al., Kernelization using structural parameters on sparse graph classes, Journal of Computer and System Sciences, vol.84, pp.219-242, 2017.

G. Galbiati, The complexity of a minimum reload cost diameter problem, Discrete Applied Mathematics, vol.156, issue.18, pp.3494-3497, 2008.

G. Galbiati, S. Gualandi, and F. Maffioli, On minimum changeover cost arborescences, Proc. of the 10th International Symposium on Experimental Algorithms (SEA), vol.6630, pp.112-123, 2011.
DOI : 10.1007/978-3-642-20662-7_10

G. Galbiati, S. Gualandi, and F. Maffioli, On minimum reload cost cycle cover, Discrete Applied Mathematics, vol.164, pp.112-120, 2014.
DOI : 10.1016/j.endm.2010.05.011

I. Gamvros, L. Gouveia, and S. Raghavan, Reload cost trees and network design, Networks, vol.59, issue.4, pp.365-379, 2012.
DOI : 10.1002/net.20443

R. Ganian, F. Slivovsky, and S. Szeider, Meta-kernelization with structural parameters, Journal of Computer and System Sciences, vol.82, issue.2, pp.333-346, 2016.
DOI : 10.1016/j.jcss.2015.08.003
URL : http://arxiv.org/pdf/1303.1786

Y. Gao, Treewidth of Erd? os-Rényi random graphs, random intersection graphs, and scale-free random graphs, Discrete Applied Mathematics, vol.160, issue.4-5, pp.566-578, 2012.

M. Garey and D. Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness, 1979.

E. Ghosh, S. Kolay, M. Kumar, P. Misra, F. Panolan et al., Faster parameterized algorithms for deletion to split graphs, Algorithmica, vol.71, issue.4, pp.989-1006, 2015.
DOI : 10.1007/s00453-013-9837-5

A. C. Giannopoulou, B. M. Jansen, D. Lokshtanov, and S. Saurabh, Uniform kernelization complexity of hitting forbidden minors, ACM Transaction on Algorithms, vol.13, issue.3, 2017.
DOI : 10.1145/3029051
URL : http://arxiv.org/pdf/1502.03965

M. C. Golumbic, T. Hirst, and M. Lewenstein, Uniquely restricted matchings, Algorithmica, vol.31, pp.139-154, 2001.
DOI : 10.1007/s00453-001-0004-z

L. Gourvès, A. Lyra, C. Martinhon, and J. Monnot, The minimum reload s ? t path, trail and walk problems, Discrete Applied Mathematics, vol.158, issue.13, pp.1404-1417, 2010.

D. Gözüpek, S. Buhari, and F. Alagöz, A spectrum switching delay-aware scheduling algorithm for centralized cognitive radio networks, IEEE Transactions on Mobile Computing, vol.12, issue.7, pp.1270-1280, 2013.

D. Gözüpek, H. Shachnai, M. Shalom, and S. Zaks, Constructing minimum changeover cost arborescenses in bounded treewidth graphs, Theoretical Computer Science, vol.621, pp.22-36, 2016.

D. Gözüpek and M. Shalom, Edge coloring with minimum reload/changeover costs, Proc. of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization (CTW), pp.205-208, 2015.

D. Gözüpek, M. Shalom, A. Voloshin, and S. Zaks, On the complexity of constructing minimum changeover cost arborescences, Theoretical Computer Science, vol.540, pp.40-52, 2014.

M. Grohe and D. Marx, Structure theorem and isomorphism test for graphs with excluded topological subgraphs, SIAM Journal on Computing, vol.44, issue.1, pp.114-159, 2015.
DOI : 10.1145/2213977.2213996
URL : http://www.cs.bme.hu/%7Edmarx/papers/grohe-marx-topdec-stoc2012.pdf

D. J. Guan and X. Zhu, A coloring problem for weighted graphs, Information Processing Letters, vol.61, issue.2, pp.77-81, 1997.
DOI : 10.1016/s0020-0190(97)00002-1

J. Guo, J. Gramm, F. Hüffner, R. Niedermeier, and S. Wernicke, Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization, Journal of Computing and System Sciences, vol.72, issue.8, pp.1386-1396, 2006.
DOI : 10.1016/j.jcss.2006.02.001
URL : https://doi.org/10.1016/j.jcss.2006.02.001

J. Guo and R. Niedermeier, Linear problem kernels for NP-hard problems on planar graphs, Proc. of the 34th International Colloquium on Automata, Languages and Programming (ICALP), vol.4596, pp.375-386, 2007.
DOI : 10.1007/978-3-540-73420-8_34
URL : http://theinf1.informatik.uni-jena.de/publications/kernel-planar-stamped.pdf

J. Guo, R. Niedermeier, and S. Wernicke, Fixed-parameter tractability results for full-degree spanning tree and its dual, Networks, vol.56, issue.2, pp.116-130, 2010.
DOI : 10.1007/11847250_19
URL : http://theinf1.informatik.uni-jena.de/publications/fulldegree-stamped.pdf

R. Halin, s-functions for graphs, Journal of Geometry, vol.8, pp.171-186, 1976.
DOI : 10.1007/bf01917434

I. V. Hicks, Branch decompositions and minor containment, Networks, vol.43, issue.1, pp.1-9, 2004.
DOI : 10.1002/net.10099

R. Impagliazzo, R. Paturi, and F. Zane, Which problems have strongly exponential complexity?, Journal of Computer and System Sciences, vol.63, issue.4, pp.512-530, 2001.
DOI : 10.1006/jcss.2001.1774
URL : https://doi.org/10.1006/jcss.2001.1774

B. M. Jansen and H. L. Bodlaender, Vertex cover kernelization revisited -upper and lower bounds for a refined parameter, Theory of Computing Systems, vol.53, pp.263-299, 2013.
DOI : 10.1007/s00224-012-9393-4
URL : https://hal.archives-ouvertes.fr/hal-00573608

B. M. Jansen, D. Lokshtanov, and S. Saurabh, A near-optimal planarization algorithm, Proc. of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.1802-1811, 2014.
DOI : 10.1137/1.9781611973402.130
URL : http://www.ii.uib.no/~daniello/papers/PlanarizationAlgorithm.pdf

B. M. Jansen and J. J. Wulms, Lower bounds for protrusion replacement by counting equivalence classes, Proc. of the 11th International Symposium on Parameterized and Exact Computation (IPEC), vol.63, p.12, 2016.
DOI : 10.1016/j.dam.2019.02.024
URL : http://arxiv.org/pdf/1609.09304

K. Jansen, S. Kratsch, D. Marx, and I. Schlotter, Bin packing with fixed number of bins revisited, Journal of Computer and System Sciences, vol.79, issue.1, pp.39-49, 2013.
DOI : 10.1007/978-3-642-13731-0_25

F. V. Jensen, Bayesian Networks and Decision Graphs, 2001.

I. A. Kanj, M. J. Pelsmajer, M. Schaefer, and G. Xia, On the Induced Matching problem, Journal of Computer and System Sciences, vol.77, issue.6, pp.1058-1070, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00231081

K. Kawarabayashi, Planarity allowing few error vertices in linear time, Proc. of the 50th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp.639-648, 2009.

K. Kawarabayashi and Y. Kobayashi, Linear min-max relation between the treewidth of H-minor-free graphs and its largest grid, Proc. of the 29th International Symposium on Theoretical Aspects of Computer Science (STACS), vol.14, pp.278-289, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00678187

K. Kawarabayashi, Y. Kobayashi, and B. A. Reed, The disjoint paths problem in quadratic time, Journal of Combinatorial Theory, Series B, vol.102, issue.2, pp.424-435, 2012.

K. Kawarabayashi and M. Thorup, The Minimum k-way Cut of Bounded Size is Fixed-Parameter Tractable, Proc. of the 52nd Annual Symposium on Foundations of Computer Science (FOCS), pp.160-169, 2011.

J. M. Keil, The complexity of domination problems in circle graphs, Discrete Applied Mathematics, vol.42, issue.1, pp.51-63, 1993.

E. J. Kim, C. Paul, and G. Philip, A single-exponential FPT algorithm for the K 4 -minor cover problem, Journal of Computer and System Sciences, vol.81, issue.1, pp.186-207, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01496435

R. Kim, S. Kim, J. Ma, and B. Park, Cycles with two blocks in k-chromatic digraphs, 2016.

T. Kloks, Treewidth, Computations and Approximations, vol.842, 1994.

T. Kociumaka and M. Pilipczuk, Deleting vertices to graphs of bounded genus, 2017.

J. Komlós and E. Szemerédi, Topological cliques in graphs II, Combinatorics, Probability and Computing, vol.5, issue.01, pp.79-90, 1996.

V. R. Konda and T. Y. Chow, Algorithm for traffic grooming in optical networks to minimize the number of transceivers, Proc. of IEEE Workshop on High Performance Switching and Routing, pp.218-221, 2001.

S. Kreutzer, Algorithmic meta-theorems, Electronic Colloquium on Computational Complexity, vol.16, p.147, 2009.

S. Kreutzer and S. Tazari, On brambles, grid-like minors, and parameterized intractability of monadic second-order logic, Proc. of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.354-364, 2010.

D. Kühn and D. Osthus, Minors in graphs of large girth, Random Structutres & Algorithms, vol.22, issue.2, pp.213-225, 2003.

K. Kuratowski, Sur leprobì eme des courbes gauches en topologie, Fundamenta Matematicae, vol.15, issue.1, pp.271-283, 1930.

S. J. Lauritzen and D. J. Spiegelhalter, Local computations with probabilities on graphical structures and their application to expert systems, The Journal of the Royal Statistical Society. Series B (Methodological), vol.50, pp.157-224, 1988.

A. Leaf and P. D. Seymour, Tree-width and planar minors, Journal of Combinatorial Theory, Series B, vol.111, pp.38-53, 2015.

J. M. Lewis and M. Yannakakis, The node-deletion problem for hereditary properties is NP-complete, Journal of Computer and System Sciences, vol.20, issue.2, pp.219-230, 1980.

D. Lokshtanov, Wheel-free deletion is W [2]-hard, Proc. of the 3rd International Workshop on Parameterized and Exact Computation (IWPEC), pp.141-147, 2008.
DOI : 10.1007/978-3-540-79723-4_14
URL : http://www.ii.uib.no/~daniello/papers/wheelfree.pdf

D. Lokshtanov, D. Marx, and S. Saurabh, Known algorithms on graphs of bounded treewidth are probably optimal, Proc. of the 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.777-789, 2011.

D. Lokshtanov, D. Marx, and S. Saurabh, Slightly superexponential parameterized problems, Proc. of the 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.760-776, 2011.

D. Lokshtanov, D. Marx, and S. Saurabh, Lower bounds based on the Exponential Time Hypothesis, Bulletin of the EATCS, issue.105, pp.41-72, 2011.

D. Lokshtanov, M. Mnich, and S. Saurabh, A linear kernel for planar connected dominating set, Theoretical Computer Science, vol.23, issue.412, pp.2536-2543, 2011.

D. Lokshtanov, M. Mnich, and S. Saurabh, A linear kernel for Planar Connected Dominating Set, Theoretical Computer Science, vol.412, issue.23, pp.2536-2543, 2011.

D. Lokshtanov, N. S. Narayanaswamy, V. Raman, M. S. Ramanujan, and S. Saurabh, Faster parameterized algorithms using linear programming, ACM Transactions on Algorithms, vol.11, issue.2, p.15, 2014.
DOI : 10.1145/2566616
URL : http://arxiv.org/pdf/1203.0833

D. Lokshtanov, S. Saurabh, and S. Sikdar, Simpler parameterized algorithm for OCT, Proc. of the 20th International Workshop on Combinatorial Algorithms (IWOCA), vol.5874, pp.380-384, 2009.
DOI : 10.1007/978-3-642-10217-2_37
URL : http://www.ii.uib.no/~daniello/papers/octIterComp.pdf

D. Marx, Chordal Deletion is fixed-parameter tractable, Algorithmica, vol.57, issue.4, pp.747-768, 2010.
DOI : 10.1007/s00453-008-9233-8
URL : http://www.cs.bme.hu/~dmarx/papers/marx-wg2006.pdf

D. Marx, B. O'sullivan, and I. Razgon, Finding small separators in linear time via treewidth reduction, ACM Transactions on Algorithms, vol.9, issue.4, 2013.

D. Marx and I. Schlotter, Obtaining a planar graph by vertex deletion, Algorithmica, vol.62, issue.3-4, pp.807-822, 2012.

S. Mishra, On the maximum uniquely restricted matching for bipartite graphs, Electronic Notes in Discrete Mathematics, vol.37, pp.345-350, 2011.

D. Mitsche and G. Perarnau, On the treewidth and related parameters of random geometric graphs, Proc. of the 29th International Symposium on Theoretical Aspects of Computer Science, (STACS), vol.14, pp.408-419, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00678199

B. Mohar, An obstruction to embedding graphs on surfaces, Discrete Mathematics, vol.78, issue.1-2, pp.135-142, 1989.
DOI : 10.1016/0012-365x(89)90170-2
URL : https://doi.org/10.1016/0012-365x(89)90170-2

J. W. Moon, The number of labeled k-trees, Journal of Combinatorial Theory, vol.6, issue.2, pp.196-199, 1969.

H. Moser and S. Sikdar, The parameterized complexity of the Induced Matching problem, Discrete Applied Mathematics, vol.157, issue.4, pp.715-727, 2009.

A. Nerode, Linear Automaton Transformations, Proceedings of the American Mathematical Society, vol.9, pp.541-544, 1958.
DOI : 10.2307/2033204
URL : https://www.ams.org/proc/1958-009-04/S0002-9939-1958-0135681-9/S0002-9939-1958-0135681-9.pdf

J. Nesetril, P. , and O. Mendez, Sparsity: Graphs, Structures, and Algorithms, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00768681

J. Ne?et?il and P. O. De-mendez, On nowhere dense graphs, European Journal of Combinatorics, vol.32, issue.4, pp.600-617, 2011.

R. Niedermeier, Invitation to fixed parameter algorithms, vol.31, 2006.

J. N?s?tril and P. Ossona-de-mendez, Grad and classes with bounded expansion I. Decompositions, European Journal of Combinatorics, vol.29, issue.3, 2008.

D. Osthus, H. J. Prömel, and A. Taraz, On random planar graphs, the number of planar graphs and their triangulations, Journal of Combinatorial Theory, Series B, vol.88, issue.1, pp.119-134, 2003.

G. Philip, V. Raman, and Y. Villanger, A quartic kernel for Pathwidth-One Vertex Deletion, Proc. of the 36th International Workshop on Graph-Theoretic Concepts in Computer Science (WG), vol.6410, pp.196-207, 2010.
DOI : 10.1007/978-3-642-16926-7_19
URL : http://arxiv.org/pdf/1009.0806.pdf

M. Pilipczuk, A tight lower bound for vertex planarization on graphs of bounded treewidth, Discrete Applied Mathematics, vol.231, pp.211-216, 2017.

A. Rafiey, Single Exponential FPT Algorithm for Interval Vertex Deletion and Interval Completion Problem. CoRR, abs/1211, vol.4629, 2012.

A. Rai, M. S. Ramanujan, and S. Saurabh, A parameterized algorithm for mixedcut, Proc. of the 12th Latin American Symposium on Theoretical Informatics (LATIN), vol.9644, pp.672-685, 2016.

B. A. Reed, K. Smith, and A. Vetta, Finding odd cycle transversals, Operations Research Letters, vol.32, issue.4, pp.299-301, 2004.
DOI : 10.1016/j.orl.2003.10.009

N. Robertson and P. D. Seymour, Graph Minors. II. Algorithmic aspects of treewidth, Journal of Algorithms, vol.7, pp.309-322, 1986.

N. Robertson and P. D. Seymour, Graph Minors. V. Excluding a planar graph, Journal of Combinatorial Theory, Series B, vol.41, pp.92-114, 1986.

N. Robertson and P. D. Seymour, Graph Minors. X. Obstructions to treedecomposition, Journal of Combinatorial Theory, Series B, vol.52, pp.153-190, 1991.

N. Robertson and P. D. Seymour, Graph Minors. III. Planar tree-width, Journal of Combinatorial Theory, Series B, vol.36, issue.1, pp.49-64, 1994.

N. Robertson and P. D. Seymour, Graph Minors. XIII. The disjoint paths problem, Journal of Combinatorial Theory, Series B, vol.63, pp.65-110, 1995.

N. Robertson and P. D. Seymour, Graph Minors. XX. Wagner's conjecture, Journal of Combinatorial Theory, Series B, vol.92, pp.325-357, 2004.

P. Scheffler, A practical linear time algorithm for disjoint paths in graphs with bounded tree-width, 1994.

P. D. Seymour and R. Thomas, Call routing and the ratcatcher, Combinatorica, vol.14, issue.2, pp.217-241, 1994.
DOI : 10.1007/bf01215352

N. Shami and M. Rasti, A joint multi-channel assignment and power control scheme for energy efficiency in cognitive radio networks, Proc. of IEEE Wireless Communications and Networking Conference (WCNC), pp.1-6, 2016.
DOI : 10.1109/wcnc.2016.7564912

L. Takács, On the number of distinct forests, SIAM Journal on Discrete Mathematics, vol.3, issue.4, pp.574-581, 1990.

A. Takahashi, S. Ueno, and Y. Kajitani, Minimal acyclic forbidden minors for the family of graphs with bounded path-width, Discrete Mathematics, vol.127, issue.1-3, pp.293-304, 1994.

A. Takahashi, S. Ueno, and Y. Kajitani, Mixed searching and proper-path-width, Theoretical Computer Science, vol.137, issue.2, pp.253-268, 1995.
DOI : 10.1007/3-540-54945-5_50

A. Thomason, The extremal function for complete minors, Journal of Combinatorial Theory, Series B, vol.81, issue.2, pp.318-338, 2001.
DOI : 10.1006/jctb.2000.2013
URL : https://doi.org/10.1006/jctb.2000.2013

S. Thomassé, N. Trotignon, and K. Vuskovic, A polynomial Turing-kernel for weighted independent set in bull-free graphs, Algorithmica, vol.77, issue.3, pp.619-641, 2017.

C. A. Tovey, A simplified NP-complete satisfiability problem, Discrete Applied Mathematics, vol.8, pp.85-89, 1984.

B. Van-antwerpen-de-fluiter, Algorithms for graphs of small treewidth, 1997.

R. Van-bevern, R. G. Downey, M. R. Fellows, S. Gaspers, and F. A. Rosamond, Myhill-nerode methods for hypergraphs, Algorithmica, vol.73, issue.4, pp.696-729, 2015.

V. V. Vazirani, Approximation algorithms, 2001.

K. Wagner and . Graphentheorie, , vol.248, p.248, 1970.

H. Wirth and J. Steffan, Reload cost problems: minimum diameter spanning tree, Discrete Applied Mathematics, vol.113, issue.1, pp.73-85, 2001.

P. Wollan, The structure of graphs not admitting a fixed immersion, Journal of Combinatorial Theory Series B, vol.110, pp.47-66, 2015.

M. Yannakakis and F. Gavril, Edge dominating sets in graphs, SIAM Journal of Applied Mathematics, vol.38, issue.3, pp.364-372, 1980.

C. Yap, Some consequences of non-uniform conditions on uniform classes. Theoretical Computer Science, vol.26, pp.287-300, 1983.