Author of the publication

Faster Betweenness Centrality Updates in Evolving Networks.

, , , and . SEA, volume 75 of LIPIcs, page 23:1-23:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)

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.

 

Other publications of authors with the same name

Detecting communities around seed nodes in complex networks., , and . BigData, page 62-69. IEEE, (2014)Generating Random Hyperbolic Graphs in Subquadratic Time., , and . ISAAC, volume 9472 of Lecture Notes in Computer Science, page 467-478. Springer, (2015)Scaling up Group Closeness Maximization., , and . ALENEX, page 209-222. SIAM, (2018)Guidelines for Experimental Algorithmics: A Case Study in Network Analysis., , , , , , and . Algorithms, 12 (7): 127 (2019)Engineering a Combinatorial Laplacian Solver: Lessons Learned., , , and . Algorithms, 9 (4): 72 (2016)Improving the Betweenness Centrality of a Node by Adding Links., , , , , and . ACM Journal of Experimental Algorithmics, (2018)Shared Memory Parallel Subgraph Enumeration., , and . IPDPS Workshops, page 519-529. IEEE Computer Society, (2017)Group Centrality Maximization for Large-scale Graphs., , , , , and . ALENEX, page 56-69. SIAM, (2020)Constructing higher-order Voronoi diagrams in parallel.. EuroCG, page 123-126. Technische Universiteit Eindhoven, (2005)Structure-preserving sparsification methods for social networks., , , , and . Soc. Netw. Anal. Min., 6 (1): 22:1-22:22 (2016)