Direkt zum InhaltDirekt zur SucheDirekt zur Navigation
▼ Zielgruppen ▼

Humboldt-Universität zu Berlin - Mathematisch-Naturwissenschaftliche Fakultät - Modellierung und Analyse komplexer Systeme

Prof. Dr. Henning Meyerhenke


Henning Meyerhenke

Adresse / Mail Address:

Humboldt-Universität zu Berlin
Institut für Informatik
Unter den Linden 6
D-10099 Berlin

Sitz / Visitor Address:

Johann-von-Neumann-Haus
Rudower Chausse 25, Raum III.303
D-12489 Berlin-Adlershof

Telefon / Phone:

+49 30 2093 41220

E-Mail / Email:

meyerhenke (at) hu-berlin.de


Brief Curriculum Vitae

Henning Meyerhenke is Professor of Computer Science at Humboldt-Universität zu Berlin since August 2018. Prior to that, he was Professor at University of Cologne and Assistant Professor at Karlsruhe Institute of Technology, respectively. Henning held postdoctoral positions at Georgia Institute of Technology (Atlanta, USA), NEC Laboratories Europe, and University of Paderborn. He received his Diplom degree in Computer Science from Friedrich-Schiller-University Jena in 2004 and his Ph.D. (with highest distinction) in Computer Science from the University of Paderborn in 2008.

Since his time in Karlsruhe, Henning has acquired significant funding from DFG, BMBF, and MWK Baden-Wuerttemberg. Together with his co-authors, he received the Best Algorithms Paper Award at the 22nd IEEE International Parallel and Distributed Processing Symposium (2008) and the Best Paper Award of the 2015 International Symposium on Foundations and Applications of Big Data Analytics.

Research Interests

Henning Meyerhenke's main research interests concern scalable algorithms for large and complex networked systems, in particular for three application areas:

  • Algorithmic analysis of large complex networks
  • Combinatorial scientific computing
  • Applied optimization for algorithmic problems in the natural sciences

Publications

A nearly complete and reasonably up-to-date list of my publications can be found at DBLP.

Papers recently accepted but not yet in the DBLP list include:

  • E. Angriman, H. Meyerhenke, C. Schulz, B. Uçar: Fully-dynamic Weighted Matching Approximation in Practice. In Proc. SIAM Conference on Applied and Computational Discrete Algorithms (ACDA'21). To appear.
  • M. Predari, C. Tzovas, C. Schulz and H. Meyerhenke: An MPI-Parallel Algorithm for Mapping Complex Networks onto Hierarchical Architectures. In Proc. 27th International European Conference on Parallel and Distributed Computing (Euro-Par'21). To appear.
  • E. Angriman, E. Bergamini, P. Bisenius, H. Meyerhenke: Computing Top-k Closeness Centrality in Fully-dynamic Graphs. To appear in Massive Graph Analytics. Taylor & Francis.
  • M. Wolter, M. von Looz, H. Meyerhenke, C. Jacob: Systematic partitioning of proteins for quantum-chemical fragmentation methods using graph algorithms. To appear in Journal of Chemical Theory and Computation.
    [DOI: 10.1021/acs.jctc.0c01054]
  • A. van der Grinten, E. Angriman, M. Predari, H. Meyerhenke: New Approximation Algorithms for Forest Closeness Centrality -- for Individual Vertices and Vertex Groups. In Proc. 2021 SIAM International Conference on Data Mining (SDM'21). To appear.
  • C. Tzovas, M. Predari, H. Meyerhenke: Distributing Sparse Matrix/Graph Applications in Heterogeneous Clusters - an Experimental Study. In Proc. 27th IEEE Intl. Conf. on High Performance Computing, Data, and Analytics (HiPC 2020).