Henning Meyerhenke

ORCID

Publication Activity (10 Years)

Years Active: 2005-2024
Publications (10 Years): 128

Top Venues

CoRR

ALENEX

SEA

ACM J. Exp. Algorithmics

Publications

Zhen Su, Yang Liu, Jürgen Kurths, Henning Meyerhenke
Generic network sparsification via degree- and subgraph-based edge sampling. Inf. Sci. 679 (2024)
Svetlana Kulagina, Henning Meyerhenke, Anne Benoit
Mapping Large Memory-constrained Workflows onto Heterogeneous Platforms. CoRR (2024)
Lukas Berner, Henning Meyerhenke
Introducing Total Harmonic Resistance for Graph Robustness under Edge Deletions. CoRR (2024)
Svetlana Kulagina, Henning Meyerhenke, Anne Benoit
Mapping Large Memory-constrained Workflows onto Heterogeneous Platforms✱. ICPP (2024)
Zhen Su, Jürgen Kurths, Henning Meyerhenke
Network Sparsification via Degree- and Subgraph-based Edge Sampling. CoRR (2023)
Maria Predari, Lukas Berner, Robert Kooij, Henning Meyerhenke
Greedy Optimization of Resistance-based Graph Robustness with Global and Local Edge Insertions. CoRR (2023)
Ümit V. Çatalyürek, Karen D. Devine, Marcelo Fonseca Faraj, Lars Gottesbüren, Tobias Heuer, Henning Meyerhenke, Peter Sanders, Sebastian Schlag, Christian Schulz, Daniel Seemaier, Dorothea Wagner
More Recent Advances in (Hyper)Graph Partitioning. ACM Comput. Surv. 55 (12) (2023)
Maria Predari, Lukas Berner, Robert Kooij, Henning Meyerhenke
Greedy optimization of resistance-based graph robustness with global and local edge insertions. Soc. Netw. Anal. Min. 13 (1) (2023)
Svetlana Kulagina, Henning Meyerhenke, Anne Benoit
Mapping tree-shaped workflows on systems with different memory sizes and processor speeds. Concurr. Comput. Pract. Exp. 35 (25) (2023)
Danai Koutra, Henning Meyerhenke, Ilya Safro, Fabian Brandt-Tumescheit
Scalable Graph Mining and Learning (Dagstuhl Seminar 23491). Dagstuhl Reports 13 (12) (2023)
Jan Mendling, Henrik Leopold, Henning Meyerhenke, Benoît Depaire
Methodology of Algorithm Engineering. CoRR (2023)
Eugenio Angriman, Fabian Brandt-Tumescheit, Leon Franke, Alexander van der Grinten, Henning Meyerhenke
Interactive Visualization of Protein RINs using NetworKit in the Cloud. IPDPS Workshops (2022)
Eugenio Angriman, Fabian Brandt-Tumescheit, Leon Franke, Alexander van der Grinten, Henning Meyerhenke
Interactive Visualization of Protein RINs using NetworKit in the Cloud. CoRR (2022)
Alexander van der Grinten, Geert Custers, Duy Le Thanh, Henning Meyerhenke
Fast Dynamic Updates and Dynamic SpGEMM on MPI-Distributed Graphs. CLUSTER (2022)
Maria Predari, Robert Kooij, Henning Meyerhenke
Faster Greedy Optimization of Resistance-based Graph Robustness. ASONAM (2022)
Ümit V. Çatalyürek, Karen D. Devine, Marcelo Fonseca Faraj, Lars Gottesbüren, Tobias Heuer, Henning Meyerhenke, Peter Sanders, Sebastian Schlag, Christian Schulz, Daniel Seemaier, Dorothea Wagner
More Recent Advances in (Hyper)Graph Partitioning. CoRR (2022)
Zhen Su, Jürgen Kurths, Henning Meyerhenke
Network Sparsification via Degree- and Subgraph-based Edge Sampling. ASONAM (2022)
Svetlana Kulagina, Henning Meyerhenke, Anne Benoit
Mapping Tree-Shaped Workflows on Memory-Heterogeneous Architectures. Euro-Par Workshops (2022)
Eugenio Angriman, Alexander van der Grinten, Michael Hamann, Henning Meyerhenke, Manuel Penschuck
Algorithms for Large-scale Network Analysis and the NetworKit Toolkit. CoRR (2022)
Eugenio Angriman, Michal Boron, Henning Meyerhenke
A Batch-dynamic Suitor Algorithm for Approximating Maximum Weighted Matching. ACM J. Exp. Algorithmics 27 (2022)
Alexander van der Grinten, Geert Custers, Duy Le Thanh, Henning Meyerhenke
An MPI-Parallel Algorithm for Static and Dynamic Top-k Harmonic Centrality. SBAC-PAD (2022)
Alexander van der Grinten, Geert Custers, Duy Le Thanh, Henning Meyerhenke
Fast Dynamic Updates and Dynamic SpGEMM on MPI-Distributed Graphs. CoRR (2022)
Alexander van der Grinten, Elisabetta Bergamini, Oded Green, David A. Bader, Henning Meyerhenke
Scalable Katz Ranking Computation in Large Static and Dynamic Graphs. ACM J. Exp. Algorithmics 27 (2022)
Alexander van der Grinten, Eugenio Angriman, Maria Predari, Henning Meyerhenke
New Approximation Algorithms for Forest Closeness Centrality - for Individual Vertices and Vertex Groups. CoRR (2021)
Eugenio Angriman, Ruben Becker, Gianlorenzo D'Angelo, Hugo Gilbert, Alexander van der Grinten, Henning Meyerhenke
Group-Harmonic and Group-Closeness Maximization - Approximation and Engineering. ALENEX (2021)
Alexander van der Grinten, Eugenio Angriman, Maria Predari, Henning Meyerhenke
New Approximation Algorithms for Forest Closeness Centrality - for Individual Vertices and Vertex Groups. SDM (2021)
Zhen Su, Henning Meyerhenke, Jürgen Kurths
The climatic interdependence of extreme-rainfall events around the globe. CoRR (2021)
Jonathan Bader, Lauritz Thamsen, Svetlana Kulagina, Jonathan Will, Henning Meyerhenke, Odej Kao
Tarema: Adaptive Resource Allocation for Scalable Scientific Workflows in Heterogeneous Clusters. CoRR (2021)
Maria Predari, Charilaos Tzovas, Christian Schulz, Henning Meyerhenke
An MPI-based Algorithm for Mapping Complex Networks onto Hierarchical Architectures. CoRR (2021)
Jonathan Bader, Lauritz Thamsen, Svetlana Kulagina, Jonathan Will, Henning Meyerhenke, Odej Kao
Tarema: Adaptive Resource Allocation for Scalable Scientific Workflows in Heterogeneous Clusters. IEEE BigData (2021)
Ulf Leser, Marcus Hilbrich, Claudia Draxl, Peter Eisert, Lars Grunske, Patrick Hostert, Dagmar Kainmüller, Odej Kao, Birte Kehr, Timo Kehrer, Christoph Koch, Volker Markl, Henning Meyerhenke, Tilmann Rabl, Alexander Reinefeld, Knut Reinert, Kerstin Ritter, Björn Scheuermann, Florian Schintke, Nicole Schweikardt, Matthias Weidlich
The Collaborative Research Center FONDA. Datenbank-Spektrum 21 (3) (2021)
Maria Predari, Charilaos Tzovas, Christian Schulz, Henning Meyerhenke
An MPI-based Algorithm for Mapping Complex Networks onto Hierarchical Architectures. Euro-Par (2021)
Eugenio Angriman, Henning Meyerhenke, Christian Schulz, Bora Uçar
Fully-dynamic Weighted Matching Approximation in Practice. CoRR (2021)
Eugenio Angriman, Henning Meyerhenke, Christian Schulz, Bora Uçar
Fully-dynamic Weighted Matching Approximation in Practice. ACDA (2021)
Eugenio Angriman, Maria Predari, Alexander van der Grinten, Henning Meyerhenke
Approximation of the Diagonal of a Laplacian's Pseudoinverse for Complex Network Analysis. ESA (2020)
Marcelo Fonseca Faraj, Alexander van der Grinten, Henning Meyerhenke, Jesper Larsson Träff, Christian Schulz
High-Quality Hierarchical Process Mapping. SEA (2020)
Charilaos Tzovas, Maria Predari, Henning Meyerhenke
Distributing Sparse Matrix/Graph Applications in Heterogeneous Clusters - an Experimental Study. CoRR (2020)
Eugenio Angriman, Maria Predari, Alexander van der Grinten, Henning Meyerhenke
Approximation of the Diagonal of a Laplacian's Pseudoinverse for Complex Network Analysis. CoRR (2020)
Mehmet Simsek, Henning Meyerhenke
Combined Centrality Measures for an Improved Characterization of Influence Spreadin Social Networks. CoRR (2020)
Eugenio Angriman, Ruben Becker, Gianlorenzo D'Angelo, Hugo Gilbert, Alexander van der Grinten, Henning Meyerhenke
Group-Harmonic and Group-Closeness Maximization - Approximation and Engineering. CoRR (2020)
Mehmet Simsek, Henning Meyerhenke
Combined centrality measures for an improved characterization of influence spread in social networks. J. Complex Networks 8 (1) (2020)
Eugenio Angriman, Alexander van der Grinten, Aleksandar Bojchevski, Daniel Zügner, Stephan Günnemann, Henning Meyerhenke
Group Centrality Maximization for Large-scale Graphs. ALENEX (2020)
Charilaos Tzovas, Maria Predari, Henning Meyerhenke
Distributing Sparse Matrix/Graph Applications in Heterogeneous Clusters - an Experimental Study. HiPC (2020)
Alexander van der Grinten, Eugenio Angriman, Henning Meyerhenke
Scaling up network centrality computations - A brief overview. it Inf. Technol. 62 (3-4) (2020)
Alexander van der Grinten, Henning Meyerhenke
Scaling Betweenness Approximation to Billions of Edges by MPI-based Adaptive Sampling. IPDPS (2020)
Marcelo Fonseca Faraj, Alexander van der Grinten, Henning Meyerhenke, Jesper Larsson Träff, Christian Schulz
High-Quality Hierarchical Process Mapping. CoRR (2020)
Eugenio Angriman, Alexander van der Grinten, Henning Meyerhenke
Local Search for Group Closeness Maximization on Big Graphs. IEEE BigData (2019)
Alexander van der Grinten, Eugenio Angriman, Henning Meyerhenke
Parallel Adaptive Sampling with Almost No Synchronization. Euro-Par (2019)
Alexander van der Grinten, Eugenio Angriman, Henning Meyerhenke
Parallel Adaptive Sampling with almost no Synchronization. CoRR (2019)
Alexander van der Grinten, Henning Meyerhenke
Scaling Betweenness Approximation to Billions of Edges by MPI-based Adaptive Sampling. CoRR (2019)
Eugenio Angriman, Alexander van der Grinten, Moritz von Looz, Henning Meyerhenke, Martin Nöllenburg, Maria Predari, Charilaos Tzovas
Guidelines for Experimental Algorithmics: A Case Study in Network Analysis. Algorithms 12 (7) (2019)
Eugenio Angriman, Alexander van der Grinten, Aleksandar Bojchevski, Daniel Zügner, Stephan Günnemann, Henning Meyerhenke
Group Centrality Maximization for Large-scale Graphs. CoRR (2019)
Oskar Taubert, Ines Reinartz, Henning Meyerhenke, Alexander Schug
diSTruct v1.0: generating biomolecular structures from distance constraints. Bioinform. 35 (24) (2019)
Eugenio Angriman, Alexander van der Grinten, Moritz von Looz, Henning Meyerhenke, Martin Nöllenburg, Maria Predari, Charilaos Tzovas
Guidelines for Experimental Algorithmics in Network Analysis. CoRR (2019)
Eugenio Angriman, Alexander van der Grinten, Henning Meyerhenke
Local Search for Group Closeness Maximization on Big Graphs. CoRR (2019)
Elisabetta Bergamini, Michele Borassi, Pierluigi Crescenzi, Andrea Marino, Henning Meyerhenke
Closeness Centrality Faster in Unweighted Graphs. ACM Trans. Knowl. Discov. Data 13 (5) (2019)
Alexander van der Grinten, Henning Meyerhenke
. DATE (2019)
Patrick Bisenius, Elisabetta Bergamini, Eugenio Angriman, Henning Meyerhenke
Closeness Centrality in Fully-dynamic Graphs. ALENEX (2018)
Henning Meyerhenke, Martin Nöllenburg, Christian Schulz
Drawing Large Graphs by Multilevel Maxent-Stress Optimization. IEEE Trans. Vis. Comput. Graph. 24 (5) (2018)
Henning Meyerhenke, Richard Peng, Ilya Safro
High-Performance Graph Algorithms (Dagstuhl Seminar 18241). Dagstuhl Reports 8 (6) (2018)
Roland Glantz, Maria Predari, Henning Meyerhenke
Topology-induced Enhancement of Mappings. ICPP (2018)
Elisabetta Bergamini, Pierluigi Crescenzi, Gianlorenzo D'Angelo, Henning Meyerhenke, Lorenzo Severini, Yllka Velaj
Improving the Betweenness Centrality of a Node by Adding Links. ACM J. Exp. Algorithmics 23 (2018)
Alexander van der Grinten, Elisabetta Bergamini, Oded Green, David A. Bader, Henning Meyerhenke
Scalable Katz Ranking Computation in Large Static and Dynamic Graphs. ESA (2018)
Roland Glantz, Maria Predari, Henning Meyerhenke
Topology-induced Enhancement of Mappings. CoRR (2018)
Moritz von Looz, Henning Meyerhenke
Updating Dynamic Random Hyperbolic Graphs in Sublinear Time. ACM J. Exp. Algorithmics 23 (2018)
Roland Glantz, Henning Meyerhenke
Many-to-many Correspondences between Partitions: Introducing a Cut-based Approach. SDM (2018)
Alexander van der Grinten, Elisabetta Bergamini, Oded Green, David A. Bader, Henning Meyerhenke
Scalable Katz Ranking Computation in Large Static and Dynamic Graphs. CoRR (2018)
Elisabetta Bergamini, Tanya Gonser, Henning Meyerhenke
Scaling up Group Closeness Maximization. ALENEX (2018)
Moritz von Looz, Henning Meyerhenke
Updating Dynamic Random Hyperbolic Graphs in Sublinear Time. CoRR (2018)
Moritz von Looz, Charilaos Tzovas, Henning Meyerhenke
Balanced k-means for Parallel Geometric Partitioning. CoRR (2018)
Moritz von Looz, Charilaos Tzovas, Henning Meyerhenke
Balanced k-means for Parallel Geometric Partitioning. ICPP (2018)
Elisabetta Bergamini, Tanya Gonser, Henning Meyerhenke
Scaling up Group Closeness Maximization. CoRR (2017)
Elisabetta Bergamini, Pierluigi Crescenzi, Gianlorenzo D'Angelo, Henning Meyerhenke, Lorenzo Severini, Yllka Velaj
Improving the betweenness centrality of a node by adding links. CoRR (2017)
Michael Wegner, Oskar Taubert, Alexander Schug, Henning Meyerhenke
Maxent-Stress Optimization of 3D Biomolecular Models. ESA (2017)
Raphael Kimmig, Henning Meyerhenke, Darren Strash
Shared Memory Parallel Subgraph Enumeration. CoRR (2017)
Raphael Kimmig, Henning Meyerhenke, Darren Strash
Shared Memory Parallel Subgraph Enumeration. IPDPS Workshops (2017)
Henning Meyerhenke, Peter Sanders, Christian Schulz
Parallel Graph Partitioning for Complex Networks. IEEE Trans. Parallel Distributed Syst. 28 (9) (2017)
Elisabetta Bergamini, Michele Borassi, Pierluigi Crescenzi, Andrea Marino, Henning Meyerhenke
Computing top-k Closeness Centrality Faster in Unweighted Graphs. CoRR (2017)
Patrick Bisenius, Elisabetta Bergamini, Eugenio Angriman, Henning Meyerhenke
Computing Top-k Closeness Centrality in Fully-dynamic Graphs. CoRR (2017)
Elisabetta Bergamini, Henning Meyerhenke, Mark Ortmann, Arie Slobbe
Faster Betweenness Centrality Updates in Evolving Networks. CoRR (2017)
Christian L. Staudt, Michael Hamann, Alexander Gutfraind, Ilya Safro, Henning Meyerhenke
Generating realistic scaled complex networks. Appl. Netw. Sci. 2 (2017)
Elisabetta Bergamini, Henning Meyerhenke, Mark Ortmann, Arie Slobbe
Faster Betweenness Centrality Updates in Evolving Networks. SEA (2017)
Roland Glantz, Henning Meyerhenke
On finding convex cuts in general, bipartite and plane graphs. Theor. Comput. Sci. 695 (2017)
Michael Wegner, Oskar Taubert, Alexander Schug, Henning Meyerhenke
Maxent-Stress Optimization of 3D Biomolecular Models. CoRR (2017)
Michael Hamann, Gerd Lindner, Henning Meyerhenke, Christian L. Staudt, Dorothea Wagner
Structure-preserving sparsification methods for social networks. Soc. Netw. Anal. Min. 6 (1) (2016)
Christian L. Staudt, Henning Meyerhenke
Engineering Parallel Algorithms for Community Detection in Massive Networks. IEEE Trans. Parallel Distributed Syst. 27 (1) (2016)
Michael Hamann, Gerd Lindner, Henning Meyerhenke, Christian L. Staudt, Dorothea Wagner
Structure-Preserving Sparsification Methods for Social Networks. CoRR (2016)
Moritz von Looz, Mario Wolter, Christoph R. Jacob, Henning Meyerhenke
Better partitions of protein graphs for subsystem quantum chemistry. CoRR (2016)
Sebastian Schlag, Vitali Henne, Tobias Heuer, Henning Meyerhenke, Peter Sanders, Christian Schulz
-Level Recursive Bisection. ALENEX (2016)
Moritz von Looz, Mario Wolter, Christoph R. Jacob, Henning Meyerhenke
Better Partitions of Protein Graphs for Subsystem Quantum Chemistry. SEA (2016)
Jannis Koch, Christian L. Staudt, Maximilian Vogel, Henning Meyerhenke
An Empirical Comparison of Big Graph Frameworks in the Context of Network Analysis. CoRR (2016)
Roland Glantz, Henning Meyerhenke, Christian Schulz
Tree-Based Coarsening and Partitioning of Complex Networks. ACM J. Exp. Algorithmics 21 (1) (2016)
Elisabetta Bergamini, Michael Wegner, Dimitar Lukarski, Henning Meyerhenke
Estimating Current-Flow Closeness Centrality with a Multigrid Laplacian Solver. CSC (2016)
Christian L. Staudt, Michael Hamann, Ilya Safro, Alexander Gutfraind, Henning Meyerhenke
Generating Scaled Replicas of Real-World Complex Networks. CoRR (2016)
Elisabetta Bergamini, Michael Wegner, Dimitar Lukarski, Henning Meyerhenke
Estimating Current-Flow Closeness Centrality with a Multigrid Laplacian Solver. CoRR (2016)
Jeremy Kepner, Peter Aaltonen, David A. Bader, Aydin Buluç, Franz Franchetti, John R. Gilbert, Dylan Hutchison, Manoj Kumar, Andrew Lumsdaine, Henning Meyerhenke, Scott McMillan, Carl Yang, John D. Owens, Marcin Zalewski, Timothy G. Mattson, José E. Moreira
Mathematical foundations of the GraphBLAS. HPEC (2016)
Moritz von Looz, Mustafa Özdayi, Sören Laue, Henning Meyerhenke
Generating massive complex networks with hyperbolic geometry faster in practice. CoRR (2016)
Christian L. Staudt, Michael Hamann, Ilya Safro, Alexander Gutfraind, Henning Meyerhenke
Generating Scaled Replicas of Real-World Complex Networks. COMPLEX NETWORKS (2016)
Roland Glantz, Christian L. Staudt, Henning Meyerhenke
Correspondences between partitions. CoRR (2016)
Jannis Koch, Christian L. Staudt, Maximilian Vogel, Henning Meyerhenke
An empirical comparison of Big Graph frameworks in the context of network analysis. Soc. Netw. Anal. Min. 6 (1) (2016)

Henning Meyerhenke.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Henning Meyerhenke