F. Research, We presented parameterized algorithms for F-M-Deletion and F-TM-Deletion taking as parameter the treewidth of the input graph. These algorithms are complemented by single-exponential algorithms and lower bounds

A. Boral, M. Cygan, T. Kociumaka, and M. Pilipczuk, A Fast Branching Algorithm for Cluster Vertex Deletion, Theory of Computing Systems, vol.58, issue.2, pp.357-376, 2015.

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

J. Baste, M. Noy, and I. Sau, On the number of labeled graphs of bounded treewidth, European Journal of Combinatorics, vol.71, pp.12-21, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01734085

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, A complexity dichotomy for hitting connected minors on bounded treewidth graphs: the chair and the banner draw the boundary, Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp.951-970, 2020.

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

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, 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, pp.1-69, 2016.
URL : https://hal.archives-ouvertes.fr/lirmm-00904532

H. L. Bodlaender and B. Van-antwerpen-de-fluiter, Reduction Algorithms for Graphs of Small Treewidth, Information and Computation, vol.167, issue.2, pp.86-119, 2001.

N. Bonichon, C. Gavoille, N. Hanusse, D. Poulalhon, and G. Schaeffer, Planar Graphs, via Well-Orderly Maps and Trees, Graphs and Combinatorics, vol.22, issue.2, pp.185-202, 2006.
URL : https://hal.archives-ouvertes.fr/hal-00400503

B. Courcelle, The monadic second-order logic of graphs. I. Recognizable sets of finite graphs, Information and Computation, vol.85, issue.1, pp.12-75, 1990.
URL : https://hal.archives-ouvertes.fr/hal-00353765

M. Cygan, F. V. Fomin, ?. Kowalik, D. Lokshtanov, D. Marx et al., Advanced kernelization algorithms, Parameterized Algorithms, pp.285-319, 2015.

M. Cygan, J. Nederlof, M. Pilipczuk, M. Pilipczuk, J. M. Rooij et al., Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, pp.150-159, 2011.

E. D. Demaine and M. Hajiaghayi, The Bidimensionality Theory and Its Algorithmic Applications, The Computer Journal, vol.51, issue.3, pp.292-302, 2007.

E. D. Demaine, F. V. Fomin, M. 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. T. Hajiaghayi, Graphs excluding a fixed minor have grids as large as treewidth, with combinatorial and algorithmic applications through bidimensionality, Proc. of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.682-689, 2005.

R. Diestel, Extremal Graph Theory, Graph Theory, vol.173, pp.173-207, 2017.

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, 2009.

R. G. Downey and M. R. Fellows, Parameterized Approximation, Texts in Computer Science, pp.623-644, 2013.

F. V. Fomin, E. D. Demaine, M. T. Hajiaghayi, and D. M. Thilikos, Bidimensionality, Encyclopedia of Algorithms, pp.203-207, 2016.
URL : https://hal.archives-ouvertes.fr/lirmm-01483707

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

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, pp.1-60, 2016.

F. V. Fomin, D. Lokshtanov, S. Saurabh, and D. M. Thilikos, Bidimensionality and Kernels, Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, pp.503-510, 2010.

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

P. A. Golovach, G. Stamoulis, and D. M. Thilikos, Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable, Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp.931-950, 2020.

M. Grohe, K. Kawarabayashi, D. Marx, and P. Wollan, Finding topological subgraphs is fixed-parameter tractable, Proceedings of the 43rd annual ACM symposium on Theory of computing - STOC '11, pp.479-488, 2011.

Q. Gu and H. Tamaki, Optimal branch-decomposition of planar graphs in O ( n 3 ) Time, ACM Transactions on Algorithms, vol.4, issue.3, pp.1-13, 2008.

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.

B. M. Jansen, D. Lokshtanov, and S. Saurabh, A Near-Optimal Planarization Algorithm, Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, pp.1802-1811, 2013.

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, pp.1-41, 2016.
URL : https://hal.archives-ouvertes.fr/lirmm-00829999

E. J. Kim, C. Paul, and G. Philip, A single-exponential FPT algorithm for the K4-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

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

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

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, D. Marx, and S. Saurabh, Slightly Superexponential Parameterized Problems, SIAM Journal on Computing, vol.47, issue.3, pp.675-702, 2018.

B. Mohar and C. Thomassen, Graph minors and graphs on surfaces, Surveys in Combinatorics, 2001, pp.145-164, 2001.

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

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

N. Robertson and P. D. Seymour, Graph minors. X. Obstructions to tree-decomposition, Journal of Combinatorial Theory, Series B, vol.52, issue.2, pp.153-190, 1991.

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. XXII. Irrelevant vertices in linkage problems, Journal of Combinatorial Theory, Series B, vol.102, issue.2, pp.530-563, 2012.

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

J. Rué, I. Sau, and D. M. Thilikos, Dynamic Programming for H-minor-free Graphs, Lecture Notes in Computer Science, vol.7434, pp.86-97, 2012.

I. Sau, G. Stamoulis, and D. M. Thilikos, Automata, Languages and Programming, To appear in Proc. of the 47th International Colloquium on Automata, Languages and Programming, 2004.

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

W. T. Tutte, A Census of Planar Triangulations, Canadian Journal of Mathematics, vol.14, pp.21-38, 1962.

H. Whitney, A Set of Topological Invariants for Graphs, American Journal of Mathematics, vol.55, issue.1/4, p.231, 1933.