Eugenio Angriman

Publication Activity (10 Years)

Years Active: 2017-2022
Publications (10 Years): 23

Top Topics

Interactive Visual

Betweenness Centrality

Network Analysis

Top Venues

Publications

Eugenio Angriman, Fabian Brandt-Tumescheit, Leon Franke, Alexander van der Grinten, Henning Meyerhenke
Interactive Visualization of Protein RINs using NetworKit in the Cloud. IPDPS Workshops (2022)
Eugenio Angriman, Fabian Brandt-Tumescheit, Leon Franke, Alexander van der Grinten, Henning Meyerhenke
Interactive Visualization of Protein RINs using NetworKit in the Cloud. CoRR (2022)
Eugenio Angriman, Alexander van der Grinten, Michael Hamann, Henning Meyerhenke, Manuel Penschuck
Algorithms for Large-scale Network Analysis and the NetworKit Toolkit. CoRR (2022)
Eugenio Angriman, Michal Boron, Henning Meyerhenke
A Batch-dynamic Suitor Algorithm for Approximating Maximum Weighted Matching. ACM J. Exp. Algorithmics 27 (2022)
Alexander van der Grinten, Eugenio Angriman, Maria Predari, Henning Meyerhenke
New Approximation Algorithms for Forest Closeness Centrality - for Individual Vertices and Vertex Groups. CoRR (2021)
Eugenio Angriman, Ruben Becker, Gianlorenzo D'Angelo, Hugo Gilbert, Alexander van der Grinten, Henning Meyerhenke
Group-Harmonic and Group-Closeness Maximization - Approximation and Engineering. ALENEX (2021)
Alexander van der Grinten, Eugenio Angriman, Maria Predari, Henning Meyerhenke
New Approximation Algorithms for Forest Closeness Centrality - for Individual Vertices and Vertex Groups. SDM (2021)
Eugenio Angriman, Henning Meyerhenke, Christian Schulz, Bora Uçar
Fully-dynamic Weighted Matching Approximation in Practice. CoRR (2021)
Eugenio Angriman, Henning Meyerhenke, Christian Schulz, Bora Uçar
Fully-dynamic Weighted Matching Approximation in Practice. ACDA (2021)
Eugenio Angriman, Maria Predari, Alexander van der Grinten, Henning Meyerhenke
Approximation of the Diagonal of a Laplacian's Pseudoinverse for Complex Network Analysis. ESA (2020)
Eugenio Angriman, Maria Predari, Alexander van der Grinten, Henning Meyerhenke
Approximation of the Diagonal of a Laplacian's Pseudoinverse for Complex Network Analysis. CoRR (2020)
Eugenio Angriman, Ruben Becker, Gianlorenzo D'Angelo, Hugo Gilbert, Alexander van der Grinten, Henning Meyerhenke
Group-Harmonic and Group-Closeness Maximization - Approximation and Engineering. CoRR (2020)
Eugenio Angriman, Alexander van der Grinten, Aleksandar Bojchevski, Daniel Zügner, Stephan Günnemann, Henning Meyerhenke
Group Centrality Maximization for Large-scale Graphs. ALENEX (2020)
Alexander van der Grinten, Eugenio Angriman, Henning Meyerhenke
Scaling up network centrality computations - A brief overview. it Inf. Technol. 62 (3-4) (2020)
Eugenio Angriman, Alexander van der Grinten, Henning Meyerhenke
Local Search for Group Closeness Maximization on Big Graphs. IEEE BigData (2019)
Alexander van der Grinten, Eugenio Angriman, Henning Meyerhenke
Parallel Adaptive Sampling with Almost No Synchronization. Euro-Par (2019)
Alexander van der Grinten, Eugenio Angriman, Henning Meyerhenke
Parallel Adaptive Sampling with almost no Synchronization. CoRR (2019)
Eugenio Angriman, Alexander van der Grinten, Moritz von Looz, Henning Meyerhenke, Martin Nöllenburg, Maria Predari, Charilaos Tzovas
Guidelines for Experimental Algorithmics: A Case Study in Network Analysis. Algorithms 12 (7) (2019)
Eugenio Angriman, Alexander van der Grinten, Aleksandar Bojchevski, Daniel Zügner, Stephan Günnemann, Henning Meyerhenke
Group Centrality Maximization for Large-scale Graphs. CoRR (2019)
Eugenio Angriman, Alexander van der Grinten, Moritz von Looz, Henning Meyerhenke, Martin Nöllenburg, Maria Predari, Charilaos Tzovas
Guidelines for Experimental Algorithmics in Network Analysis. CoRR (2019)
Eugenio Angriman, Alexander van der Grinten, Henning Meyerhenke
Local Search for Group Closeness Maximization on Big Graphs. CoRR (2019)
Patrick Bisenius, Elisabetta Bergamini, Eugenio Angriman, Henning Meyerhenke
Closeness Centrality in Fully-dynamic Graphs. ALENEX (2018)
Patrick Bisenius, Elisabetta Bergamini, Eugenio Angriman, Henning Meyerhenke
Computing Top-k Closeness Centrality in Fully-dynamic Graphs. CoRR (2017)