N. Apollonio, Private communication, 2012.

N. Apollonio and A. Seb?, Minconvex Factors of Prescribed Size in Graphs, SIAM Journal on Discrete Mathematics, vol.23, issue.3, pp.1297-1310, 2009.
DOI : 10.1137/060651136
URL : https://hal.archives-ouvertes.fr/hal-00363641

J. Backer and J. M. , Constant factor approximation algorithms for the densest k-subgraph problem on proper interval graphs and bipartite permutation graphs, Information Processing Letters, vol.110, issue.16, pp.635-638, 2010.
DOI : 10.1016/j.ipl.2010.05.011

H. Broersma, P. A. Golovach, and V. Patel, Tight complexity bounds for FPT subgraph problems parameterized by clique-width, Proceedings of the 6th international conference on Parameterized and Exact Computation, pp.207-218, 2012.

D. G. Corneil and Y. Perl, Clustering and domination in perfect graphs, Discrete Applied Mathematics, vol.9, issue.1, pp.27-39, 1984.
DOI : 10.1016/0166-218X(84)90088-X

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.

G. Joret and A. Vetta, Reducing the rank of a matroid, 1211.
URL : https://hal.archives-ouvertes.fr/hal-01349050

M. Liazi, I. Milis, F. Pascual, and V. Zissimopoulos, The densest k-subgraph problem on clique graphs, Journal of Combinatorial Optimization, vol.42, issue.2, pp.465-474, 2007.
DOI : 10.1007/s10878-007-9069-1

M. Liazi, I. Milis, and V. Zissimopoulos, A constant approximation algorithm for the densest k-subgraph problem on chordal graphs, Information Processing Letters, vol.108, issue.1, pp.29-32, 2008.
DOI : 10.1016/j.ipl.2008.03.016

T. Nonner, PTAS for densest k-subgraph in interval graphs, Proceedings of the 12th international conference on Algorithms and Data Structures, pp.631-641, 2011.