Computing Top-k Closeness Centrality in Fully-dynamic Graphs. - Patrick Bisenius; Elisabetta Bergamini; Eugenio Angriman; Henning Meyerhenke (CoRR, 2017)

Computing Top-k Closeness Centrality in Fully-dynamic Graphs. - Patrick Bisenius; Elisabetta Bergamini; Eugenio Angriman; Henning Meyerhenke (ALENEX, 2018)

Local Search for Group Closeness Maximization on Big Graphs. - Eugenio Angriman; Alexander van der Grinten; Henning Meyerhenke (IEEE BigData, 2019)

Parallel Adaptive Sampling with Almost No Synchronization. - Alexander van der Grinten; Eugenio Angriman; Henning Meyerhenke (Euro-Par, 2019)

Guidelines for Experimental Algorithmics: A Case Study in Network Analysis. - Eugenio Angriman; Alexander van der Grinten; Moritz von Looz; Henning Meyerhenke; Martin Nöllenburg; Maria Predari; Charilaos Tzovas (Algorithms, 2019)

Guidelines for Experimental Algorithmics in Network Analysis. - Eugenio Angriman; Alexander van der Grinten; Moritz von Looz; Henning Meyerhenke; Martin Nöllenburg; Maria Predari; Charilaos Tzovas (CoRR, 2019)

Group Centrality Maximization for Large-scale Graphs. - Eugenio Angriman; Alexander van der Grinten; Aleksandar Bojchevski; Daniel Zügner; Stephan Günnemann; Henning Meyerhenke (ALENEX, 2020)

Approximation of the Diagonal of a Laplacian's Pseudoinverse for Complex Network Analysis. - Eugenio Angriman; Maria Predari; Alexander van der Grinten; Henning Meyerhenke (ESA, 2020)

Scaling up network centrality computations - A brief overview. - Alexander van der Grinten; Eugenio Angriman; Henning Meyerhenke (it Inf. Technol., 2020)

Fully-dynamic Weighted Matching Approximation in Practice. - Eugenio Angriman; Henning Meyerhenke; Christian Schulz 003; Bora Uçar (ACDA, 2021)

Group-Harmonic and Group-Closeness Maximization - Approximation and Engineering. - Eugenio Angriman; Ruben Becker; Gianlorenzo D'Angelo; Hugo Gilbert; Alexander van der Grinten; Henning Meyerhenke (ALENEX, 2021)

New Approximation Algorithms for Forest Closeness Centrality - for Individual Vertices and Vertex Groups. - Alexander van der Grinten; Eugenio Angriman; Maria Predari; Henning Meyerhenke (SDM, 2021)

Computing Top-k Closeness Centrality in Fully Dynamic Graphs. - Eugenio Angriman; Patrick Bisenius; Elisabetta Bergamini; Henning Meyerhenke (Massive Graph Analytics, 2022)

Algorithms for Large-Scale Network Analysis and the NetworKit Toolkit. - Eugenio Angriman; Alexander van der Grinten; Michael Hamann; Henning Meyerhenke; Manuel Penschuck (Algorithms for Big Data, 2022)

Interactive Visualization of Protein RINs using NetworKit in the Cloud. - Eugenio Angriman; Fabian Brandt-Tumescheit; Leon Franke; Alexander van der Grinten; Henning Meyerhenke (IPDPS Workshops, 2022)

Algorithms for Large-scale Network Analysis and the NetworKit Toolkit. - Eugenio Angriman; Alexander van der Grinten; Michael Hamann; Henning Meyerhenke; Manuel Penschuck (CoRR, 2022)

A Batch-dynamic Suitor Algorithm for Approximating Maximum Weighted Matching. - Eugenio Angriman; Michal Boron; Henning Meyerhenke (ACM J. Exp. Algorithmics, 2022)

Scalable Algorithms for the Analysis of Massive Networks - Eugenio Angriman (2022)