Approximating Betweenness Centrality in Large Evolving Networks. - Elisabetta Bergamini; Henning Meyerhenke; Christian Staudt (ALENEX, 2015)

CNVScan: detecting borderline copy number variations in NGS data via scan statistics. - Elisabetta Bergamini; Romina D'Aurizio; Mauro Leoncini; Marco Pellegrini 001 (BCB, 2015)

Fully-Dynamic Approximation of Betweenness Centrality. - Elisabetta Bergamini; Henning Meyerhenke (ESA, 2015)

Estimating Current-Flow Closeness Centrality with a Multigrid Laplacian Solver. - Elisabetta Bergamini; Michael Wegner; Dimitar Lukarski; Henning Meyerhenke (CSC, 2016)

Approximating Betweenness Centrality in Fully Dynamic Networks. - Elisabetta Bergamini; Henning Meyerhenke (Internet Math., 2016)

Faster Betweenness Centrality Updates in Evolving Networks. - Elisabetta Bergamini; Henning Meyerhenke; Mark Ortmann; Arie Slobbe (SEA, 2017)

Computing top-k Closeness Centrality Faster in Unweighted Graphs. - Elisabetta Bergamini; Michele Borassi; Pierluigi Crescenzi; Andrea Marino 001; Henning Meyerhenke (CoRR, 2017)

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

Scaling up Group Closeness Maximization. - Elisabetta Bergamini; Tanya Gonser; Henning Meyerhenke (ALENEX, 2018)

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

Improving the Betweenness Centrality of a Node by Adding Links. - Elisabetta Bergamini; Pierluigi Crescenzi; Gianlorenzo D'Angelo; Henning Meyerhenke; Lorenzo Severini; Yllka Velaj (ACM J. Exp. Algorithmics, 2018)

Algorithms for the Identification of Central Nodes in Large Real-World Networks - Elisabetta Bergamini (2018)

Computing top-k Closeness Centrality Faster in Unweighted Graphs. - Elisabetta Bergamini; Michele Borassi; Pierluigi Crescenzi; Andrea Marino 001; Henning Meyerhenke (ACM Trans. Knowl. Discov. Data, 2019)

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

Scalable Katz Ranking Computation in Large Static and Dynamic Graphs. - Alexander van der Grinten; Elisabetta Bergamini; Oded Green; David A. Bader; Henning Meyerhenke (ACM J. Exp. Algorithmics, 2022)