Henning Meyerhenke

Affiliations:
  • Humboldt-Universität zu Berlin, Germany
  • University of Cologne, Department of Computer Science, Germany (former)
  • Karlsruhe Institute of Technology, Institute of Theoretical Informatics, Germany (former)
  • University of Paderborn, Department of Computer Science, Germany (former)


According to our database1, Henning Meyerhenke authored at least 97 papers between 2005 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Fully-dynamic Weighted Matching Approximation in Practice.
CoRR, 2021

New Approximation Algorithms for Forest Closeness Centrality - for Individual Vertices and Vertex Groups.
Proceedings of the 2021 SIAM International Conference on Data Mining, 2021

An MPI-based Algorithm for Mapping Complex Networks onto Hierarchical Architectures.
Proceedings of the Euro-Par 2021: Parallel Processing, 2021

Group-Harmonic and Group-Closeness Maximization - Approximation and Engineering.
Proceedings of the Symposium on Algorithm Engineering and Experiments, 2021

2020
Scaling up network centrality computations - A brief overview.
it Inf. Technol., 2020

Combined Centrality Measures for an Improved Characterization of Influence Spreadin Social Networks.
CoRR, 2020

Combined centrality measures for an improved characterization of influence spread in social networks.
J. Complex Networks, 2020

High-Quality Hierarchical Process Mapping.
Proceedings of the 18th International Symposium on Experimental Algorithms, 2020

Scaling Betweenness Approximation to Billions of Edges by MPI-based Adaptive Sampling.
Proceedings of the 2020 IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2020

Distributing Sparse Matrix/Graph Applications in Heterogeneous Clusters - an Experimental Study.
Proceedings of the 27th IEEE International Conference on High Performance Computing, 2020

Approximation of the Diagonal of a Laplacian's Pseudoinverse for Complex Network Analysis.
Proceedings of the 28th Annual European Symposium on Algorithms, 2020

Group Centrality Maximization for Large-scale Graphs.
Proceedings of the Symposium on Algorithm Engineering and Experiments, 2020

2019
Computing top-<i>k</i> Closeness Centrality Faster in Unweighted Graphs.
ACM Trans. Knowl. Discov. Data, 2019

Guidelines for Experimental Algorithmics in Network Analysis.
CoRR, 2019

diSTruct v1.0: generating biomolecular structures from distance constraints.
Bioinform., 2019

Guidelines for Experimental Algorithmics: A Case Study in Network Analysis.
Algorithms, 2019

Parallel Adaptive Sampling with Almost No Synchronization.
Proceedings of the Euro-Par 2019: Parallel Processing, 2019

Scaling up Network Centrality Computations <sup>*</sup>.
Proceedings of the Design, Automation & Test in Europe Conference & Exhibition, 2019

Local Search for Group Closeness Maximization on Big Graphs.
Proceedings of the 2019 IEEE International Conference on Big Data (Big Data), 2019

2018
Benchmarking for Graph Clustering and Partitioning.
Proceedings of the Encyclopedia of Social Network Analysis and Mining, 2nd Edition, 2018

Drawing Large Graphs by Multilevel Maxent-Stress Optimization.
IEEE Trans. Vis. Comput. Graph., 2018

Updating Dynamic Random Hyperbolic Graphs in Sublinear Time.
ACM J. Exp. Algorithmics, 2018

Improving the Betweenness Centrality of a Node by Adding Links.
ACM J. Exp. Algorithmics, 2018

High-Performance Graph Algorithms (Dagstuhl Seminar 18241).
Dagstuhl Reports, 2018

Many-to-many Correspondences between Partitions: Introducing a Cut-based Approach.
Proceedings of the 2018 SIAM International Conference on Data Mining, 2018

Balanced k-means for Parallel Geometric Partitioning.
Proceedings of the 47th International Conference on Parallel Processing, 2018

Topology-induced Enhancement of Mappings.
Proceedings of the 47th International Conference on Parallel Processing, 2018

Scalable Katz Ranking Computation in Large Static and Dynamic Graphs.
Proceedings of the 26th Annual European Symposium on Algorithms, 2018

Computing Top-<i>k</i> Closeness Centrality in Fully-dynamic Graphs.
Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments, 2018

Scaling up Group Closeness Maximization.
Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments, 2018

