C. Balbuena, A. Carmona, J. Fàbrega, and M. A. Fiol, Extraconnectivity of graphs with large minimum degree and girth, Discrete Mathematics, vol.167, pp.85-100, 1997.

P. Berman and M. Karpinski, Approximation hardness of bounded degree MIN-CSP and MIN-BISECTION, Electronic Colloquium on Computational Complexity, vol.8, issue.26, 2001.

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.

P. Bonsma, N. Ueffing, and L. Volkmann, Edge-cuts leaving components of order at least three, Discrete Mathematics, vol.256, issue.1, pp.431-439, 2002.

J. Chen, X. Huang, I. A. Kanj, and G. Xia, Strong computational lower bounds via parameterized complexity, Journal of Computer and System Sciences, vol.72, issue.8, pp.1346-1367, 2006.

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. Cygan, F. Fomin, B. M. Jansen, L. Kowalik, D. Lokshtanov et al., Open problems from School on Parameterized Algorithms and Complexity, 2014.

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

M. Cygan, L. Kowalik, and M. Pilipczuk, Open problems from Update Meeting on Graph Separation Problems, 2013.

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.

R. Diestel, Graph Theory, 2005.

R. G. Downey, V. Estivill-castro, M. R. Fellows, E. Prieto, and F. A. Rosamond, Cutting up is hard to do: the parameterized complexity of k-cut and related problems, Electronic Notes in Theoretical Computer Science, vol.78, pp.209-222, 2003.

R. G. Downey and M. R. Fellows, Parameterized Complexity, 1999.

M. E. Dyer and A. M. Frieze, On the complexity of partitioning graphs into connected subgraphs, Discrete Aplied Mathematics, vol.10, pp.139-153, 1985.

M. E. Dyer and A. M. Frieze, Planar 3DM is NP-complete, Journal of Algorithms, vol.7, issue.2, pp.174-184, 1986.

A. Esfahanian and S. L. Hakimi, On computing a conditional edge-connectivity of a graph, Information Processing Letters, vol.27, issue.4, pp.195-199, 1988.

J. Fàbrega and M. A. Fiol, Extraconnectivity of graphs with large girth, Discrete Mathematics, vol.127, pp.163-170, 1994.

J. Flum and M. Grohe, Parameterized Complexity Theory, 2006.

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

M. R. Garey, D. S. Johnson, and L. J. Stockmeyer, Some simplified NP-complete graph problems, Theoretical Computer Science, vol.1, issue.3, pp.237-267, 1976.

A. Holtkamp, Connectivity in Graphs and Digraphs. Maximizing vertex-, edgeand arc-connectivity with an emphasis on local connectivity properties, 2013.

A. Holtkamp, D. Meierling, and L. P. Montejano, k-restricted edge-connectivity in triangle-free graphs, Discrete Applied Mathematics, vol.160, issue.9, pp.1345-1355, 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.

E. J. Kim, C. Paul, I. Sau, and D. M. Thilikos, Parameterized algorithms for minmax multiway cut and list digraph homomorphism, Proc. of the 10th International Symposium on Parameterized and Exact Computation (IPEC), volume 43 of LIPIcs, pp.78-89, 2015.
URL : https://hal.archives-ouvertes.fr/lirmm-01487567

D. Marx, Parameterized graph separation problems, Theoretical Computer Science, vol.351, issue.3, pp.394-406, 2006.

D. Marx and M. Pilipczuk, Everything you always wanted to know about the parameterized complexity of subgraph isomorphism (but were afraid to ask), Proc. of the 31st International Symposium on Theoretical Aspects of Computer Science (STACS), volume 25 of LIPIcs, pp.542-553, 2014.

M. Naor, L. J. Schulman, and A. Srinivasan, Splitters and near-optimal derandomization, Proc. of the 36th Annual Symposium on Foundations of Computer Science (FOCS), pp.182-191, 1995.

R. Niedermeier, Invitation to Fixed-Parameter Algorithms, 2006.

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.

M. Stoer and F. Wagner, A simple min-cut algorithm, Journal of the ACM, vol.44, issue.4, pp.585-591, 1997.

R. Van-bevern, A. E. Feldmann, M. Sorge, and O. Suchý, On the parameterized complexity of computing graph bisections, Proc. of the 39th International Workshop on Graph-Theoretic Concepts in Computer Science (WG), vol.8165, pp.76-87, 2013.

J. Yuan and A. Liu, Sufficient conditions for ? k -optimality in triangle-free graphs, Discrete Mathematics, vol.310, pp.981-987, 2010.

Z. Zhang and J. Yuan, A proof of an inequality concerning k-restricted edgeconnectivity, Discrete Mathematics, vol.304, issue.1-3, pp.128-134, 2005.