N. Bansal, A. Blum, and S. Chawla, Correlation clustering, Machine Learning, pp.89-113, 2004.

H. L. Bodlaender, Treewidth: Characterizations, Applications, and Computations, WG, pp.1-14, 2006.
DOI : 10.1007/11917496_1
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.66.9552

H. L. Bodlaender, M. R. Fellows, P. Heggernes, F. Mancini, C. Papadopoulos et al., Clustering with partial information, MFCS, pp.144-155, 2008.
DOI : 10.1016/j.tcs.2009.12.016
URL : http://doi.org/10.1016/j.tcs.2009.12.016

L. S. Chandran and T. Kavitha, The treewidth and pathwidth of hypercubes, Discrete Mathematics, vol.306, issue.3, pp.359-365, 2006.
DOI : 10.1016/j.disc.2005.12.011

J. Chen, Y. Liu, and S. Lu, An improved parameterized algorithm for the minimum node multiway cut problem, WADS, pp.495-506, 2007.

J. Chen, Y. Liu, S. Lu, B. O. Sullivan, and I. Razgon, A fixed-parameter algorithm for the directed feedback vertex set problem, J. ACM, issue.5, p.55, 2008.

E. Demaine, G. Z. Gutin, D. Marx, and U. Stege, Seminar 07281 Open problems, Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs, 2007.

E. D. Demaine, D. Emanuel, A. Fiat, and N. Immorlica, Correlation clustering in general weighted graphs, Theoretical Computer Science, vol.361, issue.2-3, pp.172-187, 2006.
DOI : 10.1016/j.tcs.2006.05.008

J. Díaz, M. Serna, D. M. Thilikos, C. , and K. , coloring: fast, easy, and hard cases, MFCS 2001, pp.304-315, 2001.

U. Feige and M. Mahdian, Finding small balanced separators, Proceedings of the thirty-eighth annual ACM symposium on Theory of computing , STOC '06, pp.375-384, 2006.
DOI : 10.1145/1132516.1132573

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

G. Gottlob and S. T. Lee, A logical approach to multicut problems, Information Processing Letters, vol.103, issue.4, pp.136-141, 2007.
DOI : 10.1016/j.ipl.2007.03.005

M. Grohe, Logic, graphs, and algorithms, Logic and Automata-History and Perspectives, 2007.

S. Guillemot, FPT Algorithms for Path-Transversals and Cycle-Transversals Problems in Graphs, IWPEC, pp.129-140, 2008.
DOI : 10.1007/978-3-540-79723-4_13
URL : https://hal.archives-ouvertes.fr/hal-00824933

J. Guo, F. Hüffner, E. Kenar, R. Niedermeier, and J. Uhlmann, Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs, European Journal of Operational Research, vol.186, issue.2, pp.542-553, 2008.
DOI : 10.1016/j.ejor.2007.02.014

I. Kanj, Open problem session of Dagstuhl seminar 08431, 2008.

D. Lokshtanov, S. Saurabh, and S. Sikdar, Simpler Parameterized Algorithm for OCT, IWOCA 2009, pp.380-384, 2009.
DOI : 10.1007/978-3-642-10217-2_37
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.157.4912

D. Marx, Parameterized graph separation problems, Theoretical Computer Science, vol.351, issue.3, pp.394-406, 2006.
DOI : 10.1016/j.tcs.2005.10.007
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.102.9011

D. Marx and I. Razgon, Constant ratio fixed-parameter approximation of the edge multicut problem, ESA 2009, pp.647-658, 2009.
DOI : 10.1016/j.ipl.2009.07.016

R. Niedermeier, Invitation to fixed-parameter algorithms, volume 31 of Oxford Lecture Series in Mathematics and its Applications, 2006.

J. Picard and M. Queyranne, On the structure of all minimum cuts in a network and applications, Combinatorial optimization, II (Proc. Conf., Univ. East Anglia, pp.8-16, 1979.

I. Razgon and B. O. Sullivan, Almost 2-SAT is fixed-parameter tractable, ICALP (1), pp.551-562, 2008.
DOI : 10.1016/j.jcss.2009.04.002
URL : http://doi.org/10.1016/j.jcss.2009.04.002

B. Reed, Tree Width and Tangles: A New Connectivity Measure and Some Applications, Surveys in Combinatorics, pp.87-162, 1997.
DOI : 10.1017/CBO9780511662119.006

B. Reed, K. Smith, and A. Vetta, Finding odd cycle transversals, Operations Research Letters, vol.32, issue.4, pp.299-301, 2004.
DOI : 10.1016/j.orl.2003.10.009
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.112.6357

N. Robertson and P. Seymour, Graph minors. X. Obstructions to tree-decomposition, Journal of Combinatorial Theory, Series B, vol.52, issue.2, pp.153-190, 1991.
DOI : 10.1016/0095-8956(91)90061-N
URL : http://doi.org/10.1006/jctb.1999.1919

M. Samer and S. Szeider, Complexity and applications of edge-induced vertex-cuts. CoRR, abs/cs/0607109, 2006.

M. Xiao, Algorithms for Multiterminal Cuts, CSR, pp.314-325, 2008.
DOI : 10.1007/978-3-540-79709-8_32