2017
Parallel Graph Partitioning for Complex Networks.
IEEE Trans. Parallel Distributed Syst., 2017

On finding convex cuts in general, bipartite and plane graphs.
Theor. Comput. Sci., 2017

Computing Top-k Closeness Centrality in Fully-dynamic Graphs.
CoRR, 2017

Computing top-k Closeness Centrality Faster in Unweighted Graphs.
CoRR, 2017

Generating realistic scaled complex networks.
Appl. Netw. Sci., 2017

Faster Betweenness Centrality Updates in Evolving Networks.
Proceedings of the 16th International Symposium on Experimental Algorithms, 2017

Shared Memory Parallel Subgraph Enumeration.
Proceedings of the 2017 IEEE International Parallel and Distributed Processing Symposium Workshops, 2017

Maxent-Stress Optimization of 3D Biomolecular Models.
Proceedings of the 25th Annual European Symposium on Algorithms, 2017

2016
Recent Advances in Graph Partitioning.
Proceedings of the Algorithm Engineering - Selected Results and Surveys, 2016

Engineering Parallel Algorithms for Community Detection in Massive Networks.
IEEE Trans. Parallel Distributed Syst., 2016

An empirical comparison of Big Graph frameworks in the context of network analysis.
Soc. Netw. Anal. Min., 2016

Structure-preserving sparsification methods for social networks.
Soc. Netw. Anal. Min., 2016

NetworKit: A tool suite for large-scale complex network analysis.
Netw. Sci., 2016

Tree-Based Coarsening and Partitioning of Complex Networks.
ACM J. Exp. Algorithmics, 2016

Approximating Betweenness Centrality in Fully Dynamic Networks.
Internet Math., 2016

Partitioning (hierarchically clustered) complex networks via size-constrained graph clustering.
J. Heuristics, 2016

Correspondences between partitions.
CoRR, 2016

Engineering a Combinatorial Laplacian Solver: Lessons Learned.
Algorithms, 2016

Better Partitions of Protein Graphs for Subsystem Quantum Chemistry.
Proceedings of the Experimental Algorithms - 15th International Symposium, 2016

Estimating Current-Flow Closeness Centrality with a Multigrid Laplacian Solver.
Proceedings of the 2016 Proceedings of the Seventh SIAM Workshop on Combinatorial Scientific Computing, 2016

Querying Probabilistic Neighborhoods in Spatial Data Sets Efficiently.
Proceedings of the Combinatorial Algorithms - 27th International Workshop, 2016

Generating massive complex networks with hyperbolic geometry faster in practice.
Proceedings of the 2016 IEEE High Performance Extreme Computing Conference, 2016


Generating Scaled Replicas of Real-World Complex Networks.
Proceedings of the Complex Networks & Their Applications V - Proceedings of the 5th International Workshop on Complex Networks and their Applications (COMPLEX NETWORKS 2016), Milan, Italy, November 30, 2016

<i>k</i>-way Hypergraph Partitioning via <i>n</i>-Level Recursive Bisection.
Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments, 2016

2015
k-way Hypergraph Partitioning via n-Level Recursive Bisection.
CoRR, 2015

Fast generation of dynamic complex networks with underlying hyperbolic geometry.
CoRR, 2015

n-Level Hypergraph Partitioning.
CoRR, 2015

Is Nearly-linear the Same in Theory and Practice? A Case Study with a Combinatorial Laplacian Solver.
Proceedings of the Experimental Algorithms - 14th International Symposium, 2015

Algorithms for Mapping Parallel Processes onto Grid and Torus Architectures.
Proceedings of the 23rd Euromicro International Conference on Parallel, 2015

Generating Random Hyperbolic Graphs in Subquadratic Time.
Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

Graphs, Matrices, and the GraphBLAS: Seven Good Reasons.
Proceedings of the International Conference on Computational Science, 2015

Fully-Dynamic Approximation of Betweenness Centrality.
Proceedings of the Algorithms - ESA 2015, 2015

Structure-Preserving Sparsification of Social Networks.
Proceedings of the 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, 2015

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, 2015

Approximating Betweenness Centrality in Large Evolving Networks.
Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments, 2015

2014
Benchmarking for Graph Clustering and Partitioning.
Encyclopedia of Social Network Analysis and Mining, 2014

