Henning Meyerhenke
Henning Meyerhenke
Professor of Computer Science, HU Berlin
Verified email at hu-berlin.de - Homepage
Cited by
Cited by
Recent advances in graph partitioning
A Buluç, H Meyerhenke, I Safro, P Sanders, C Schulz
Algorithm Engineering, LNCS 9220, 2013
Graph partitioning and graph clustering
DA Bader, H Meyerhenke, P Sanders, D Wagner
American Mathematical Soc., 2013
NetworKit: A Tool Suite for Large-scale Complex Network Analysis
CL Staudt, A Sazonovs, H Meyerhenke
Network Science, 2016
Engineering Parallel Algorithms for Community Detection in Massive Networks
C Staudt, H Meyerhenke
IEEE Transaction on Parallel and Distributed Systems 27 (1), 171-184, 2016
Mathematical foundations of the GraphBLAS
J Kepner, P Aaltonen, D Bader, A Buluç, F Franchetti, J Gilbert, ...
HPEC 2016, also as arXiv preprint arXiv:1606.05790, 2016
Benchmarking for Graph Clustering and Partitioning
DA Bader, A Kappes, H Meyerhenke, P Sanders, C Schulz, D Wagner
Encyclopedia of Social Network Analysis and Mining, 2014
A new diffusion-based multilevel algorithm for computing graph partitions
H Meyerhenke, B Monien, T Sauerwald
Journal of Parallel and Distributed Computing 69 (9), 750-761, 2009
Parallel graph partitioning for complex networks
H Meyerhenke, P Sanders, C Schulz
IEEE Transactions on Parallel and Distributed Systems 28 (9), 2625-2638, 2017
Parallel community detection for massive graphs
EJ Riedy, H Meyerhenke, D Ediger, DA Bader
International Conference on Parallel Processing and Applied Mathematics, 286-296, 2011
Partitioning (hierarchically clustered) complex networks via size-constrained graph clustering
H Meyerhenke, P Sanders, C Schulz
Journal of Heuristics 22 (5), 759-782, 2016
Scalable Multi-threaded Community Detection in Social Networks
J Riedy, DA Bader, H Meyerhenke
Intl. Parallel & Distributed Processing Symposium Workshops (IPDPSW 2012), 2012
Approximating betweenness centrality in large evolving networks
E Bergamini, H Meyerhenke, CL Staudt
SIAM ALENEX 2015, 2015
Tracking structure of streaming social networks
D Ediger, J Riedy, DA Bader, H Meyerhenke
2011 IEEE International Symposium on Parallel and Distributed Processing …, 2011
Graph partitioning and disturbed diffusion
H Meyerhenke, B Monien, S Schamberger
Parallel Computing 35 (10-11), 544-569, 2009
Approximating Betweenness Centrality in Fully-dynamic Networks
E Bergamini, H Meyerhenke
Internet Mathematics, 2016
Graphs, Matrices, and the GraphBLAS: Seven Good Reasons
J Kepner, DA Bader, A Buluç, J Gilbert, T Mattson, H Meyerhenke
arXiv preprint arXiv:1504.01039, 2015
Structure-preserving sparsification methods for social networks
M Hamann, G Lindner, H Meyerhenke, CL Staudt, D Wagner
Social Network Analysis and Mining 6 (1), 22, 2016
Computing Top-k Closeness Centrality Faster in Unweighted Graphs
E Bergamini, M Borassi, P Crescenzi, A Marino, H Meyerhenke
SIAM Algorithms and Experiments (ALENEX 2016), 2016
Generating random hyperbolic graphs in subquadratic time
M von Looz, H Meyerhenke, R Prutkin
International Symposium on Algorithms and Computation, 467-478, 2015
A distributed diffusive heuristic for clustering a virtual P2P supercomputer
J Gehweiler, H Meyerhenke
2010 IEEE International Symposium on Parallel & Distributed Processing …, 2010
The system can't perform the operation now. Try again later.
Articles 1–20