Massive Quasi-Clique Detection, LATIN 2002: Theoretical Informatics, pp.598-612, 2002. ,
The densest subgraph problem in sparse random graphs, The Annals of Applied Probability, vol.26, issue.1, pp.305-327, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-00919079
Dense subgraph maintenance under streaming edge weight updates for real-time story identification, Proceedings of the VLDB Endowment, vol.5, issue.6, pp.574-585, 2012. ,
Complexity of finding dense subgraphs, Discrete Applied Mathematics, vol.121, issue.1-3, pp.15-26, 2002. ,
Densest subgraph in streaming and MapReduce, Proceedings of the VLDB Endowment, vol.5, issue.5, pp.454-465, 2012. ,
Finding Subgraphs with Maximum Total Density and Limited Overlap, Proceedings of the Eighth ACM International Conference on Web Search and Data Mining - WSDM '15, pp.379-388, 2015. ,
URL : https://hal.archives-ouvertes.fr/hal-01699040
Greedy Approximation Algorithms for Finding Dense Components in a Graph, Approximation Algorithms for Combinatorial Optimization, pp.84-95, 2000. ,
Reachability and Distance Queries via 2-Hop Labels, SIAM Journal on Computing, vol.32, issue.5, pp.1338-1355, 2003. ,
Listing k-cliques in Sparse Real-World Graphs*, Proceedings of the 2018 World Wide Web Conference on World Wide Web - WWW '18, pp.589-598, 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-02085353
Large Scale Density-friendly Graph Decomposition via Convex Programming, Proceedings of the 26th International Conference on World Wide Web, pp.233-242, 2017. ,
URL : https://hal.archives-ouvertes.fr/hal-01699048
Migration motif, Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining - KDD '09, pp.1135-1144, 2009. ,
Efficient Densest Subgraph Computation in Evolving Graphs, Proceedings of the 24th International Conference on World Wide Web - WWW '15, pp.300-310, 2015. ,
URL : https://hal.archives-ouvertes.fr/hal-01699042
Clique Counting in MapReduce, ACM Journal of Experimental Algorithmics, vol.20, pp.1-20, 2015. ,
MotifCut: regulatory motifs finding with maximum density subgraphs, Bioinformatics, vol.22, issue.14, pp.e150-e157, 2006. ,
Finding a maximum density subgraph, 1984. ,
Performance of global load balancing by local adjustment, IEEE Transactions on Information Theory, vol.36, issue.6, pp.1398-1414, 1990. ,
Balanced loads in infinite networks, The Annals of Applied Probability, vol.6, issue.1, pp.48-75, 1996. ,
Maintaining Densest Subsets Efficiently in Evolving Hypergraphs, Proceedings of the 2017 ACM on Conference on Information and Knowledge Management, pp.929-938, 2017. ,
Revisiting frank-wolfe: Projection-free sparse convex optimization, ICML, pp.427-435, 2013. ,
A Fast and Provable Method for Estimating Clique Counts Using Turán's Theorem, Proceedings of the 26th International Conference on World Wide Web, pp.441-449, 2017. ,
The Power of Pivoting for Exact Clique Counting, Proceedings of the 13th International Conference on Web Search and Data Mining, pp.268-276, 2020. ,
3-HOP, Proceedings of the 35th SIGMOD international conference on Management of data - SIGMOD '09, pp.813-826, 2009. ,
A Survey of Algorithms for Dense Subgraph Discovery, Managing and Mining Graph Data, pp.303-336, 2010. ,
Springer Handbook of Nanotechnology, 2010. ,
SNAP Datasets: Stanford large network dataset collection, 2014. ,
Scalable Large Near-Clique Detection in Large-Scale Networks via Sampling, Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining - KDD '15, pp.815-824, 2015. ,
Parallel Maximum Clique Algorithms with Applications to Network Analysis, SIAM Journal on Scientific Computing, vol.37, issue.5, pp.C589-C616, 2015. ,
Boost Graph Library: User Guide and Reference Manual, The. Pearson Education, 2001. ,
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. ,
Density-friendly Graph Decomposition, Proceedings of the 24th International Conference on World Wide Web - WWW '15, pp.1089-1099, 2015. ,
The K-clique Densest Subgraph Problem, Proceedings of the 24th International Conference on World Wide Web - WWW '15, pp.1122-1132, 2015. ,
Denser than the densest subgraph, Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining - KDD '13, pp.104-112, 2013. ,
On triangulation-based dense neighborhood graph discovery, Proceedings of the VLDB Endowment, vol.4, issue.2, pp.58-68, 2010. ,