High-performance Graph Algorithms and Applications in Computational Science (Dagstuhl Seminar 14461).
Dagstuhl Reports, 2014

NetworKit: An Interactive Tool Suite for High-Performance Network Analysis.
CoRR, 2014

Partitioning Complex Networks via Size-Constrained Clustering.
Proceedings of the Experimental Algorithms - 13th International Symposium, 2014

Detecting communities around seed nodes in complex networks.
Proceedings of the 2014 IEEE International Conference on Big Data, 2014

2013
PASQUAL: Parallel Techniques for Next Generation Genome Sequence Assembly.
IEEE Trans. Parallel Distributed Syst., 2013

Recent Advances in Graph Partitioning.
CoRR, 2013

Engineering High-Performance Community Detection Heuristics for Massive Graphs.
Proceedings of the 42nd International Conference on Parallel Processing, 2013

Topic 12: Theory and Algorithms for Parallel Computation - (Introduction).
Proceedings of the Euro-Par 2013 Parallel Processing, 2013

Finding All Convex Cuts of a Plane Graph in Cubic Time.
Proceedings of the Algorithms and Complexity, 8th International Conference, 2013

2012
Beyond Good Partition Shapes: An Analysis of Diffusive Graph Partitioning.
Algorithmica, 2012

Scalable Multi-threaded Community Detection in Social Networks.
Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium Workshops & PhD Forum, 2012

Analysis of streaming social networks and graphs on multicore architectures.
Proceedings of the 2012 IEEE International Conference on Acoustics, 2012

Topic 12: Theory and Algorithms for Parallel Computation.
Proceedings of the Euro-Par 2012 Parallel Processing - 18th International Conference, 2012

Parallel community detection for massive graphs.
Proceedings of the Graph Partitioning and Graph Clustering, 2012

Shape optimizing load balancing for MPI-parallel adaptive numerical simulations.
Proceedings of the Graph Partitioning and Graph Clustering, 2012

Static and Dynamic Aspects of Scientific Collaboration Networks.
Proceedings of the International Conference on Advances in Social Networks Analysis and Mining, 2012

2011
Tracking Structure of Streaming Social Networks.
Proceedings of the 25th IEEE International Symposium on Parallel and Distributed Processing, 2011

2010
Beyond Good Shapes: Diffusion-Based Graph Partitioning Is Relaxed Cut Optimization.
Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

A distributed diffusive heuristic for clustering a virtual P2P supercomputer.
Proceedings of the 24th IEEE International Symposium on Parallel and Distributed Processing, 2010

On Dynamic Graph Partitioning and Graph Clustering using Diffusion.
Proceedings of the Algorithm Engineering, 27.06. - 02.07.2010, 2010

Realistic Computer Models.
Proceedings of the Algorithm Engineering: Bridging the Gap between Algorithm Theory and Practice [outcome of a Dagstuhl Seminar], 2010

2009
Graph partitioning and disturbed diffusion.
Parallel Comput., 2009

A new diffusion-based multilevel algorithm for computing graph partitions.
J. Parallel Distributed Comput., 2009

Dynamic Load Balancing for Parallel Numerical Simulations Based on Repartitioning with Disturbed Diffusion.
Proceedings of the 15th IEEE International Conference on Parallel and Distributed Systems, 2009

2008
A new diffusion-based multilevel algorithm for computing graph partitions of very high quality.
Proceedings of the 22nd IEEE International Symposium on Parallel and Distributed Processing, 2008

2006
Analyzing Disturbed Diffusion on Networks.
Proceedings of the Algorithms and Computation, 17th International Symposium, 2006

Accelerating shape optimizing load balancing for parallel FEM simulations by algebraic multigrid.
Proceedings of the 20th International Parallel and Distributed Processing Symposium (IPDPS 2006), 2006

A Parallel Shape Optimizing Load Balancer.
Proceedings of the Euro-Par 2006, Parallel Processing, 12th International Euro-Par Conference, Dresden, Germany, August 28, 2006

2005
Constructing higher-order Voronoi diagrams in parallel.
Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005

Balancing Parallel Adaptive FEM Computations by Solving Systems of Linear Equations.
Proceedings of the Euro-Par 2005, Parallel Processing, 11th International Euro-Par Conference, Lisbon, Portugal, August 30, 2005


  Loading...