( en | de | ru )

 

Disambiguation of "Danisch, Maximilien"

Author of the publication

copydeleteadd this publication to your clipboard
Local triangle-densest subgraphs.

, , and . ASONAM, page 33-40. IEEE Computer Society, (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Marcus Danisch

Garvin Danisch

Maximilien Naveau

Ingeborg Danisch

Dietmar Danisch

 

Other publications of authors with the same name

On the importance of considering social capitalism when measuring influence on Twitter, , and . BESC, page 6-12. IEEE, (2014)Mining bipartite graphs to improve semantic pedophile activity detection., and . RCIS, page 1-4. IEEE, (2014)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)Easy-Mention: a model-driven mention recommendation heuristic to boost your tweet popularity., , , , , and . Int. J. Data Sci. Anal., 7 (2): 131-147 (2019)Listing k-cliques in Sparse Real-World Graphs., , and . WWW, page 589-598. ACM, (2018)A Fast Algorithm for Ranking Users by their Influence in Online Social Platforms., , , and . ASONAM, page 526-533. IEEE, (2022)Large Scale Density-friendly Graph Decomposition via Convex Programming., , and . WWW, page 233-242. ACM, (2017)LouvainNE: Hierarchical Louvain Method for High Quality and Scalable Network Embedding., , , , and . WSDM, page 43-51. ACM, (2020)Compressing bipartite graphs with a dual reordering scheme., , and . CoRR, (2022)KClist++: A Simple Algorithm for Finding k-Clique Densest Subgraphs in Large Graphs., , , and . Proc. VLDB Endow., 13 (10): 1628-1640 (2020)