H. Bodlaender, R. Downey, M. Fellows, and D. Hermelin, On problems without polynomial kernels, ICALP, number 5125 in LNCS, pp.563-574, 2008.
DOI : 10.1016/j.jcss.2009.04.001

H. L. Bodlaender, B. M. Jansen, and S. Kratsch, Cross-composition: A new technique for kernelization lower bounds, STACS, volume 9 of LIPIcs, pp.165-176, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00573603

H. L. Bodlaender, S. Thomassé, and A. Yeo, Kernel bounds for disjoint cycles and disjoint paths, ESA, pp.635-646, 2009.
URL : https://hal.archives-ouvertes.fr/lirmm-00806805

L. Cai, Fixed-parameter tractability of graph modification problems for hereditary properties, Information Processing Letters, vol.58, issue.4, pp.171-176, 1996.
DOI : 10.1016/0020-0190(96)00050-6

B. Courcelle, J. Engelfriet, and G. Rozenberg, Handle-rewriting hypergraph grammars, Journal of Computer and System Sciences, vol.46, issue.2, pp.218-270, 1993.
DOI : 10.1016/0022-0000(93)90004-G

W. Cunningham and J. Edmonds, A combinatorial decomposition theory, Journal canadien de math??matiques, vol.32, issue.3, pp.734-765, 1980.
DOI : 10.4153/CJM-1980-057-7

R. Downey and M. Fellows, Parameterized complexity, 1999.
DOI : 10.1007/978-1-4612-0515-9

E. S. El-mallah and C. Colbourn, The complexity of some edge deletion problems, IEEE Transactions on Circuits and Systems, vol.35, issue.3, pp.354-362, 1988.
DOI : 10.1109/31.1748

M. Fellows, M. Langston, F. Rosamond, and P. Shaw, Efficient Parameterized Preprocessing for Cluster Editing, Fundamentals of Computation Theory, 16th International Symposium number 4639 in LNCS, pp.312-321, 2007.
DOI : 10.1007/978-3-540-74240-1_27

J. Flum and M. Grohe, Parameterized complexity theorey. Texts in Theoretical Computer Science, 2006.

L. Fortnow and R. Santhanam, Infeasibility of instance compression and succinct PCPs for NP, Proceedings of the fourtieth annual ACM symposium on Theory of computing, STOC 08, pp.133-142, 2008.
DOI : 10.1145/1374376.1374398

M. Garey and S. Johnson, Computers and intractability: a guide to the theory of NPcompleteness, Freeman, 1978.

M. Golumbic, H. Kaplan, and R. Shamir, Graph Sandwich Problems, Journal of Algorithms, vol.19, issue.3, pp.449-473, 1995.
DOI : 10.1006/jagm.1995.1047
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.12.8158

M. Habib and C. Paul, A survey of the algorithmic aspects of modular decomposition, Computer Science Review, vol.4, issue.1, pp.41-59, 2010.
DOI : 10.1016/j.cosrev.2010.01.001

P. Heggernes, C. Paul, J. A. Telle, and Y. Villanger, Interval completion with few edges, Proceedings of the thirty-ninth annual ACM symposium on Theory of computing , STOC '07, pp.374-381, 2007.
DOI : 10.1145/1250790.1250847

C. Kenyon-mathieu and W. Schudy, How to rank with few errors, Proceedings of the thirty-ninth annual ACM symposium on Theory of computing , STOC '07, pp.95-103, 2007.
DOI : 10.1145/1250790.1250806

S. Kratsch and M. Wahlström, Two edge modification problems without polynomial kernels, IWPEC, pp.264-275, 2009.

T. Ma and J. Spinrad, An O(n2) Algorithm for Undirected Split Decomposition, Journal of Algorithms, vol.16, issue.1, pp.145-160, 1994.
DOI : 10.1006/jagm.1994.1007

A. Natanzon, R. Shamir, and R. Sharan, Complexity classification of some edge modification problems, Discrete Applied Mathematics, vol.113, issue.1, pp.109-128, 2001.
DOI : 10.1016/S0166-218X(00)00391-7

R. Niedermeier, Invitation to fixed parameter algorithms, of Oxford Lectures Series in Mathematics and its Applications, 2006.
DOI : 10.1093/acprof:oso/9780198566076.001.0001

R. Niedermeier and P. Rossmanith, A general method to speed up fixed-parameter-tractable algorithms, Information Processing Letters, vol.73, issue.3-4, pp.125-129, 2000.
DOI : 10.1016/S0020-0190(00)00004-1

S. Oum, Graphs of bounded rank-width, 2005.

D. Rose, A graph-theoretic study of the numerical solution of sparse positive systems of linear equations. Graph Theory and Computing, pp.183-217, 1972.

R. Shamir, R. Sharan, and D. Tsur, Cluster graph modification problems, Discrete Applied Mathematics, vol.144, issue.1-2, pp.173-182, 2004.
DOI : 10.1016/j.dam.2004.01.007
URL : http://doi.org/10.1016/j.dam.2004.01.007

R. Tarjan and M. Yannakakis, Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs, SIAM Journal on Computing, vol.13, issue.3, pp.566-579, 1984.
DOI : 10.1137/0213035

A. Van-zuylen and D. Williamson, Deterministic algorithms for rank aggragation and other ranking and clustering problems, WAOA, pp.260-273, 2008.