default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMaximilien Danisch
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[c14]Nouamane Arhachoui, Esteban Bautista, Maximilien Danisch, Anastasios Giovanidis:
A Fast Algorithm for Ranking Users by their Influence in Online Social Platforms. ASONAM 2022: 526-533- [i3]Nouamane Arhachoui, Esteban Bautista, Maximilien Danisch, Anastasios Giovanidis:
A Fast Algorithm for Ranking Users by their Influence in Online Social Platforms. CoRR abs/2206.09960 (2022) - [i2]Maximilien Danisch, Ioannis Panagiotas, Lionel Tabourier:
Compressing bipartite graphs with a dual reordering scheme. CoRR abs/2209.12062 (2022) - 2021
- [c13]Alexis Baudin, Maximilien Danisch, Sergey Kirgizov, Clémence Magnien, Marwan Ghanem:
Clique Percolation Method: Memory Efficient Almost Exact Communities. ADMA 2021: 113-127 - [i1]Alexis Baudin, Maximilien Danisch, Sergey Kirgizov, Clémence Magnien, Marwan Ghanem:
Clique percolation method: memory efficient almost exact communities. CoRR abs/2110.01213 (2021) - 2020
- [j5]Bintao Sun, Maximilien Danisch, T.-H. Hubert Chan, Mauro Sozio:
KClist++: A Simple Algorithm for Finding k-Clique Densest Subgraphs in Large Graphs. Proc. VLDB Endow. 13(10): 1628-1640 (2020) - [c12]Ayan Kumar Bhowmick, Koushik Meneni, Maximilien Danisch, Jean-Loup Guillaume, Bivas Mitra:
LouvainNE: Hierarchical Louvain Method for High Quality and Scalable Network Embedding. WSDM 2020: 43-51
2010 – 2019
- 2019
- [j4]Soumajit Pramanik
, Mohit Sharma, Maximilien Danisch, Qinna Wang, Jean-Loup Guillaume, Bivas Mitra:
Easy-Mention: a model-driven mention recommendation heuristic to boost your tweet popularity. Int. J. Data Sci. Anal. 7(2): 131-147 (2019) - 2018
- [c11]Maximilien Danisch, Oana Balalau, Mauro Sozio:
Listing k-cliques in Sparse Real-World Graphs. WWW 2018: 589-598 - 2017
- [j3]Soumajit Pramanik, Qinna Wang, Maximilien Danisch, Jean-Loup Guillaume, Bivas Mitra:
Modeling cascade formation in Twitter amidst mentions and retweets. Soc. Netw. Anal. Min. 7(1): 41:1-41:18 (2017) - [c10]Maximilien Danisch, T.-H. Hubert Chan, Mauro Sozio:
Large Scale Density-friendly Graph Decomposition via Convex Programming. WWW 2017: 233-242 - 2016
- [c9]Raman Samusevich, Maximilien Danisch, Mauro Sozio:
Local triangle-densest subgraphs. ASONAM 2016: 33-40 - [c8]Soumajit Pramanik, Qinna Wang, Maximilien Danisch, Sumanth Bandi, Anand Kumar, Jean-Loup Guillaume, Bivas Mitra:
On the Role of Mentions on Tweet Virality. DSAA 2016: 204-213 - [c7]Matthaios Letsios, Oana Denisa Balalau, Maximilien Danisch, Emmanuel Orsini, Mauro Sozio:
Finding Heaviest k-Subgraphs and Events in Social Media. ICDM Workshops 2016: 113-120 - 2015
- [b1]Maximilien Danisch:
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). Pierre and Marie Curie University, Paris, France, 2015 - [c6]Nicolas Dugué, Anthony Perez, Maximilien Danisch, Florian Bridoux, Amélie Daviau, Tennessy Kolubako, Simon Munier, Hugo Durbano:
A reliable and evolutive web application to detect social capitalists. ASONAM 2015: 741-744 - 2014
- [j2]Maximilien Danisch, Jean-Loup Guillaume, Bénédicte Le Grand:
Multi-ego-centered communities in practice. Soc. Netw. Anal. Min. 4(1): 180 (2014) - [c5]Maximilien Danisch, Nicolas Dugué, Anthony Perez:
On the importance of considering social capitalism when measuring influence on Twitter. BESC 2014: 6-12 - [c4]Darko Obradovic, Maximilien Danisch:
Direct generation of random graphs exactly realising a prescribed degree sequence. CASoN 2014: 1-6 - [c3]Maximilien Danisch, Jean-Loup Guillaume, Bénédicte Le Grand:
Learning a proximity measure to complete a community. DSAA 2014: 90-96 - [c2]Raphaël Fournier, Maximilien Danisch:
Mining bipartite graphs to improve semantic pedophile activity detection. RCIS 2014: 1-4 - 2013
- [j1]Maximilien Danisch, Jean-Loup Guillaume, Bénédicte Le Grand:
Towards multi-ego-centred communities: a node similarity approach. Int. J. Web Based Communities 9(3): 299-322 (2013) - [c1]Maximilien Danisch, Jean-Loup Guillaume, Bénédicte Le Grand:
Unfolding Ego-Centered Community Structures with "A Similarity Approach". CompleNet 2013: 145-153
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
