Henning Meyerhenke

2.5k total citations
54 papers, 619 citations indexed

About

Henning Meyerhenke is a scholar working on Statistical and Nonlinear Physics, Computer Networks and Communications and Artificial Intelligence. According to data from OpenAlex, Henning Meyerhenke has authored 54 papers receiving a total of 619 indexed citations (citations by other indexed papers that have themselves been cited), including 29 papers in Statistical and Nonlinear Physics, 21 papers in Computer Networks and Communications and 20 papers in Artificial Intelligence. Recurrent topics in Henning Meyerhenke's work include Complex Network Analysis Techniques (29 papers), Advanced Graph Neural Networks (13 papers) and Graph Theory and Algorithms (12 papers). Henning Meyerhenke is often cited by papers focused on Complex Network Analysis Techniques (29 papers), Advanced Graph Neural Networks (13 papers) and Graph Theory and Algorithms (12 papers). Henning Meyerhenke collaborates with scholars based in Germany, United States and Netherlands. Henning Meyerhenke's co-authors include Christian Staudt, David A. Bader, Burkhard Monien, Jason Riedy, Thomas Sauerwald, Christian Schulz, Stefan Schamberger, Peter Sanders, David Ediger and Timothy G. Mattson and has published in prestigious journals such as Bioinformatics, ACM Computing Surveys and Information Sciences.

In The Last Decade

Henning Meyerhenke

46 papers receiving 598 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Henning Meyerhenke Germany 15 269 269 185 160 101 54 619
Ali Pınar United States 14 453 1.7× 279 1.0× 252 1.4× 161 1.0× 128 1.3× 42 906
Daniel Chavarría-Miranda United States 14 470 1.7× 184 0.7× 223 1.2× 140 0.9× 92 0.9× 51 782
Jason Riedy United States 11 235 0.9× 185 0.7× 184 1.0× 251 1.6× 23 0.2× 31 604
Kamer Kaya Türkiye 12 260 1.0× 72 0.3× 206 1.1× 108 0.7× 61 0.6× 64 576
M. Kraetzl Australia 11 172 0.6× 105 0.4× 139 0.8× 93 0.6× 66 0.7× 39 448
Ahmet Erdem Sarıyüce United States 13 301 1.1× 433 1.6× 283 1.5× 254 1.6× 18 0.2× 33 693
Wenhao Liu United States 13 80 0.3× 144 0.5× 374 2.0× 469 2.9× 81 0.8× 37 865
George M. Slota United States 11 125 0.5× 80 0.3× 120 0.6× 221 1.4× 30 0.3× 27 346
John Feo United States 15 479 1.8× 91 0.3× 210 1.1× 170 1.1× 65 0.6× 58 758
Lu Zhou China 14 315 1.2× 86 0.3× 395 2.1× 127 0.8× 75 0.7× 60 769

Countries citing papers authored by Henning Meyerhenke

Since Specialization
Citations

This map shows the geographic impact of Henning Meyerhenke's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Henning Meyerhenke with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Henning Meyerhenke more than expected).

Fields of papers citing papers by Henning Meyerhenke

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Henning Meyerhenke. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Henning Meyerhenke. The network helps show where Henning Meyerhenke may publish in the future.

Co-authorship network of co-authors of Henning Meyerhenke

This figure shows the co-authorship network connecting the top 25 collaborators of Henning Meyerhenke. A scholar is included among the top collaborators of Henning Meyerhenke based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Henning Meyerhenke. Henning Meyerhenke is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
2.
Benoît, Anne, et al.. (2025). Carbon-Aware Workflow Scheduling with Fixed Mapping and Deadline Constraint. Repository KITopen (Karlsruhe Institute of Technology). 627–637.
3.
Wang, Ranran, et al.. (2025). Online Popularity Prediction Service via Minimal Substitution Reinforcement Learning for Social Networks. IEEE Transactions on Services Computing. 18(4). 2254–2266.
4.
Mendling, Jan, Henrik Leopold, Henning Meyerhenke, & Benoît Depaire. (2025). Methodology of Algorithm Engineering. ACM Computing Surveys. 58(4). 1–38.
5.
Su, Zhen, Jürgen Kurths, & Henning Meyerhenke. (2024). Generic network sparsification via hybrid edge sampling. Journal of the Franklin Institute. 362(1). 107404–107404.
6.
Su, Zhen, Yang Liu, Jürgen Kurths, & Henning Meyerhenke. (2024). Generic network sparsification via degree- and subgraph-based edge sampling. Information Sciences. 679. 121096–121096. 1 indexed citations
7.
Su, Zhen, Henning Meyerhenke, & Jürgen Kurths. (2022). The climatic interdependence of extreme-rainfall events around the globe. Chaos An Interdisciplinary Journal of Nonlinear Science. 32(4). 43126–43126. 9 indexed citations
8.
Green, Oded, et al.. (2022). Scalable Katz Ranking Computation in Large Static and Dynamic Graphs. ACM Journal of Experimental Algorithmics. 27. 1–16. 3 indexed citations
9.
Meyerhenke, Henning, et al.. (2022). A Batch-dynamic Suitor Algorithm for Approximating Maximum Weighted Matching. ACM Journal of Experimental Algorithmics. 27. 1–41. 1 indexed citations
10.
Çatalyürek, Ümit V., Karen Devine, Henning Meyerhenke, et al.. (2022). More Recent Advances in (Hyper)Graph Partitioning. ACM Computing Surveys. 55(12). 1–38. 28 indexed citations
11.
Meyerhenke, Henning, et al.. (2020). Approximation of the Diagonal of a Laplacian’s Pseudoinverse for Complex Network Analysis. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 1 indexed citations
12.
Meyerhenke, Henning, et al.. (2020). Systematic partitioning of proteins for quantum-chemical fragmentation methods using graph algorithms. arXiv (Cornell University). 6 indexed citations
13.
Meyerhenke, Henning, et al.. (2019). diSTruct v1.0: generating biomolecular structures from distance constraints. Bioinformatics. 35(24). 5337–5338. 3 indexed citations
14.
Borassi, Michele, et al.. (2019). Computing top- k Closeness Centrality Faster in Unweighted Graphs. ACM Transactions on Knowledge Discovery from Data. 13(5). 1–40. 11 indexed citations
15.
Meyerhenke, Henning, et al.. (2019). Guidelines for Experimental Algorithmics: A Case Study in Network Analysis. Algorithms. 12(7). 127–127. 8 indexed citations
16.
Meyerhenke, Henning, et al.. (2017). On finding convex cuts in general, bipartite and plane graphs. Theoretical Computer Science. 695. 54–73.
17.
Staudt, Christian, et al.. (2017). Generating realistic scaled complex networks. Applied Network Science. 2(1). 36–36. 14 indexed citations
18.
Meyerhenke, Henning, et al.. (2016). Faster Incremental All-pairs Shortest Paths. Repository KITopen (Karlsruhe Institute of Technology).
19.
Schlag, Sebastian, et al.. (2015). k-way Hypergraph Partitioning via n-Level Recursive Bisection. 53–67. 27 indexed citations
20.
Staudt, Christian & Henning Meyerhenke. (2013). Engineering High-Performance Community Detection Heuristics for Massive Graphs. 180–189. 34 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026