Journal Articles by H. Meyerhenke


A. van der Grinten, G. Custers, D. L. Thanh, and H. Meyerhenke
Fast Dynamic Updates and Dynamic SpGEMM on MPI-Distributed Graphs
CoRR, 220208808, 2022
arXiv eprint, RIS, BibTex
E. Angriman, F. Brandt-Tumescheit, L. Franke, A. van der Grinten, and H. Meyerhenke
Interactive Visualization of Protein RINs using NetworKit in the Cloud
CoRR, 220301263, 2022
arXiv eprint, RIS, BibTex
A. van der Grinten, E. Angriman, M. Predari, and H. Meyerhenke
New Approximation Algorithms for Forest Closeness Centrality - for Individual Vertices and Vertex Groups
CoRR, 210106192, 2021
arXiv eprint, RIS, BibTex
E. Angriman, H. Meyerhenke, C. Schulz, and B. Uçar
Fully-dynamic Weighted Matching Approximation in Practice
CoRR, 210413098, 2021
arXiv eprint, RIS, BibTex
M. Predari, C. Tzovas, C. Schulz, and H. Meyerhenke
An MPI-based Algorithm for Mapping Complex Networks onto Hierarchical Architectures
CoRR, 210702539, 2021
arXiv eprint, RIS, BibTex
Z. Su, H. Meyerhenke, and J. Kurths
The climatic interdependence of extreme-rainfall events around the globe
CoRR, 211103471, 2021
arXiv eprint, RIS, BibTex
J. Bader, L. Thamsen, S. Kulagina, J. Will, H. Meyerhenke, and O. Kao
Tarema: Adaptive Resource Allocation for Scalable Scientific Workflows in Heterogeneous Clusters
CoRR, 211105167, 2021
arXiv eprint, RIS, BibTex
U. Leser, M. Hilbrich, C. Draxl, P. Eisert, L. Grunske, P. Hostert, D. Kainmüller, O. Kao, et al.
The Collaborative Research Center FONDA
Datenbank-Spektrum, 21(3), 2021
DOI, RIS, BibTex
A. van der Grinten, E. Angriman, and H. Meyerhenke
Scaling up network centrality computations - A brief overview
it Inf. Technol., 62(34), 2020
DOI, RIS, BibTex
M. F. Faraj, A. van der Grinten, H. Meyerhenke, J. L. Träff, and C. Schulz
High-Quality Hierarchical Process Mapping
CoRR, 200107134, 2020
arXiv eprint, RIS, BibTex
M. Simsek and H. Meyerhenke
Combined Centrality Measures for an Improved Characterization of Influence Spreadin Social Networks
CoRR, 200305254, 2020
arXiv eprint, RIS, BibTex
E. Bergamini, M. Borassi, P. Crescenzi, A. Marino, and H. Meyerhenke
Computing top-k Closeness Centrality Faster in Unweighted Graphs
TKDD, 13(5), 2019
DOI, RIS, BibTex
E. Angriman, A. van der Grinten, M. von Looz, H. Meyerhenke, M. Nöllenburg, M. Predari, and C. Tzovas
Guidelines for Experimental Algorithmics: A Case Study in Network Analysis
Algorithms, 12(7), 2019
DOI, RIS, BibTex
O. Taubert, I. Reinartz, H. Meyerhenke, and A. Schug
diSTruct v1.0: generating biomolecular structures from distance constraints
Bioinform., 35(24), 2019
DOI, RIS, BibTex
A. van der Grinten, E. Angriman, and H. Meyerhenke
Parallel Adaptive Sampling with almost no Synchronization
CoRR, 190309422, 2019
arXiv eprint, RIS, BibTex
E. Angriman, A. van der Grinten, M. von Looz, H. Meyerhenke, M. Nöllenburg, M. Predari, and C. Tzovas
Guidelines for Experimental Algorithmics in Network Analysis
CoRR, 190404690, 2019
arXiv eprint, RIS, BibTex
A. van der Grinten and H. Meyerhenke
Scaling Betweenness Approximation to Billions of Edges by MPI-based Adaptive Sampling
CoRR, 191011039, 2019
arXiv eprint, RIS, BibTex
E. Angriman, A. van der Grinten, A. Bojchevski, D. Zügner, S. Günnemann, and H. Meyerhenke
Group Centrality Maximization for Large-scale Graphs
CoRR, 191013874, 2019
arXiv eprint, RIS, BibTex
H. Meyerhenke, M. Nöllenburg, and C. Schulz
Drawing Large Graphs by Multilevel Maxent-Stress Optimization
IEEE Trans. Vis. Comput. Graph., 24(5), 2018
DOI, RIS, BibTex
M. von Looz and H. Meyerhenke
Updating Dynamic Random Hyperbolic Graphs in Sublinear Time
ACM Journal of Experimental Algorithmics, 23, 2018
URL, RIS, BibTex
E. Bergamini, P. Crescenzi, G. D. Angelo, H. Meyerhenke, L. Severini, and Y. Velaj
Improving the Betweenness Centrality of a Node by Adding Links
ACM Journal of Experimental Algorithmics, 23, 2018
URL, RIS, BibTex
H. Meyerhenke, R. Peng, and I. Safro
High-Performance Graph Algorithms (Dagstuhl Seminar 18241)
Dagstuhl Reports, 8(6), 2018
DOI, RIS, BibTex
A. van der Grinten, E. Bergamini, O. Green, D. A. Bader, and H. Meyerhenke
Scalable Katz Ranking Computation in Large Static and Dynamic Graphs
CoRR, 180703847, 2018
arXiv eprint, RIS, BibTex
M. von Looz, C. Tzovas, and H. Meyerhenke
Balanced k-means for Parallel Geometric Partitioning
CoRR, 180501208, 2018
arXiv eprint, RIS, BibTex
R. Glantz, M. Predari, and H. Meyerhenke
Topology-induced Enhancement of Mappings
CoRR, 180407131, 2018
arXiv eprint, RIS, BibTex
M. von Looz and H. Meyerhenke
Updating Dynamic Random Hyperbolic Graphs in Sublinear Time
CoRR, 180203297, 2018
arXiv eprint, RIS, BibTex
H. Meyerhenke, P. Sanders, and C. Schulz
Parallel Graph Partitioning for Complex Networks
IEEE Trans. Parallel Distrib. Syst., 28(9), 2017
DOI, RIS, BibTex
R. Glantz and H. Meyerhenke
On finding convex cuts in general, bipartite and plane graphs
Theor. Comput. Sci., 695, 2017
DOI, RIS, BibTex
M. Wegner, O. Taubert, A. Schug, and H. Meyerhenke
Maxent-Stress Optimization of 3D Biomolecular Models
CoRR, 170606805, 2017
arXiv eprint, RIS, BibTex
R. Kimmig, H. Meyerhenke, and D. Strash
Shared Memory Parallel Subgraph Enumeration
CoRR, 170509358, 2017
arXiv eprint, RIS, BibTex
E. Bergamini, H. Meyerhenke, M. Ortmann, and A. Slobbe
Faster Betweenness Centrality Updates in Evolving Networks
CoRR, 170408592, 2017
arXiv eprint, RIS, BibTex
E. Bergamini, P. Crescenzi, G. D. Angelo, H. Meyerhenke, L. Severini, and Y. Velaj
Improving the betweenness centrality of a node by adding links
CoRR, 170205284, 2017
arXiv eprint, RIS, BibTex
E. Bergamini, M. Borassi, P. Crescenzi, A. Marino, and H. Meyerhenke
Computing top-k Closeness Centrality Faster in Unweighted Graphs
CoRR, 170401077, 2017
arXiv eprint, RIS, BibTex
E. Bergamini, T. Gonser, and H. Meyerhenke
Scaling up Group Closeness Maximization
CoRR, 171001144, 2017
arXiv eprint, RIS, BibTex
P. Bisenius, E. Bergamini, E. Angriman, and H. Meyerhenke
Computing Top-k Closeness Centrality in Fully-dynamic Graphs
CoRR, 171001143, 2017
arXiv eprint, RIS, BibTex
C. L. Staudt, M. Hamann, A. Gutfraind, I. Safro, and H. Meyerhenke
Generating realistic scaled complex networks
Applied Network Science, 2, 2017
DOI, RIS, BibTex
C. L. Staudt and H. Meyerhenke
Engineering Parallel Algorithms for Community Detection in Massive Networks
IEEE Trans. Parallel Distrib. Syst., 27(1), 2016
DOI, RIS, BibTex
J. Koch, C. L. Staudt, M. Vogel, and H. Meyerhenke
An empirical comparison of Big Graph frameworks in the context of network analysis
Social Netw. Analys. Mining, 6(1), 2016
DOI, RIS, BibTex
M. Hamann, G. Lindner, H. Meyerhenke, C. L. Staudt, and D. Wagner
Structure-preserving sparsification methods for social networks
Social Netw. Analys. Mining, 6(1), 2016
DOI, RIS, BibTex
C. L. Staudt, A. Sazonovs, and H. Meyerhenke
NetworKit: A tool suite for large-scale complex network analysis
Network Science, 4(4), 2016
DOI, RIS, BibTex
R. Glantz, H. Meyerhenke, and C. Schulz
Tree-Based Coarsening and Partitioning of Complex Networks
ACM Journal of Experimental Algorithmics, 21(1), 2016
DOI, RIS, BibTex
E. Bergamini and H. Meyerhenke
Approximating Betweenness Centrality in Fully Dynamic Networks
Internet Mathematics, 12(5), 2016
DOI, RIS, BibTex
H. Meyerhenke, P. Sanders, and C. Schulz
Partitioning (hierarchically clustered) complex networks via size-constrained graph clustering
J. Heuristics, 22(5), 2016
DOI, RIS, BibTex
C. L. Staudt, M. Hamann, I. Safro, A. Gutfraind, and H. Meyerhenke
Generating Scaled Replicas of Real-World Complex Networks
CoRR, 160902121, 2016
arXiv eprint, RIS, BibTex
M. von Looz, M. Wolter, C. R. Jacob, and H. Meyerhenke
Better partitions of protein graphs for subsystem quantum chemistry
CoRR, 160603427, 2016
arXiv eprint, RIS, BibTex
M. von Looz, M. Özdayi, S. Laue, and H. Meyerhenke
Generating massive complex networks with hyperbolic geometry faster in practice
CoRR, 160609481, 2016
arXiv eprint, RIS, BibTex
J. Koch, C. L. Staudt, M. Vogel, and H. Meyerhenke
An Empirical Comparison of Big Graph Frameworks in the Context of Network Analysis
CoRR, 160100289, 2016
arXiv eprint, RIS, BibTex
J. Kepner, P. Aaltonen, D. A. Bader, A. B. c, F. Franchetti, J. R. Gilbert, D. Hutchison, M. Kumar, et al.
Mathematical Foundations of the GraphBLAS
CoRR, 160605790, 2016
arXiv eprint, RIS, BibTex
M. Hamann, G. Lindner, H. Meyerhenke, C. L. Staudt, and D. Wagner
Structure-Preserving Sparsification Methods for Social Networks
CoRR, 160100286, 2016
arXiv eprint, RIS, BibTex
R. Glantz, C. L. Staudt, and H. Meyerhenke
Correspondences between partitions
CoRR, 160304788, 2016
arXiv eprint, RIS, BibTex
E. Bergamini, M. Wegner, D. Lukarski, and H. Meyerhenke
Estimating Current-Flow Closeness Centrality with a Multigrid Laplacian Solver
CoRR, 160702955, 2016
arXiv eprint, RIS, BibTex
D. Hoske, D. Lukarski, H. Meyerhenke, and M. Wegner
Engineering a Combinatorial Laplacian Solver: Lessons Learned
Algorithms, 9(4), 2016
DOI, RIS, BibTex
S. Schlag, V. Henne, T. Heuer, H. Meyerhenke, P. Sanders, and C. Schulz
k-way Hypergraph Partitioning via n-Level Recursive Bisection
CoRR, 151103137, 2015
arXiv eprint, RIS, BibTex
H. Meyerhenke, M. Nöllenburg, and C. Schulz
Drawing Large Graphs by Multilevel Maxent-Stress Optimization
CoRR, 150604383, 2015
arXiv eprint, RIS, BibTex
M. von Looz, C. L. Staudt, H. Meyerhenke, and R. Prutkin
Fast generation of dynamic complex networks with underlying hyperbolic geometry
CoRR, 150103545, 2015
arXiv eprint, RIS, BibTex
M. von Looz and H. Meyerhenke
Querying Probabilistic Neighborhoods in Spatial Data Sets Efficiently
CoRR, 150901990, 2015
arXiv eprint, RIS, BibTex
G. Lindner, C. L. Staudt, M. Hamann, H. Meyerhenke, and D. Wagner
Structure-Preserving Sparsification of Social Networks
CoRR, 150500564, 2015
arXiv eprint, RIS, BibTex
J. Kepner, D. A. Bader, A. B. c, J. R. Gilbert, T. G. Mattson, and H. Meyerhenke
Graphs, Matrices, and the GraphBLAS: Seven Good Reasons
CoRR, 150401039, 2015
arXiv eprint, RIS, BibTex
D. Hoske, D. Lukarski, H. Meyerhenke, and M. Wegner
Is Nearly-linear the same in Theory and Practice? A Case Study with a Combinatorial Laplacian Solver
CoRR, 150207888, 2015
arXiv eprint, RIS, BibTex
V. Henne, H. Meyerhenke, P. Sanders, S. Schlag, and C. Schulz
n-Level Hypergraph Partitioning
CoRR, 150500693, 2015
arXiv eprint, RIS, BibTex
E. Bergamini and H. Meyerhenke
Approximating Betweenness Centrality in Fully-dynamic Networks
CoRR, 151007971, 2015
arXiv eprint, RIS, BibTex
E. Bergamini and H. Meyerhenke
Fully-dynamic Approximation of Betweenness Centrality
CoRR, 150407091, 2015
arXiv eprint, RIS, BibTex
U. C. Meyer, H. Meyerhenke, A. Pinar, and I. Safro
High-performance Graph Algorithms and Applications in Computational Science (Dagstuhl Seminar 14461)
Dagstuhl Reports, 4(11), 2014
DOI, RIS, BibTex
C. Staudt, A. Sazonovs, and H. Meyerhenke
NetworKit: An Interactive Tool Suite for High-Performance Network Analysis
CoRR, 14033005, 2014
arXiv eprint, RIS, BibTex
H. Meyerhenke, P. Sanders, and C. Schulz
Parallel Graph Partitioning for Complex Networks
CoRR, 14044797, 2014
arXiv eprint, RIS, BibTex
H. Meyerhenke, P. Sanders, and C. Schulz
Partitioning Complex Networks via Size-constrained Clustering
CoRR, 14023281, 2014
arXiv eprint, RIS, BibTex
R. Glantz, H. Meyerhenke, and C. Schulz
Tree-based Coarsening and Partitioning of Complex Networks
CoRR, 14022782, 2014
arXiv eprint, RIS, BibTex
R. Glantz, H. Meyerhenke, and A. Noe
Algorithms for Mapping Parallel Processes onto Grid and Torus Architectures
CoRR, 14110921, 2014
arXiv eprint, RIS, BibTex
E. Bergamini, H. Meyerhenke, and C. Staudt
Approximating Betweenness Centrality in Large Evolving Networks
CoRR, 14096241, 2014
arXiv eprint, RIS, BibTex
X. Liu, P. R. Pande, H. Meyerhenke, and D. A. Bader
PASQUAL: Parallel Techniques for Next Generation Genome Sequence Assembly
IEEE Trans. Parallel Distrib. Syst., 24(5), 2013
DOI, RIS, BibTex
C. Staudt, A. Schumm, H. Meyerhenke, R. Görke, and D. Wagner
Static and Dynamic Aspects of Scientific Collaboration Networks
CoRR, 13065268, 2013
arXiv eprint, RIS, BibTex
A. B. c, H. Meyerhenke, I. Safro, P. Sanders, and C. Schulz
Recent Advances in Graph Partitioning
CoRR, 13113144, 2013
arXiv eprint, RIS, BibTex
C. Staudt and H. Meyerhenke
Engineering High-Performance Community Detection Heuristics for Massive Graphs
CoRR, 13044453, 2013
arXiv eprint, RIS, BibTex
R. Glantz and H. Meyerhenke
Finding all Convex Cuts of a Plane Graph in Cubic Time
CoRR, 13034349, 2013
arXiv eprint, RIS, BibTex
H. Meyerhenke and T. Sauerwald
Beyond Good Partition Shapes: An Analysis of Diffusive Graph Partitioning
Algorithmica, 64(3), 2012
DOI, RIS, BibTex
H. Meyerhenke, B. Monien, and S. Schamberger
Graph partitioning and disturbed diffusion
Parallel Computing, 35(1011), 2009
DOI, RIS, BibTex
H. Meyerhenke, B. Monien, and T. Sauerwald
A new diffusion-based multilevel algorithm for computing graph partitions
J. Parallel Distrib. Comput., 69(9), 2009
DOI, RIS, BibTex

