R. Andersen and K. Chellapilla, Finding Dense Subgraphs with Size Bounds, Proceedings of the 6th International Workshop on Algorithms and Models for the Web-Graph, pp.25-37, 2009.
DOI : 10.1007/978-3-540-95995-3_3

N. Apollonio and B. Simeone, The maximum vertex coverage problem on bipartite graphs, Discrete Applied Mathematics, vol.165, pp.37-48, 2014.
DOI : 10.1016/j.dam.2013.05.015

N. Apollonio and B. Simeone, Improved Approximation of Maximum Vertex Coverage Problem on Bipartite Graphs, SIAM Journal on Discrete Mathematics, vol.28, issue.3, pp.1137-1151, 2014.
DOI : 10.1137/130931059

A. Bhaskara, M. Charikar, E. Chlamtac, U. Feige, and A. Vijayaraghavan, Detecting high logdensities: an O(n 1 4 ) approximation for densest k-subgraph, Proceedings of 42nd Symposium on Theory of Computing (STOC), pp.201-210, 2010.

A. Bhaskara, M. Charikar, V. Guruswami, A. Vijayaraghavan, and Y. Zhou, Polynomial Integrality gaps for Strong relaxations of Densest k-subgraph, Proceedings of 23rd Symposium on Discrete Algorithms (SODA), pp.388-405, 2012.

N. Bourgeois, A. Giannakos, G. Lucarelli, I. Milis, V. Paschos et al., The max quasi-independent set problem, Journal of Combinatorial Optimization, vol.20, issue.2, pp.94-117, 2012.
DOI : 10.1007/s10878-010-9343-5
URL : https://hal.archives-ouvertes.fr/hal-01185274

D. 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

E. Chlamtac, M. Dinitz, and R. Krauthgamer, Everywhere-Sparse Spanners via Dense Subgraphsh, Proceedings of the 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science, pp.758-767, 2012.

F. , D. Croce, and V. Paschos, On the max k-vertex cover problem, Cahiers du LAMSADE, vol.307, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00875629

U. Feige, D. Peleg, and G. Kortsarz, The Dense k -Subgraph Problem, Algorithmica, vol.29, issue.3, pp.410-421, 2001.
DOI : 10.1007/s004530010050

U. Feige and M. Seltser, On the densest k-subgraph problem, 1997.

O. Goldschmidt and D. Hochbaum, A Polynomial Algorithm for the k-cut Problem for Fixed k, Mathematics of Operations Research, vol.19, issue.1, pp.24-37, 1994.
DOI : 10.1287/moor.19.1.24

S. Khot, Ruling Out PTAS for Graph Min-Bisection, Densest Subgraph and Bipartite Clique, 45th Annual IEEE Symposium on Foundations of Computer Science, pp.136-145, 2004.
DOI : 10.1109/FOCS.2004.59

J. Naor and Y. Rabani, Tree packing and approximating k-cuts, Proceedings of the 12th Symposium on Discrete Algorithms (SODA), pp.26-27, 2001.

J. Oxley, What is a matroid?, pp.179-218, 2003.

R. Ravi and A. Sinha, Approximating k-cuts via network strength, Proceedings of the 13th Symposium on Discrete Algorithms (SODA), pp.621-622, 2002.

H. Saran and V. Vazirani, Cuts within Twice the Optimal, SIAM Journal on Computing, vol.24, issue.1, pp.101-108, 1995.
DOI : 10.1137/S0097539792251730

A. Schrijver, Combinatorial Optimization: Polyhedra and Efficiency, 2003.

L. Zhao, H. Nagamochi, and T. Ibaraki, Approximating the Minimum k-way Cut in a Graph via Minimum 3-way Cuts, Journal of Combinatorial Optimization, vol.5, pp.397-410, 2001.
DOI : 10.1007/3-540-46632-0_38

S. Vinterbo, A note on the hardness of the k-ambiguity problem, 2002.