From post

Efficient algorithms for a robust modularity-driven clustering of attributed graphs

, , , , , , и . Proceedings of the 2015 SIAM International Conference on Data Mining, стр. 100--108. SIAM, (2015)

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.

 

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

Foreword., , и . Algorithmica, 26 (1): 1-2 (2000)A Linear-Time Algorithm for Edge-Disjoint Paths in Planar Graphs., и . Combinatorica, 15 (1): 135-150 (1995)Dynamic Time-Dependent Route Planning in Road Networks with User Preferences., , , и . CoRR, (2015)Customizable Contraction Hierarchies., , и . ACM Journal of Experimental Algorithmics, 21 (1): 1.5:1-1.5:49 (2016)Finding, Counting and Listing All Triangles in Large Graphs, an Experimental Study., и . WEA, том 3503 из Lecture Notes in Computer Science, стр. 606-609. Springer, (2005)Erratum: Customizable Contraction Hierarchies., , и . SEA, том 8504 из Lecture Notes in Computer Science, Springer, (2014)Intriguingly Simple and Fast Transit Routing., , , и . SEA, том 7933 из Lecture Notes in Computer Science, стр. 43-54. Springer, (2013)Industrial Demand-Side Flexibility: A Benchmark Data Set., , , и . e-Energy, стр. 460-473. ACM, (2019)Engineering Negative Cycle Canceling for Wind Farm Cabling., , , , и . ESA, том 144 из LIPIcs, стр. 55:1-55:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Communicating Centrality in Policy Network Drawings., , и . IEEE Trans. Vis. Comput. Graph., 9 (2): 241-253 (2003)