Conference Papers


E. Angriman, H. Meyerhenke, C. Schulz, and B. Uçar
Fully-dynamic Weighted Matching Approximation in Practice
Proceedings of the 2021 {SIAM} Conference on Applied and Computational Discrete Algorithms, {ACDA} 2021, Virtual Conference, July 19-21, 2021, SIAM, 2021
DOI, RIS, BibTex
J. Bader, L. Thamsen, S. Kulagina, J. Will, H. Meyerhenke, and O. Kao
Tarema: Adaptive Resource Allocation for Scalable Scientific Workflows in Heterogeneous Clusters
2021 {IEEE} International Conference on Big Data (Big Data), Orlando, FL, USA, December 15-18, 2021, IEEE, 2021
DOI, RIS, BibTex
M. Predari, C. Tzovas, C. Schulz, and H. Meyerhenke
An MPI-based Algorithm for Mapping Complex Networks onto Hierarchical Architectures
Euro-Par 2021: Parallel Processing - 27th International Conference on Parallel and Distributed Computing, Lisbon, Portugal, September 1-3, 2021, Proceedings, Springer, 2021
DOI, RIS, BibTex
E. Angriman, R. Becker, G. D'Angelo, H. Gilbert, A. van der Grinten, and H. Meyerhenke
Group-Harmonic and Group-Closeness Maximization - Approximation and Engineering
Proceedings of the Symposium on Algorithm Engineering and Experiments, {ALENEX} 2021, Virtual Conference, January 10-11, 2021, SIAM, 2021
DOI, RIS, BibTex
A. van der Grinten, E. Angriman, M. Predari, and H. Meyerhenke
New Approximation Algorithms for Forest Closeness Centrality - for Individual Vertices and Vertex Groups
Proceedings of the 2021 {SIAM} International Conference on Data Mining, {SDM} 2021, Virtual Event, April 29 - May 1, 2021, SIAM, 2021
DOI, RIS, BibTex
E. Angriman, H. Meyerhenke, C. Schulz, and B. Uçar
Fully-dynamic Weighted Matching Approximation in Practice
Proceedings of the 2021 {SIAM} Conference on Applied and Computational Discrete Algorithms, {ACDA} 2021, Virtual Conference, July 19-21, 2021, SIAM, 2021
DOI, RIS, BibTex
A. van der Grinten and H. Meyerhenke
Scaling Betweenness Approximation to Billions of Edges by MPI-based Adaptive Sampling
2020 IEEE International Parallel and Distributed Processing Symposium (IPDPS), New Orleans, LA, USA, May 18-22, 2020, IEEE, 2020
DOI, RIS, BibTex
E. Angriman, M. Predari, A. van der Grinten, and H. Meyerhenke
Approximation of the Diagonal of a Laplacian's Pseudoinverse for Complex Network Analysis
28th Annual European Symposium on Algorithms, ESA 2020, September 7-9, 2020, Pisa, Italy (Virtual Conference), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020
DOI, RIS, BibTex
C. Tzovas, M. Predari, and H. Meyerhenke
Distributing Sparse Matrix/Graph Applications in Heterogeneous Clusters - an Experimental Study
27th {IEEE} International Conference on High Performance Computing, Data, and Analytics, HiPC 2020, Pune, India, December 16-19, 2020, IEEE, 2020
DOI, RIS, BibTex
E. Angriman, A. van der Grinten, A. Bojchevski, D. Zügner, S. Günnemann, and H. Meyerhenke
Group Centrality Maximization for Large-scale Graphs
Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2020, Salt Lake City, UT, USA, January 5-6, 2020, SIAM, 2020
DOI, RIS, BibTex
A. van der Grinten, E. Angriman, and H. Meyerhenke
Parallel Adaptive Sampling with Almost No Synchronization
Euro-Par 2019: Parallel Processing - 25th International Conference on Parallel and Distributed Computing, Göttingen, Germany, August 26-30, 2019, Proceedings, Springer, 2019
DOI, RIS, BibTex
E. Angriman, A. van der Grinten, and H. Meyerhenke
Local Search for Group Closeness Maximization on Big Graphs
2019 IEEE International Conference on Big Data (Big Data), Los Angeles, CA, USA, December 9-12, 2019, IEEE, 2019
DOI, RIS, BibTex
A. van der Grinten and H. Meyerhenke
Scaling up Network Centrality Computations
Design, Automation & Test in Europe Conference & Exhibition, DATE 2019, Florence, Italy, March 25-29, 2019, IEEE, 2019
DOI, RIS, BibTex
P. Bisenius, E. Bergamini, E. Angriman, and H. Meyerhenke
Computing Top-k Closeness Centrality in Fully-dynamic Graphs
Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments, ALENEX 2018, New Orleans, LA, USA, January 7-8, 2018., 2018
DOI, RIS, BibTex
R. Glantz and H. Meyerhenke
Many-to-many Correspondences between Partitions: Introducing a Cut-based Approach
Proceedings of the 2018 SIAM International Conference on Data Mining, SDM 2018, May 3-5, 2018, San Diego Marriott Mission Valley, San Diego, CA, USA., 2018
DOI, RIS, BibTex
M. von Looz, C. Tzovas, and H. Meyerhenke
Balanced k-means for Parallel Geometric Partitioning
Proceedings of the 47th International Conference on Parallel Processing, ICPP 2018, Eugene, OR, USA, August 13-16, 2018, 2018
DOI, RIS, BibTex
R. Glantz, M. Predari, and H. Meyerhenke
Topology-induced Enhancement of Mappings
Proceedings of the 47th International Conference on Parallel Processing, ICPP 2018, Eugene, OR, USA, August 13-16, 2018, 2018
DOI, RIS, BibTex
A. van der Grinten, E. Bergamini, O. Green, D. A. Bader, and H. Meyerhenke
Scalable Katz Ranking Computation in Large Static and Dynamic Graphs
26th Annual European Symposium on Algorithms, ESA 2018, August 20-22, 2018, Helsinki, Finland, 2018
DOI, RIS, BibTex
E. Bergamini, T. Gonser, and H. Meyerhenke
Scaling up Group Closeness Maximization
Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments, ALENEX 2018, New Orleans, LA, USA, January 7-8, 2018., 2018
DOI, RIS, BibTex
E. Bergamini, H. Meyerhenke, M. Ortmann, and A. Slobbe
Faster Betweenness Centrality Updates in Evolving Networks
16th International Symposium on Experimental Algorithms, SEA 2017, June 21-23, 2017, London, UK, 2017
DOI, RIS, BibTex
R. Kimmig, H. Meyerhenke, and D. Strash
Shared Memory Parallel Subgraph Enumeration
2017 IEEE International Parallel and Distributed Processing Symposium Workshops, IPDPS Workshops 2017, Orlando / Buena Vista, FL, USA, May 29 - June 2, 2017, 2017
DOI, RIS, BibTex
M. Wegner, O. Taubert, A. Schug, and H. Meyerhenke
Maxent-Stress Optimization of 3D Biomolecular Models
25th Annual European Symposium on Algorithms, ESA 2017, September 4-6, 2017, Vienna, Austria, 2017
DOI, RIS, BibTex
J. Kepner, P. Aaltonen, D. A. Bader, A. B. c, F. Franchetti, J. R. Gilbert, D. Hutchison, M. Kumar, et al.
Mathematical foundations of the GraphBLAS
2016 IEEE High Performance Extreme Computing Conference, HPEC 2016, Waltham, MA, USA, September 13-15, 2016, 2016
DOI, RIS, BibTex
C. L. Staudt, M. Hamann, I. Safro, A. Gutfraind, and H. Meyerhenke
Generating Scaled Replicas of Real-World Complex Networks
Complex Networks & Their Applications V - Proceedings of the 5th International Workshop on Complex Networks and their Applications (COMPLEX NETWORKS 2016), Milan, Italy, November 30 - December 2, 2016., 2016
DOI, RIS, BibTex
S. Schlag, V. Henne, T. Heuer, H. Meyerhenke, P. Sanders, and C. Schulz
k-way Hypergraph Partitioning via n-Level Recursive Bisection
Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments, ALENEX 2016, Arlington, Virginia, USA, January 10, 2016, 2016
DOI, RIS, BibTex
E. Bergamini, M. Borassi, P. Crescenzi, A. Marino, and H. Meyerhenke
Computing Top-k Closeness Centrality Faster in Unweighted Graphs
Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments, ALENEX 2016, Arlington, Virginia, USA, January 10, 2016, 2016
DOI, RIS, BibTex
A. B. c, H. Meyerhenke, I. Safro, P. Sanders, and C. Schulz
Recent Advances in Graph Partitioning
Algorithm Engineering - Selected Results and Surveys, 2016
DOI, RIS, BibTex
M. von Looz, M. Wolter, C. R. Jacob, and H. Meyerhenke
Better Partitions of Protein Graphs for Subsystem Quantum Chemistry
Experimental Algorithms - 15th International Symposium, SEA 2016, St. Petersburg, Russia, June 5-8, 2016, Proceedings, 2016
DOI, RIS, BibTex
E. Bergamini, M. Wegner, D. Lukarski, and H. Meyerhenke
Estimating Current-Flow Closeness Centrality with a Multigrid Laplacian Solver
2016 Proceedings of the Seventh SIAM Workshop on Combinatorial Scientific Computing, CSC 2016, Albuquerque, New Mexico, USA, October 10-12, 2016., 2016
DOI, RIS, BibTex
M. von Looz and H. Meyerhenke
Querying Probabilistic Neighborhoods in Spatial Data Sets Efficiently
Combinatorial Algorithms - 27th International Workshop, IWOCA 2016, Helsinki, Finland, August 17-19, 2016, Proceedings, 2016
DOI, RIS, BibTex
M. von Looz, M. S. Özdayi, S. Laue, and H. Meyerhenke
Generating massive complex networks with hyperbolic geometry faster in practice
2016 IEEE High Performance Extreme Computing Conference, HPEC 2016, Waltham, MA, USA, September 13-15, 2016, 2016
DOI, RIS, BibTex
J. Kepner, D. A. Bader, A. B. c, J. R. Gilbert, T. G. Mattson, and H. Meyerhenke
Graphs, Matrices, and the GraphBLAS: Seven Good Reasons
Proceedings of the International Conference on Computational Science, ICCS 2015, Computational Science at the Gates of Nature, Reykjavik, Iceland, 1-3 June, 2015, 2014, 2015
DOI, RIS, BibTex
D. Hoske, D. Lukarski, H. Meyerhenke, and M. Wegner
Is Nearly-linear the Same in Theory and Practice? A Case Study with a Combinatorial Laplacian Solver
Experimental Algorithms - 14th International Symposium, SEA 2015, Paris, France, June 29 - July 1, 2015, Proceedings, 2015
DOI, RIS, BibTex
R. Glantz, H. Meyerhenke, and A. Noe
Algorithms for Mapping Parallel Processes onto Grid and Torus Architectures
23rd Euromicro International Conference on Parallel, Distributed, and Network-Based Processing, PDP 2015, Turku, Finland, March 4-6, 2015, 2015
DOI, RIS, BibTex
M. von Looz, H. Meyerhenke, and R. Prutkin
Generating Random Hyperbolic Graphs in Subquadratic Time
Algorithms and Computation - 26th International Symposium, ISAAC 2015, Nagoya, Japan, December 9-11, 2015, Proceedings, 2015
DOI, RIS, BibTex
H. Meyerhenke, P. Sanders, and C. Schulz
Parallel Graph Partitioning for Complex Networks
2015 IEEE International Parallel and Distributed Processing Symposium, IPDPS 2015, Hyderabad, India, May 25-29, 2015, 2015
DOI, RIS, BibTex
H. Meyerhenke, M. Nöllenburg, and C. Schulz
Drawing Large Graphs by Multilevel Maxent-Stress Optimization
Graph Drawing and Network Visualization - 23rd International Symposium, GD 2015, Los Angeles, CA, USA, September 24-26, 2015, Revised Selected Papers, 2015
DOI, RIS, BibTex
E. Bergamini and H. Meyerhenke
Fully-Dynamic Approximation of Betweenness Centrality
Algorithms - ESA 2015 - 23rd Annual European Symposium, Patras, Greece, September 14-16, 2015, Proceedings, 2015
DOI, RIS, BibTex
G. Lindner, C. L. Staudt, M. Hamann, H. Meyerhenke, and D. Wagner
Structure-Preserving Sparsification of Social Networks
Proceedings of the 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2015, Paris, France, August 25 - 28, 2015, 2015
DOI, RIS, BibTex
J. Koch, C. L. Staudt, M. Vogel, and H. Meyerhenke
Complex Network Analysis on Distributed Systems: An Empirical Comparison
Proceedings of the 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2015, Paris, France, August 25 - 28, 2015, 2015
DOI, RIS, BibTex
E. Bergamini, H. Meyerhenke, and C. Staudt
Approximating Betweenness Centrality in Large Evolving Networks
Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments, ALENEX 2015, San Diego, CA, USA, January 5, 2015, 2015
DOI, RIS, BibTex
D. A. Bader, H. Meyerhenke, P. Sanders, C. Schulz, A. Kappes, and D. Wagner
Benchmarking for Graph Clustering and Partitioning
Encyclopedia of Social Network Analysis and Mining, 2014
DOI, RIS, BibTex
H. Meyerhenke, P. Sanders, and C. Schulz
Partitioning Complex Networks via Size-Constrained Clustering
Experimental Algorithms - 13th International Symposium, SEA 2014, Copenhagen, Denmark, June 29 - July 1, 2014. Proceedings, 2014
DOI, RIS, BibTex
R. Glantz, H. Meyerhenke, and C. Schulz
Tree-Based Coarsening and Partitioning of Complex Networks
Experimental Algorithms - 13th International Symposium, SEA 2014, Copenhagen, Denmark, June 29 - July 1, 2014. Proceedings, 2014
DOI, RIS, BibTex
C. Staudt, Y. Marrakchi, and H. Meyerhenke
Detecting communities around seed nodes in complex networks
2014 IEEE International Conference on Big Data, Big Data 2014, Washington, DC, USA, October 27-30, 2014, 2014
DOI, RIS, BibTex
C. Staudt and H. Meyerhenke
Engineering High-Performance Community Detection Heuristics for Massive Graphs
42nd International Conference on Parallel Processing, ICPP 2013, Lyon, France, October 1-4, 2013, 2013
DOI, RIS, BibTex
G. F. Italiano, H. Meyerhenke, G. E. Blelloch, and P. Tsigas
Topic 12: Theory and Algorithms for Parallel Computation - (Introduction)
Euro-Par 2013 Parallel Processing - 19th International Conference, Aachen, Germany, August 26-30, 2013. Proceedings, 2013
DOI, RIS, BibTex
R. Glantz and H. Meyerhenke
Finding All Convex Cuts of a Plane Graph in Cubic Time
Algorithms and Complexity, 8th International Conference, CIAC 2013, Barcelona, Spain, May 22-24, 2013. Proceedings, 2013
DOI, RIS, BibTex
E. J. Riedy, D. A. Bader, and H. Meyerhenke
Scalable Multi-threaded Community Detection in Social Networks
26th IEEE International Parallel and Distributed Processing Symposium Workshops & PhD Forum, IPDPS 2012, Shanghai, China, May 21-25, 2012, 2012
DOI, RIS, BibTex
E. J. Riedy, H. Meyerhenke, D. A. Bader, D. Ediger, and T. G. Mattson
Analysis of streaming social networks and graphs on multicore architectures
2012 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP 2012, Kyoto, Japan, March 25-30, 2012, 2012
DOI, RIS, BibTex
G. Pucci, C. D. Zaroliagis, K. T. Herley, and H. Meyerhenke
Topic 12: Theory and Algorithms for Parallel Computation
Euro-Par 2012 Parallel Processing - 18th International Conference, Euro-Par 2012, Rhodes Island, Greece, August 27-31, 2012. Proceedings, 2012
DOI, RIS, BibTex
E. J. Riedy, H. Meyerhenke, D. Ediger, and D. A. Bader
Parallel community detection for massive graphs
Graph Partitioning and Graph Clustering, 10th DIMACS Implementation Challenge Workshop, Georgia Institute of Technology, Atlanta, GA, USA, February 13-14, 2012. Proceedings, 2012
URL, RIS, BibTex
H. Meyerhenke
Shape optimizing load balancing for MPI-parallel adaptive numerical simulations
Graph Partitioning and Graph Clustering, 10th DIMACS Implementation Challenge Workshop, Georgia Institute of Technology, Atlanta, GA, USA, February 13-14, 2012. Proceedings, 2012
URL, RIS, BibTex
C. Staudt, A. Schumm, H. Meyerhenke, R. Görke, and D. Wagner
Static and Dynamic Aspects of Scientific Collaboration Networks
International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2012, Istanbul, Turkey, 26-29 August 2012, 2012
DOI, RIS, BibTex
E. J. Riedy, H. Meyerhenke, D. Ediger, and D. A. Bader
Parallel Community Detection for Massive Graphs
Parallel Processing and Applied Mathematics - 9th International Conference, PPAM 2011, Torun, Poland, September 11-14, 2011. Revised Selected Papers, Part I, 2011
DOI, RIS, BibTex
D. Ediger, E. J. Riedy, D. A. Bader, and H. Meyerhenke
Tracking Structure of Streaming Social Networks
25th IEEE International Symposium on Parallel and Distributed Processing, IPDPS 2011, Anchorage, Alaska, USA, 16-20 May 2011 - Workshop Proceedings, 2011
DOI, RIS, BibTex
H. Meyerhenke
Beyond Good Shapes: Diffusion-Based Graph Partitioning Is Relaxed Cut Optimization
Algorithms and Computation - 21st International Symposium, ISAAC 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part II, 2010
DOI, RIS, BibTex
J. Gehweiler and H. Meyerhenke
A distributed diffusive heuristic for clustering a virtual P2P supercomputer
24th IEEE International Symposium on Parallel and Distributed Processing, IPDPS 2010, Atlanta, Georgia, USA, 19-23 April 2010 - Workshop Proceedings, 2010
DOI, RIS, BibTex
H. Meyerhenke and J. Gehweiler
On Dynamic Graph Partitioning and Graph Clustering using Diffusion
Algorithm Engineering, 27.06. - 02.07.2010, 2010
URL, RIS, BibTex
D. Ajwani and H. Meyerhenke
Realistic Computer Models
Algorithm Engineering: Bridging the Gap between Algorithm Theory and Practice [outcome of a Dagstuhl Seminar], 2010
DOI, RIS, BibTex
H. Meyerhenke
Dynamic Load Balancing for Parallel Numerical Simulations Based on Repartitioning with Disturbed Diffusion
15th IEEE International Conference on Parallel and Distributed Systems, ICPADS 2009, Shenzhen, China, December 8-11, 2009, 2009
DOI, RIS, BibTex
H. Meyerhenke, B. Monien, and T. Sauerwald
A new diffusion-based multilevel algorithm for computing graph partitions of very high quality
22nd IEEE International Symposium on Parallel and Distributed Processing, IPDPS 2008, Miami, Florida USA, April 14-18, 2008, 2008
DOI, RIS, BibTex
H. Meyerhenke and T. Sauerwald
Analyzing Disturbed Diffusion on Networks
Algorithms and Computation, 17th International Symposium, ISAAC 2006, Kolkata, India, December 18-20, 2006, Proceedings, 2006
DOI, RIS, BibTex
H. Meyerhenke, B. Monien, and S. Schamberger
Accelerating shape optimizing load balancing for parallel FEM simulations by algebraic multigrid
20th International Parallel and Distributed Processing Symposium (IPDPS 2006), Proceedings, 25-29 April 2006, Rhodes Island, Greece, 2006
DOI, RIS, BibTex
H. Meyerhenke and S. Schamberger
A Parallel Shape Optimizing Load Balancer
Euro-Par 2006, Parallel Processing, 12th International Euro-Par Conference, Dresden, Germany, August 28 - September 1, 2006, Proceedings, 2006
DOI, RIS, BibTex
H. Meyerhenke
Constructing higher-order Voronoi diagrams in parallel
(Informal) Proceedings of the 21st European Workshop on Computational Geometry, Eindhoven, The Netherlands, March 9-11, 2005, 2005
URL, RIS, BibTex
H. Meyerhenke and S. Schamberger
Balancing Parallel Adaptive FEM Computations by Solving Systems of Linear Equations
Euro-Par 2005, Parallel Processing, 11th International Euro-Par Conference, Lisbon, Portugal, August 30 - September 2, 2005, Proceedings, 2005
DOI, RIS, BibTex

Books


D. A. Bader, A. Kappes, H. Meyerhenke, P. Sanders, C. Schulz, and D. Wagner
Benchmarking for Graph Clustering and Partitioning.
Encyclopedia of Social Network Analysis and Mining, 2nd Edition, Springer, 2018
URL, RIS, BibTex

Proceedings


S. G. Kobourov and H. Meyerhenke
Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments, ALENEX 2019, San Diego, CA, USA, January 7-8, 2019
SIAM, 2019
DOI, RIS, BibTex
D. A. Bader, H. Meyerhenke, P. Sanders, and D. Wagner
Graph Partitioning and Graph Clustering, 10th DIMACS Implementation Challenge Workshop, Georgia Institute of Technology, Atlanta, GA, USA, February 13-14, 2012. Proceedings
American Mathematical Society, 2013, ISBN 978-0-8218-9038-7
DOI, ISBN, RIS, BibTex