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
Private communication, 2012. ,
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
Detecting high log-densities, Proceedings of the 42nd ACM symposium on Theory of computing, STOC '10, pp.201-210, 2010. ,
DOI : 10.1145/1806689.1806719
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
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. ,
Massaging a linear programming solution to give a 2-approximation for a generalization of the vertex cover problem, Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science, pp.298-308, 1998. ,
DOI : 10.1007/BFb0028569
Densest k-Subgraph Approximation on Intersection Graphs, Proceedings of the 8th international conference on Approximation and online algorithms, pp.83-93, 2011. ,
DOI : 10.1007/978-3-642-18318-8_8
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.363.6488
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
k-edge subgraph problems, Discrete Applied Mathematics, vol.74, issue.2, pp.159-169, 1997. ,
DOI : 10.1016/S0166-218X(96)00030-3
Parameterized Complexity of Vertex Cover Variants, Theory of Computing Systems, vol.41, issue.3, pp.501-520, 2007. ,
DOI : 10.1007/s00224-007-1309-3
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
Polynomial variants of the densest/heaviest k-subgraph problem, Proceedings of the 20th British Combinatorial Conference, 2005. ,
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
Ptas for densest k-subgraph in interval graphs, Proceedings of the 12th international conference on Algorithms and Data Structures, pp.631-641, 2011. ,
Node-and edge-deletion NP-complete problems, Proceedings of the tenth annual ACM symposium on Theory of computing , STOC '78, pp.253-264, 1978. ,
DOI : 10.1145/800133.804355