Y. Ahn, J. P. Bagrow, and S. Lehmann, Link communities reveal multiscale complexity in networks, Nature, vol.80, issue.7307, pp.761-764, 2010.
DOI : 10.1038/msb4100155

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 (WAW), pp.25-37, 2009.
DOI : 10.1002/pmic.200400962

A. Angel, N. Sarkas, N. Koudas, and D. Srivastava, Dense subgraph maintenance under streaming edge weight updates for real-time story identification, Proceedings of the Very Large Data Bases Endowment (VLDB), pp.574-585, 2012.
DOI : 10.14778/2168651.2168658
URL : http://vldb.org/pvldb/vol5/p574_albertangel_vldb2012.pdf

Y. Asahiro, K. Iwama, H. Tamaki, and T. Tokuyama, Greedily finding a dense subgraph, Proceedings of the 5th Scandinavian Workshop on Algorithm Theory (SWAT), pp.136-148, 1996.
DOI : 10.1006/jagm.1999.1062

F. Oana-denisa-balalau, . Bonchi, F. Chan, M. Gullo, and . Sozio, Finding subgraphs with maximum total density and limited overlap, Proceedings of the 8th ACM International Conference on Web Search and Data Mining (WSDM), pp.379-388, 2015.

D. Vincent, J. Blondel, R. Guillaume, E. Lambiotte, and . Lefebvre, Fast unfolding of communities in large networks, Journal of Statistical Mechanics: Theory and Experiment, issue.10, 2008.

A. Borodin, H. C. Lee, and Y. Ye, Max-sum diversification, monotone submodular functions and dynamic updates, Proceedings of the 31st ACM SIGMOD- SIGACT-SIGART Symposium on Principles of Database Systems (PODS), pp.155-166, 2012.
DOI : 10.1145/2213556.2213580
URL : http://www.cs.toronto.edu/~bor/pods-arXiv-version.pdf

M. Charikar, Greedy Approximation Algorithms for Finding Dense Components in a Graph, Proceedings of the 3rd International Workshop on Approximation Algorithms for Combinatorial Optimization (APPROX), pp.84-95, 2000.
DOI : 10.1007/3-540-44436-X_10
URL : http://www.cs.princeton.edu/~moses/papers/greedy-dense.ps

M. Chen, K. Kuzmin, and B. Szymanski, Extension of Modularity Density for overlapping community structure, 2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2014), pp.856-863, 2014.
DOI : 10.1109/ASONAM.2014.6921686
URL : http://arxiv.org/pdf/1507.04606

W. Chen, Z. Liu, X. Sun, and Y. Wang, A game-theoretic framework to identify overlapping communities in social networks, Data Mining and Knowledge Discovery, vol.33, issue.4, pp.224-240, 2010.
DOI : 10.1086/jar.33.4.3629752
URL : http://research.microsoft.com/en-us/people/weic/dmkd10_overlappingcommunity.pdf

A. Clauset, M. E. Newman, and C. Moore, Finding community structure in very large networks, Physical Review E, vol.23, issue.6, p.66111, 2004.
DOI : 10.1140/epjb/e2004-00125-x
URL : http://arxiv.org/abs/cond-mat/0408187

M. Coscia, G. Rossetti, F. Giannotti, and D. Pedreschi, DEMON, Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining, KDD '12, pp.615-623, 2012.
DOI : 10.1145/2339530.2339630

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
URL : http://www.openu.ac.il/Personal_sites/download/accepted.ps

G. William-flake, S. Lawrence, and C. Giles, Efficient identification of web communities, Proceedings of the 6th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), pp.150-160, 2000.

E. Fratkin, T. Brian, . Naughton, L. Douglas, S. Brutlag et al., MotifCut: regulatory motifs finding with maximum density subgraphs, Bioinformatics, vol.22, issue.14, pp.150-157, 2006.
DOI : 10.1093/bioinformatics/btl243
URL : https://academic.oup.com/bioinformatics/article-pdf/22/14/e150/616401/btl243.pdf

E. Galbrun, A. Gionis, and N. Tatti, Overlapping community detection in labeled graphs, Data Mining and Knowledge Discovery, vol.17, issue.4, pp.5-61586, 2014.
DOI : 10.1007/s11222-007-9033-z
URL : https://hal.archives-ouvertes.fr/hal-01399127

M. Garey and D. Johnson, Computers and intractability: a guide to the theory of NP-completeness, 1979.

