Unfolding Ego-Centered Community Structures with "A Similarity Approach". - Maximilien Danisch; Jean-Loup Guillaume; Bénédicte Le Grand (CompleNet, 2013)

Towards multi-ego-centred communities: a node similarity approach. - Maximilien Danisch; Jean-Loup Guillaume; Bénédicte Le Grand (Int. J. Web Based Communities, 2013)

On the importance of considering social capitalism when measuring influence on Twitter - Maximilien Danisch; Nicolas Dugué; Anthony Perez 001 (BESC, 2014)

Direct generation of random graphs exactly realising a prescribed degree sequence. - Darko Obradovic; Maximilien Danisch (CASoN, 2014)

Learning a proximity measure to complete a community. - Maximilien Danisch; Jean-Loup Guillaume; Bénédicte Le Grand (DSAA, 2014)

Mining bipartite graphs to improve semantic pedophile activity detection. - Raphaël Fournier; Maximilien Danisch (RCIS, 2014)

Multi-ego-centered communities in practice. - Maximilien Danisch; Jean-Loup Guillaume; Bénédicte Le Grand (Soc. Netw. Anal. Min., 2014)

A reliable and evolutive web application to detect social capitalists. - Nicolas Dugué; Anthony Perez 001; Maximilien Danisch; Florian Bridoux; Amélie Daviau; Tennessy Kolubako; Simon Munier; Hugo Durbano (ASONAM, 2015)

Mesures de proximité appliquées à la détection de communautés dans les grands graphes de terrain. (Proximity measure applied to community detection in complex networks). - Maximilien Danisch (2015)

Local triangle-densest subgraphs. - Raman Samusevich; Maximilien Danisch; Mauro Sozio (ASONAM, 2016)

On the Role of Mentions on Tweet Virality. - Soumajit Pramanik; Qinna Wang; Maximilien Danisch; Sumanth Bandi; Anand Kumar; Jean-Loup Guillaume; Bivas Mitra (DSAA, 2016)

Finding Heaviest k-Subgraphs and Events in Social Media. - Matthaios Letsios; Oana Denisa Balalau; Maximilien Danisch; Emmanuel Orsini; Mauro Sozio (ICDM Workshops, 2016)

Large Scale Density-friendly Graph Decomposition via Convex Programming. - Maximilien Danisch; T.-H. Hubert Chan; Mauro Sozio (WWW, 2017)

Modeling cascade formation in Twitter amidst mentions and retweets. - Soumajit Pramanik; Qinna Wang; Maximilien Danisch; Jean-Loup Guillaume; Bivas Mitra (Soc. Netw. Anal. Min., 2017)

Listing k-cliques in Sparse Real-World Graphs. - Maximilien Danisch; Oana Balalau; Mauro Sozio (WWW, 2018)

Easy-Mention: a model-driven mention recommendation heuristic to boost your tweet popularity. - Soumajit Pramanik; Mohit Sharma; Maximilien Danisch; Qinna Wang; Jean-Loup Guillaume; Bivas Mitra (Int. J. Data Sci. Anal., 2019)

LouvainNE: Hierarchical Louvain Method for High Quality and Scalable Network Embedding. - Ayan Kumar Bhowmick; Koushik Meneni; Maximilien Danisch; Jean-Loup Guillaume; Bivas Mitra (WSDM, 2020)

KClist++: A Simple Algorithm for Finding k-Clique Densest Subgraphs in Large Graphs. - Bintao Sun; Maximilien Danisch; T.-H. Hubert Chan; Mauro Sozio (Proc. VLDB Endow., 2020)

Clique Percolation Method: Memory Efficient Almost Exact Communities. - Alexis Baudin; Maximilien Danisch; Sergey Kirgizov; Clémence Magnien; Marwan Ghanem 001 (ADMA, 2021)

A Fast Algorithm for Ranking Users by their Influence in Online Social Platforms. - Nouamane Arhachoui; Esteban Bautista; Maximilien Danisch; Anastasios Giovanidis (ASONAM, 2022)

Compressing bipartite graphs with a dual reordering scheme. - Maximilien Danisch; Ioannis Panagiotas; Lionel Tabourier (CoRR, 2022)