E. Angriman, F. Brandt-Tumescheit, L. Franke, A. van der Grinten, and H. Meyerhenke. Interactive Visualization of Protein RINs using NetworKit in the Cloud. CoRR, volume 220301263, 2022.

E. Angriman, H. Meyerhenke, C. Schulz, and B. Uçar. Fully-dynamic Weighted Matching Approximation in Practice. Proceedings of the 2021 {SIAM} Conference on Applied and Computational Discrete Algorithms, {ACDA} 2021, Virtual Conference, July 19-21, 2021, SIAM, pages 32-44, 2021.

E. Angriman, R. Becker, G. D'Angelo, H. Gilbert, A. van der Grinten, and H. Meyerhenke. Group-Harmonic and Group-Closeness Maximization - Approximation and Engineering. Proceedings of the Symposium on Algorithm Engineering and Experiments, {ALENEX} 2021, Virtual Conference, January 10-11, 2021, SIAM, 2021.

A. van der Grinten, E. Angriman, M. Predari, and H. Meyerhenke. New Approximation Algorithms for Forest Closeness Centrality - for Individual Vertices and Vertex Groups. Proceedings of the 2021 {SIAM} International Conference on Data Mining, {SDM} 2021, Virtual Event, April 29 - May 1, 2021, SIAM, 2021.

A. van der Grinten, E. Angriman, M. Predari, and H. Meyerhenke. New Approximation Algorithms for Forest Closeness Centrality - for Individual Vertices and Vertex Groups. CoRR, volume 210106192, 2021.

E. Angriman, H. Meyerhenke, C. Schulz, and B. Uçar. Fully-dynamic Weighted Matching Approximation in Practice. CoRR, volume 210413098, 2021.

E. Angriman, H. Meyerhenke, C. Schulz, and B. Uçar. Fully-dynamic Weighted Matching Approximation in Practice. Proceedings of the 2021 {SIAM} Conference on Applied and Computational Discrete Algorithms, {ACDA} 2021, Virtual Conference, July 19-21, 2021, SIAM, 2021.

E. Angriman, M. Predari, A. van der Grinten, and H. Meyerhenke. Approximation of the Diagonal of a Laplacian's Pseudoinverse for Complex Network Analysis. 28th Annual European Symposium on Algorithms, ESA 2020, September 7-9, 2020, Pisa, Italy (Virtual Conference), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, volume 173, 2020.

A. van der Grinten, E. Angriman, and H. Meyerhenke. Scaling up network centrality computations - {A} brief overview. it Inf. Technol., volume 62, issue 34, 2020.

E. Angriman, A. van der Grinten, A. Bojchevski, D. Zügner, S. Günnemann, and H. Meyerhenke. {G}roup {C}entrality {M}aximization for {L}arge-scale {G}raphs. Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2020, Salt Lake City, UT, USA, January 5-6, 2020, SIAM, 2020.

A. van der Grinten, E. Angriman, and H. Meyerhenke. Parallel Adaptive Sampling with Almost No Synchronization. Euro-Par 2019: Parallel Processing - 25th International Conference on Parallel and Distributed Computing, Göttingen, Germany, August 26-30, 2019, Proceedings, Springer, volume 11725, 2019.

E. Angriman, A. van der Grinten, M. von Looz, H. Meyerhenke, M. Nöllenburg, M. Predari, and C. Tzovas. {G}uidelines for {E}xperimental {A}lgorithmics: {A} Case {S}tudy in {N}etwork {A}nalysis. Algorithms, volume 12, issue 7, 2019.

E. Angriman, A. van der Grinten, and H. Meyerhenke. {L}ocal {S}earch for {G}roup {C}loseness {M}aximization on {B}ig {G}raphs. 2019 IEEE International Conference on Big Data (Big Data), Los Angeles, CA, USA, December 9-12, 2019, IEEE, 2019.

A. van der Grinten, E. Angriman, and H. Meyerhenke. Parallel Adaptive Sampling with almost no Synchronization. CoRR, volume 190309422, 2019.

E. Angriman, A. van der Grinten, M. von Looz, H. Meyerhenke, M. Nöllenburg, M. Predari, and C. Tzovas. Guidelines for Experimental Algorithmics in Network Analysis. CoRR, volume 190404690, 2019.

E. Angriman, A. van der Grinten, A. Bojchevski, D. Zügner, S. Günnemann, and H. Meyerhenke. Group Centrality Maximization for Large-scale Graphs. CoRR, volume 191013874, 2019.

P. Bisenius, E. Bergamini, E. Angriman, and H. Meyerhenke. {C}omputing {T}op-k {C}loseness {C}entrality in {F}ully-dynamic {G}raphs. Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments, ALENEX 2018, New Orleans, LA, USA, January 7-8, 2018., 2018.

P. Bisenius, E. Bergamini, E. Angriman, and H. Meyerhenke. {C}omputing {T}op-k {C}loseness {C}entrality in {F}ully-dynamic {G}raphs. CoRR, volume 171001143, 2017.