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.
DOI : 10.1137/S0097539793251219

P. S. Bonsma, The complexity of the matching-cut problem for planar graphs and other graph classes, Journal of Graph Theory, vol.247, issue.1-3, pp.109-126, 2009.
DOI : 10.1002/jgt.20390

A. Brandstädt, F. F. Dragan, V. B. Le, and T. Szymczak, On stable cutsets in graphs, Discrete Applied Mathematics, vol.105, issue.1-3, pp.39-50, 2000.
DOI : 10.1016/S0166-218X(00)00197-9

K. Cameron, E. M. Eschen, C. T. Hò, and R. Sritharan, The Complexity of the List Partition Problem for Graphs, SIAM Journal on Discrete Mathematics, vol.21, issue.4, pp.900-929, 2007.
DOI : 10.1137/060666238

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.
DOI : 10.1016/0890-5401(90)90043-H

URL : https://hal.archives-ouvertes.fr/hal-00353765

C. M. De-figueiredo, S. Klein, Y. Kohayakawa, and B. A. Reed, Finding Skew Partitions Efficiently, Journal of Algorithms, vol.37, issue.2, pp.505-521, 2000.
DOI : 10.1006/jagm.1999.1122

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
DOI : 10.1145/1993636.1993700

URL : http://arxiv.org/pdf/1011.1827

P. Heggernes, P. Van-'t-hof, D. Marx, N. Misra, and Y. Villanger, On the Parameterized Complexity of Finding Separators with Non-Hereditary Properties, Algorithmica, vol.55, issue.4, pp.687-713, 2015.
DOI : 10.1016/0012-365X(85)90051-2

T. Ito, M. Kami´nskikami´nski, D. Paulusma, and D. M. Thilikos, On disconnected cuts and separators, Discrete Applied Mathematics, vol.159, issue.13, pp.1345-1351, 2011.
DOI : 10.1016/j.dam.2011.04.027

URL : https://doi.org/10.1016/j.dam.2011.04.027

T. Ito, M. Kami´nskikami´nski, D. Paulusma, and D. M. Thilikos, Parameterizing cut sets in a graph by the number of their components, Theoretical Computer Science, vol.412, issue.45, pp.6340-6350, 2011.
DOI : 10.1016/j.tcs.2011.07.005

M. Kami´nskikami´nski, D. Paulusma, A. Stewart, and D. M. Thilikos, Minimal disconnected cuts in planar graphs, Proc. FCT 2015, pp.243-254

M. Kami´nskikami´nski, D. Paulusma, and D. M. Thilikos, Contractions of planar graphs in polynomial time, Proc. ESA 2010, pp.122-133, 2010.

R. M. Karp, Reducibility among combinatorial problems, In: Complexity of Computer Computations, pp.85-103, 1972.

W. S. Kennedy and B. Reed, Fast Skew Partition Recognition, LNCS, vol.98, pp.101-107, 2008.
DOI : 10.1016/j.jctb.2007.07.004

K. Kuratowski, Sur le probl??me des courbes gauches en Topologie, Fundamenta Mathematicae, vol.15, pp.271-283, 1930.
DOI : 10.4064/fm-15-1-271-283

V. B. Le, R. Mosca, and H. Müller, On stable cutsets in claw-free graphs and planar graphs, Journal of Discrete Algorithms, vol.6, issue.2, pp.256-276, 2008.
DOI : 10.1016/j.jda.2007.04.001

URL : http://wwwteo.informatik.uni-rostock.de/%7Ele/Research/scsJDA.pdf

B. Martin and D. Paulusma, The computational complexity of disconnected cut and <mml:math altimg="si1.gif" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd" xmlns:sa="http://www.elsevier.com/xml/common/struct-aff/dtd"><mml:mn>2</mml:mn><mml:msub><mml:mrow><mml:mi>K</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub></mml:math>-partition, Journal of Combinatorial Theory, Series B, vol.111, pp.17-37, 2015.
DOI : 10.1016/j.jctb.2014.09.002

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.
DOI : 10.1145/2500119

URL : http://arxiv.org/pdf/1110.4765

B. Mohar, A Linear Time Algorithm for Embedding Graphs in an Arbitrary Surface, SIAM Journal on Discrete Mathematics, vol.12, issue.1, pp.6-26, 1999.
DOI : 10.1137/S089548019529248X

N. Robertson, P. Seymour, and R. Thomas, Quickly Excluding a Planar Graph, Journal of Combinatorial Theory, Series B, vol.62, issue.2, pp.62-323, 1994.
DOI : 10.1006/jctb.1994.1073

URL : https://doi.org/10.1006/jctb.1994.1073

R. E. Tarjan, Decomposition by clique separators, Discrete Mathematics, vol.55, issue.2, pp.221-232, 1985.
DOI : 10.1016/0012-365X(85)90051-2

URL : https://doi.org/10.1016/0012-365x(85)90051-2

S. H. Whitesides, An algorithm for finding clique cut-sets, Information Processing Letters, vol.12, issue.1, pp.31-32, 1981.
DOI : 10.1016/0020-0190(81)90072-7