( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
On the importance of considering social capitalism when measuring influence on Twitter

, , и . BESC, стр. 6-12. IEEE, (2014)

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.

Marcus Danisch

Garvin Danisch

Maximilien Naveau

Ingeborg Danisch

Dietmar Danisch

 

Другие публикации лиц с тем же именем

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