I. Adler, S. G. Kolliopoulos, P. K. Krause, D. Lokshtanov, S. Saurabh et al., Irrelevant vertices for the planar Disjoint Paths Problem, Journal of Combinatorial Theory, Series B, vol.122, pp.815-843, 2017.
URL : https://hal.archives-ouvertes.fr/lirmm-00904538

Z. Bai, J. Tu, and Y. Shi, Treewidth of treewidth-bounded graphs, Treewidth, pp.173-183

J. Baste, Composing dynamic programming tree-decomposition-based algorithms, CoRR, 2019.

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. II. Single-exponential algorithms, Theoretical Computer Science, vol.814, pp.135-152, 2020.
URL : https://hal.archives-ouvertes.fr/lirmm-02989938

S. Guillemot, Parameterized Complexity and Approximability of the SLCS Problem, Parameterized and Exact Computation, vol.115, pp.115-128
URL : https://hal.archives-ouvertes.fr/hal-00824929

H. L. Bodlaender, A partial k-arboretum of graphs with bounded treewidth, Theoretical Computer Science, vol.209, issue.1-2, pp.1-45, 1998.

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, F. V. Fomin, D. Lokshtanov, E. Penninkx, S. Saurabh et al., (Meta) Kernelization, 2009 50th Annual IEEE Symposium on Foundations of Computer Science, 2009.
URL : https://hal.archives-ouvertes.fr/lirmm-00904532

. Thilikos, Meta) Kernelization, Journal of the ACM, vol.63, p.69, 2016.

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

É. Bonnet, N. Brettell, O. Kwon, and D. Marx, Generalized Feedback Vertex Set Problems on Bounded-Treewidth Graphs: Chordality is the Key to Single-Exponential Parameterized Algorithms, Algorithmica, vol.81, issue.10, pp.3890-3935, 2019.
URL : https://hal.archives-ouvertes.fr/hal-01994406

J. Chuzhoy, Improved Bounds for the Flat Wall Theorem, Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, pp.256-275, 2014.

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

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

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 and D. Kratsch, Time Versus Space, Exact Exponential Algorithms, pp.161-170, 2010.

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

, Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, Proc. of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.503-510, 2010.

C. Bidimensionality, , 2016.

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, C. Paul, I. Sau, and D. M. Thilikos, Explicit Linear Kernels for Packing Problems, Algorithmica, vol.81, issue.4, pp.1615-1656, 2018.
URL : https://hal.archives-ouvertes.fr/lirmm-02342736

P. A. Golovach, M. Kami?ski, S. Maniatis, and D. M. Thilikos, The Parameterized Complexity of Graph Cyclability, SIAM Journal on Discrete Mathematics, vol.31, issue.1, pp.511-541, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01083993

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.

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.

M. Kaminski and D. M. Thilikos, Contraction checking in graphs on surfaces, Proc. of the 29th International Symposium on Theoretical Aspects of Computer Science, (STACS), vol.14, pp.182-193, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00678173

G. Kant, Drawing planar graphs using the lmc-ordering, Proceedings., 33rd Annual Symposium on Foundations of Computer Science, 1992.

K. Kawarabayashi and Y. Kobayashi, Linear min-max relation between the treewidth of an H-minor-free graph and its largest grid minor, Journal of Combinatorial Theory, Series B, vol.141, pp.165-180, 2020.

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.

K. Kawarabayashi and P. Wollan, A shorter proof of the graph minor algorithm, Proceedings of the 42nd ACM symposium on Theory of computing - STOC '10, pp.687-694, 2010.

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

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

S. Kratsch and M. Wahlstrom, Representative Sets and Irrelevant Vertices: New Tools for Kernelization, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science, pp.450-459, 2012.

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, Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, pp.760-776, 2011.

B. Mohar and C. Thomassen, Monica Chojnacka. <italic>Working Women of Early Modern Venice</italic>. (Johns Hopkins University Studies in Historical and Political Science.) Baltimore: Johns Hopkins University Press. 2001. Pp. xxii, 188. $32.50, The American Historical Review, 2002.

J. S. Myers* and A. Thomason, The Extremal Function For Noncomplete Minors, Combinatorica, vol.25, issue.6, pp.725-753, 2005.

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

B. A. Reed, Rooted routing in the plane, Discrete Applied Mathematics, vol.57, issue.2-3, pp.213-227, 1995.

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

J. Tu, L. Wu, J. Yuan, and L. Cui, On the vertex cover $$P_3$$ P 3 problem parameterized by treewidth, Journal of Combinatorial Optimization, vol.34, issue.2, pp.414-425, 2016.

D. P. Williamson and D. B. Shmoys, The Design of Approximation Algorithms, 2009.