Henning Meyerhenke

Available identifiers

zbMath Open meyerhenke.henningWikidataQ102402818 ScholiaQ102402818MaRDI QIDQ525112

List of research outcomes

Publication	Date of Publication	Type
Generic network sparsification via degree- and subgraph-based edge sampling	2024-07-23	Paper
Estimating current-flow closeness centrality with a multigrid Laplacian solver	2024-05-14	Paper
A Batch-dynamic Suitor Algorithm for Approximating Maximum Weighted Matching	2024-04-14	Paper
Approximation of the Diagonal of a Laplacian’s Pseudoinverse for Complex Network Analysis	2023-02-07	Paper
High-quality hierarchical process mapping	2023-02-07	Paper
Scalable Katz Ranking Computation in Large Static and Dynamic Graphs	2022-09-06	Paper
An MPI-based Algorithm for Mapping Complex Networks onto Hierarchical Architectures	2022-03-31	Paper
Scalable Katz Ranking Computation in Large Static and Dynamic Graphs	2021-08-04	Paper
Approximating Betweenness Centrality in Fully Dynamic Networks	2021-03-26	Paper
Group Centrality Maximization for Large-scale Graphs	2021-01-27	Paper
Group-Harmonic and Group-Closeness Maximization – Approximation and Engineering	2021-01-27	Paper
https://portal.mardi4nfdi.de/entity/Q5111761	2020-05-27	Paper
k-way Hypergraph Partitioning via n-Level Recursive Bisection	2019-09-12	Paper
Approximating Betweenness Centrality in Large Evolving Networks	2019-09-12	Paper
Computing Top-k Closeness Centrality in Fully-dynamic Graphs	2019-09-12	Paper
Computing Top-k Closeness Centrality Faster in Unweighted Graphs	2019-09-12	Paper
Scaling up Group Closeness Maximization	2019-09-12	Paper
Updating Dynamic Random Hyperbolic Graphs in Sublinear Time	2019-03-27	Paper
Engineering a combinatorial Laplacian solver: lessons learned	2019-03-26	Paper
Improving the Betweenness Centrality of a Node by Adding Links	2018-11-20	Paper
https://portal.mardi4nfdi.de/entity/Q4580179	2018-08-13	Paper
On finding convex cuts in general, bipartite and plane graphs	2017-09-13	Paper
Tree-Based Coarsening and Partitioning of Complex Networks	2017-06-16	Paper
Partitioning (hierarchically clustered) complex networks via size-constrained graph clustering	2017-04-28	Paper
Drawing Large Graphs by Multilevel Maxent-Stress Optimization	2017-02-10	Paper
Querying Probabilistic Neighborhoods in Spatial Data Sets Efficiently	2016-09-29	Paper
Generating Random Hyperbolic Graphs in Subquadratic Time	2016-01-11	Paper
Fully-Dynamic Approximation of Betweenness Centrality	2015-11-19	Paper
Disturbed diffusive processes for solving partitioning problems on graphs	2014-10-11	Paper
Recent Advances in Graph Partitioning	2013-11-13	Paper
https://portal.mardi4nfdi.de/entity/Q5298945	2013-06-25	Paper
https://portal.mardi4nfdi.de/entity/Q5298934	2013-06-25	Paper
Finding all convex cuts of a plane graph in cubic time	2013-06-07	Paper
Beyond good partition shapes: an analysis of diffusive graph partitioning	2013-01-28	Paper
Beyond Good Shapes: Diffusion-Based Graph Partitioning Is Relaxed Cut Optimization	2010-12-09	Paper
Analyzing Disturbed Diffusion on Networks	2008-04-24	Paper

Research outcomes over time

This page was built for person: Henning Meyerhenke