Danisch, Maximilien
82  results:
Search for persons X
?
1

Clique Percolation Method: Memory Efficient Almost Exact Co..:

, In: Advanced Data Mining and Applications; Lecture Notes in Computer Science,
 
?
2

A Fast Algorithm for Ranking Users by their Influence in On..:

, In: 2022 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM),
 
?
3

LouvainNE : Hierarchical Louvain Method for High Quality..:

, In: Proceedings of the 13th International Conference on Web Search and Data Mining,
 
?
4

KClist++: a simple algorithm for finding k-clique densest s..:

Sun, Bintao ; Danisch, Maximilien ; Chan, T-H. Hubert.
Proceedings of the VLDB Endowment.  13 (2020)  10 - p. 1628-1640 , 2020
 
?
5

Listing k-cliques in Sparse Real-World Graphs*:

, In: Proceedings of the 2018 World Wide Web Conference,
 
?
6

Easy-Mention: a model-driven mention recommendation heurist..:

Pramanik, Soumajit ; Sharma, Mohit ; Danisch, Maximilien...
International Journal of Data Science and Analytics.  7 (2018)  2 - p. 131-147 , 2018
 
?
8

Large Scale Density-friendly Graph Decomposition via Convex..:

, In: Proceedings of the 26th International Conference on World Wide Web,
 
?
9

Local triangle-densest subgraphs:

, In: Proceedings of the 2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining,
 
?
10

A reliable and evolutive web application to detect social c..:

, In: Proceedings of the 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2015,
 
?
12

Calculation of the Voronoi boundary for lens-shaped particl..:

Portal, Louis ; Danisch, Maximilien ; Baule, Adrian..
Journal of Statistical Mechanics: Theory and Experiment.  2013 (2013)  11 - p. P11009 , 2013
 
1-15