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, M. Grohe, and S. Kreutzer, Computing excluded minors, Proc. of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.641-650, 2008.

E. Althaus and S. Ziegler, Optimal Tree Decompositions Revisited: A Simpler Linear-Time FPT Algorithm, 2019.

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), volume 89 of LIPIcs, vol.4, pp.1-4, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01733845

J. Baste, I. Sau, and D. M. Thilikos, A complexity dichotomy for hitting connected minors on bounded treewidth graphs: the chair and the banner draw the boundary, Proc. of the 31st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.951-970, 2020.
URL : https://hal.archives-ouvertes.fr/lirmm-02991215

J. Baste, I. Sau, and D. M. Thilikos, Hitting minors on bounded treewidth graphs. II. single-exponential algorithms, Theoretical Computer Science, vol.814, pp.135-152, 2020.
URL : https://hal.archives-ouvertes.fr/lirmm-02989938

J. Baste, I. Sau, and D. M. Thilikos, Hitting minors on bounded treewidth graphs. III. lower bounds, Journal of Computer and System Sciences, vol.109, pp.56-77, 2020.
URL : https://hal.archives-ouvertes.fr/lirmm-02989938

L. Hans, P. Bodlaender, M. S. Grønås-drange, F. V. Dregi, D. Fomin et al., A c k n 5-Approximation Algorithm for Treewidth, SIAM Journal on Computing, vol.45, issue.2, pp.317-378, 2016.

L. Hans, P. Bodlaender, D. Heggernes, and . Lokshtanov, Graph modification problems (dagstuhl seminar 14071), Dagstuhl Reports, vol.4, issue.2, pp.38-59, 2014.

L. Hans, H. Bodlaender, Y. Ono, and . Otachi, A faster parameterized algorithm for pseudoforest deletion, Discrete Applied Mathematics, vol.236, pp.42-56, 2018.

E. Andries, H. J. Brouwer, and . Veldman, Contractibility and NP-completeness, Journal of Graph Theory, vol.11, issue.1, pp.71-79, 1987.

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

C. Crespelle, P. Grønås, F. V. Drange, P. A. Fomin, and . Golovach, A survey of parameterized algorithms and the complexity of edge modification, 2013.

M. Cygan, V. Fedor, L. Fomin, D. Kowalik, D. Lokshtanov et al., Marcin Pilipczuk, Michal Pilipczuk, and Saket Saurabh. Parameterized Algorithms, 2015.

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

E. D. Demaine, F. V. Fomin, M. Hajiaghayi, and D. M. Thilikos, Bidimensional parameters and local treewidth, SIAM Journal on Discrete Mathematics, vol.18, issue.3, pp.501-511, 2004.

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

M. R. Fellows, J. Kratochvíl, M. Middendorf, and F. Pfeiffer, The complexity of induced minors and related problems, Algorithmica, vol.13, issue.3, pp.266-282, 1995.

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

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

V. Fedor, P. A. Fomin, D. M. Golovach, and . Thilikos, Modification to planarity is fixed parameter tractable, Proc. of the 36th International Symposium on Theoretical Aspects of Computer Science (STACS), volume 126 of LIPIcs, vol.28, pp.1-28, 2019.

V. Fedor, D. Fomin, N. Lokshtanov, S. Misra, and . Saurabh, Planar F-Deletion: Approximation, Kernelization and Optimal FPT Algorithms, Proc. of the 53rd Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp.470-479, 2012.

V. Fedor, D. Fomin, F. Lokshtanov, S. Panolan, M. Saurabh et al., Hitting Topological Minors is FPT. CoRR, Proc. of the 52nd Annual ACM Symposium on Theory of Computing (STOC 2020, 2019.

V. Fedor, S. Fomin, N. Saurabh, and . Misra, Graph modification problems: A modern perspective, Proc. of the 9th International Frontiers in Algorithmics Workshop (FAW), vol.9130, pp.3-6, 2015.

R. Michael, D. S. Garey, and . Johnson, Computers and intractability. A guide to the theory of NP-completeness, 1979.

C. Archontia, . Giannopoulou, M. P. Bart, D. Jansen, S. Lokshtanov et al., Uniform kernelization complexity of hitting forbidden minors, ACM Transactions on Algorithms, vol.13, issue.3, 2017.

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.

M. P. Bart, D. Jansen, S. Lokshtanov, and . Saurabh, A near-optimal planarization algorithm, Proc. of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.1802-1811, 2014.

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

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.

. I-c-a-l-p, 95:20 An FPT-Algorithm for Recognizing k-Apices of Minor-Closed Graph Classes, 2020.

Y. Ken-ichi-kawarabayashi and . 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.

K. Kawarabayashi, Y. Kobayashi, and B. Reed, The disjoint paths problem in quadratic time, Journal of Combinatorial Theory, Series B, 2011.

K. Kawarabayashi, R. Thomas, and P. Wollan, A new proof of the flat wall theorem, Journal of Combinatorial Theory, Series B, vol.129, pp.204-238, 2018.

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-00829999

E. J. Kim, M. J. Serna, and D. M. Thilikos, Data-compression for parametrized counting problems on sparse graphs, Proc. of the 29th International Symposium on Algorithms and Computation (ISAAC), volume 123 of LIPIcs, vol.20, pp.1-20, 2018.
URL : https://hal.archives-ouvertes.fr/lirmm-02342803

T. Kociumaka and M. Pilipczuk, Faster deterministic feedback vertex set, Information Processing Letters, vol.114, issue.10, pp.556-560, 2014.

T. Kociumaka and M. Pilipczuk, Deleting Vertices to Graphs of Bounded Genus, Algorithmica, vol.81, issue.9, pp.3655-3691, 2019.

A. V. Kostochka, Lower bound of the Hadwiger number of graphs by their average degree, Combinatorica, vol.4, pp.307-316, 1984.

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), vol.5018, pp.141-147, 2008.

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

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

L. Perkovic and B. Reed, An Improved Algorithm for Finding Tree Decompositions of Small Width, International Journal of Foundations of Computer Science, vol.11, pp.365-371, 2000.

B. Reed, K. Smith, and A. Vetta, Finding odd cycle transversals, Operations Research Letters, vol.32, issue.4, pp.299-301, 2004.

N. Robertson and P. D. Seymour, Graph Minors. XIII. The Disjoint Paths Problem, Journal of Combinatorial Theory, Series B, vol.63, issue.1, pp.65-110, 1995.

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

I. Sau, G. Stamoulis, and D. M. Thilikos, An FPT-algorithm for recognizing k-apices of minor-closed graph classes. CoRR, abs, 2004.
URL : https://hal.archives-ouvertes.fr/lirmm-02991704

R. Sharan, Graph Modification Problems and their Applications to Genomic Research, 2002.

D. M. Thilikos, Graph minors and parameterized algorithm design, The Multivariate Algorithmic Revolution and Beyond -Essays Dedicated to Michael R. Fellows on the Occasion of His 60th Birthday, pp.228-256, 2012.
URL : https://hal.archives-ouvertes.fr/lirmm-01083542

A. Thomason, The extremal function for complete minors, Journal of Combinatorial Theory, Series B, vol.81, issue.2, pp.318-338, 2001.