◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Henning Meyerhenke

59 papers hereh-index 314.1k citations130 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • first author3
  • middle author20
  • last author33

Across the 56 of 59 papers where every author was matched, so the position is known.

fields
  • cs.DS29
  • cs.DC14
  • cs.SI11
  • cs.DM1
  • cs.MS1
  • math.DG1
same name
  • Henning Meyerhenke — 5 papers, h 3
  • Henning Meyerhenke — 2 papers, h 1
  • Henning Meyerhenke — 1 paper
  • Henning Meyerhenke — 1 paper, h 0
  • Henning Meyerhenke — 1 paper, h 2

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20132023
most citedMathematical Foundations of the GraphBLAS

187 citations · 581 across the 39 of their papers we have counts for

collaborators
Showing 2013Show all

4 papers · 1 filter

cs.DS2013★ 63 cited

Recent Advances in Graph Partitioning

Aydin Buluc, Henning Meyerhenke, Ilya Safro +2

We survey recent trends in practical algorithms for balanced graph partitioning together with applications and future research directions.

cs.SI2013★ 8 cited

Static and Dynamic Aspects of Scientific Collaboration Networks

Christian Staudt, Andrea Schumm, Henning Meyerhenke +2

Collaboration networks arise when we map the connections between scientists which are formed through joint publications. These networks thus display the social structure of academi…

cs.DC2013★ 160 cited

Engineering Parallel Algorithms for Community Detection in Massive Networks

Christian L. Staudt, Henning Meyerhenke

The amount of graph-structured data has recently experienced an enormous growth in many applications. To transform such data into useful information, fast analytics algorithms and…

cs.DS2013

Finding all Convex Cuts of a Plane Graph in Polynomial Time

Roland Glantz, Henning Meyerhenke

Convexity is a notion that has been defined for subsets of $\RR^n$ and for subsets of general graphs. A convex cut of a graph G=(V,E) is a 2-partition V1​∪˙V2​=V s…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.