M. Girvan and M. E. Newman, Community structure in social and biological networks, Proceedings of the National Academy of Sciences, vol.139, issue.21, pp.7821-7826, 2002.
DOI : 10.1086/285382
URL : http://www.pnas.org/content/99/12/7821.full.pdf

V. Andrew and . Goldberg, Finding a maximum density subgraph, 1984.

S. Gregory, An Algorithm to Find Overlapping Community Structure in Networks, Proceedings of the 2007 European Conference on Principles and Practice of Knowledge Discovery in Databases, Part I (ECML/PKDD), pp.91-102, 2007.
DOI : 10.1007/978-3-540-74976-9_12
URL : https://link.springer.com/content/pdf/10.1007%2F978-3-540-74976-9_12.pdf

S. Gregory, Finding overlapping communities in networks by label propagation, New Journal of Physics, vol.12, issue.10, 2010.
DOI : 10.1088/1367-2630/12/10/103018
URL : http://iopscience.iop.org/article/10.1088/1367-2630/12/10/103018/pdf

J. Håstad, Clique is hard to approximate within n 1?, Proceedings of the 37th Annual Symposium on Foundations of Computer Science (FOCS), pp.627-636, 1996.

G. Karypis and V. Kumar, Multilevel Algorithms for Multi-Constraint Graph Partitioning, Proceedings of the IEEE/ACM SC98 Conference, pp.1-13, 1998.
DOI : 10.1109/SC.1998.10018
URL : http://www.cs.umn.edu/~kumar/papers/par_multiconstraint.ps

S. Khuller and B. Saha, On Finding Dense Subgraphs, Automata, Languages and Programming, pp.597-608, 2009.
DOI : 10.1145/324133.324140
URL : http://www.cs.umd.edu/users/samir/grant/icalp-final.pdf

R. Kumar, P. Raghavan, A. Sridhar-rajagopalan, and . Tomkins, Trawling the Web for emerging cyber-communities, Computer Networks, vol.31, issue.11-16, pp.11-161481, 1999.
DOI : 10.1016/S1389-1286(99)00040-7
URL : http://cs.wellesley.edu/~cs315/Papers/Kumar99trawling.pdf

J. Leskovec, K. Lang, A. Dasgupta, and M. Mahoney, Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters, Internet Mathematics, vol.6, issue.1, pp.29-123, 2009.
DOI : 10.1080/15427951.2009.10129177

G. Nemhauser, L. Wolsey, and M. Fisher, An analysis of approximations for maximizing submodular set functions???I, Mathematical Programming, vol.16, issue.1, pp.265-294, 1978.
DOI : 10.1007/BF01588971

Y. Andrew, M. I. Ng, Y. Jordan, and . Weiss, On spectral clustering: Analysis and an algorithm, Advances in Neural Information Processing Systems (NIPS), pp.849-856, 2001.

G. Palla and I. Derényi, Uncovering the overlapping community structure of complex networks in nature and society, Nature, vol.433, issue.7043, pp.814-818, 2005.
DOI : 10.1038/nature03248
URL : http://arxiv.org/pdf/physics/0506133

J. Pinney and D. Westhead, Betweenness-based decomposition methods for social and biological networks, Interdisciplinary Statistics and Bioinformatics, pp.87-90, 2006.

P. Pons and M. Latapy, Computing communities in large networks using random walks, Journal of Graph Algorithms Applications, vol.10, issue.2, pp.284-293, 2006.
DOI : 10.1007/11569596_31
URL : http://arxiv.org/pdf/cond-mat/0412368

M. Sozio and A. Gionis, The community-search problem and how to plan a successful cocktail party, Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining, KDD '10, pp.939-948, 2010.
DOI : 10.1145/1835804.1835923

N. Tatti and A. Gionis, Density-friendly Graph Decomposition, Proceedings of the 24th International Conference on World Wide Web, WWW '15, pp.1089-1099, 2015.
DOI : 10.1007/s00453-008-9238-3
URL : http://www.www2015.it/documents/proceedings/proceedings/p1089.pdf

C. Tsourakakis, The K-clique Densest Subgraph Problem, Proceedings of the 24th International Conference on World Wide Web, WWW '15, pp.1122-1132, 2015.
DOI : 10.1109/ICDE.2012.35
URL : http://www.www2015.it/documents/proceedings/proceedings/p1122.pdf

C. Tsourakakis, F. Bonchi, A. Gionis, F. Gullo, and M. Tsiarli, Denser than the densest subgraph, Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining, KDD '13
DOI : 10.1145/2487575.2487645