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

Aktuelles / News

Journal papers accepted

  • 24.03.22: Our journal paper A Batch-Dynamic Suitor Algorithm for Approximating Maximum Weighted Matching (authors: Angriman, Boron, Meyerhenke) has been accepted by ACM J. on Experimental Algorithmics (JEA).
  • 15.03.22: Our journal paper The climatic interdependence of extreme-rainfall events around the globe, written as part of a joint PhD supervision with PIK Potsdam (authors: Su, Meyerhenke, Kurths), has been accepted by the journal Chaos.
  • 14.03.22: Our journal paper Scalable Katz Ranking Computation in Large Static and Dynamic Graphs, an extension of the corresponding ESA'18 paper written with US colleagues, has been accepted by ACM J. on Experimental Algorithmics (JEA). Congratulations to all co-authors (van der Grinten, Bergamini, Green, Bader, Meyerhenke)! The paper is also available as preliminary version via ACM.


Paper accepted for IPDPS Workshop GrAPL 2022

  • 13.03.22: Our paper "Interactive Visualization of Protein RINs using NetworKit in the Cloud" has just been accepted for IPDPS workshop on Graphs, Architectures, Programming, and Learning (GrAPL 2022). The work was done together with Leon Franke from the group of Computational and Theoretical Chemistry from University of Konstanz. All authors (E. Angriman, F. Brandt-Tumescheit, L. Franke, A. van der Grinten and H. Meyerhenke) look forward to meeting you (virtually) at the conference workshop.


Eugenio Angriman passed his PhD Defense

  • 14.12.21: Our team member Eugenio Angriman defended his PhD thesis on "Scalable Algorithms for the Analysis of Massive Networks" today. We can announce that he passed (very) successfully! From the whole MACSy group a well-earned "Congratulations!". We wish Eugenio Angriman all the best for his remaining time in our group and his further career.


Paper accepted for BigData 2021

  • 28.10.21: This news is Big(Data)! A new paper has been accepted for this year's BigData 2021 conference. The title is "Tarema: Adaptive Resource Allocation for Scalable Scientific Workflows in Heterogeneous Clusters" and was written by J. Bader, L. Thamsen, S. Kulagina, J. Will, H. Meyerhenke and O. Kao. We look forward to meet you (virtually) at the conference.


Henning Meyerhenke is appointed "Stellvertretender Direktor für Lehre und Studium"

  • 06.10.21: The start of the winter semester 2021/2022 not only marks the (partial) return for study in presence, it is also accompanied by the appointment of Prof. Henning Meyerhenke as new "Stellvertretender Direktor für Lehre und Studium". Congratulations from the team!


Henning Meyerhenke invited speaker for ACDA21

  • 19.07.2021: In addition to our paper for this year's ACDA21, Prof. Henning Meyerhenke is also giving a keynote talk as invited speaker. Since the conference is taking place virtually, you can easily join from 19-21th of July. Head over to the official webpage for more information.


Paper accepted for ACDA21

  • 01.06.2021: SIAM's Activity Group on Applied and Computational Discrete Algorithms (ACDA) has accepted our paper "Fully-dynamic Weighted Matching Approximation in Practice" (authors: E. Angriman, H. Meyerhenke, C. Schulz) for their 2021 conference (ACDA21). Well done!


Paper accepted for Euro-Par'21

  • 30.04.2021: This years Euro-Par'21 (prime European conference covering all flavours of parallel and distributed processing) is not taking place without our research group. Our paper "An MPI-Parallel Algorithm for Mapping Complex Networks onto Hierarchical Architectures." (authors: M. Predari, C. Tzovas, C. Schulz and H. Meyerhenke) was accepted for the conference. Looking forward to the event at the end of August.


Journal paper accepted by JCTC

  • 04.02.2021: Our paper "Systematic partitioning of proteins for quantum-chemical fragmentation methods using graph algorithms" (authors: Wolter, von Looz, Meyerhenke, Jacob), a cooperation with chemists from TU Braunschweig, was accepted for publication by the Journal of Chemical Theory and Computation.


Paper accepted for SDM 2021

  • 22.12.2020: Our paper "New Approximation Algorithms for Forest Closeness Centrality - for Individual Vertices and Vertex Groups" (authors: van der Grinten, Angriman, Predari, Meyerhenke) was selected for publication by SIAM Data Mining 2021. The conference will take place online in spring.


Alexander van der Grinten to receive 3yr DFG Funding

  • 16.12.2020: Alexander van der Grinten's DFG grant proposal Dynamic inexact high-performance algorithms for network centralities and graph embeddings has been approved. He will receive 3 years of funding. The whole MACSy group says: "Congratulations, well done!"



More news in the archive ...