Elisabetta Bergamini

Publication Activity (10 Years)

Years Active: 2014-2022
Publications (10 Years): 17

Top Topics

Betweenness Centrality

Network Analysis

Dynamic Networks

Top Venues

ACM J. Exp. Algorithmics

Publications

Alexander van der Grinten, Elisabetta Bergamini, Oded Green, David A. Bader, Henning Meyerhenke
Scalable Katz Ranking Computation in Large Static and Dynamic Graphs. ACM J. Exp. Algorithmics 27 (2022)
Elisabetta Bergamini, Michele Borassi, Pierluigi Crescenzi, Andrea Marino, Henning Meyerhenke
Closeness Centrality Faster in Unweighted Graphs. ACM Trans. Knowl. Discov. Data 13 (5) (2019)
Patrick Bisenius, Elisabetta Bergamini, Eugenio Angriman, Henning Meyerhenke
Closeness Centrality in Fully-dynamic Graphs. ALENEX (2018)
Elisabetta Bergamini, Pierluigi Crescenzi, Gianlorenzo D'Angelo, Henning Meyerhenke, Lorenzo Severini, Yllka Velaj
Improving the Betweenness Centrality of a Node by Adding Links. ACM J. Exp. Algorithmics 23 (2018)
Alexander van der Grinten, Elisabetta Bergamini, Oded Green, David A. Bader, Henning Meyerhenke
Scalable Katz Ranking Computation in Large Static and Dynamic Graphs. ESA (2018)
Alexander van der Grinten, Elisabetta Bergamini, Oded Green, David A. Bader, Henning Meyerhenke
Scalable Katz Ranking Computation in Large Static and Dynamic Graphs. CoRR (2018)
Elisabetta Bergamini, Tanya Gonser, Henning Meyerhenke
Scaling up Group Closeness Maximization. ALENEX (2018)
Elisabetta Bergamini, Tanya Gonser, Henning Meyerhenke
Scaling up Group Closeness Maximization. CoRR (2017)
Elisabetta Bergamini, Pierluigi Crescenzi, Gianlorenzo D'Angelo, Henning Meyerhenke, Lorenzo Severini, Yllka Velaj
Improving the betweenness centrality of a node by adding links. CoRR (2017)
Elisabetta Bergamini, Michele Borassi, Pierluigi Crescenzi, Andrea Marino, Henning Meyerhenke
Computing top-k Closeness Centrality Faster in Unweighted Graphs. CoRR (2017)
Patrick Bisenius, Elisabetta Bergamini, Eugenio Angriman, Henning Meyerhenke
Computing Top-k Closeness Centrality in Fully-dynamic Graphs. CoRR (2017)
Elisabetta Bergamini, Henning Meyerhenke, Mark Ortmann, Arie Slobbe
Faster Betweenness Centrality Updates in Evolving Networks. CoRR (2017)
Elisabetta Bergamini, Henning Meyerhenke, Mark Ortmann, Arie Slobbe
Faster Betweenness Centrality Updates in Evolving Networks. SEA (2017)
Elisabetta Bergamini, Michael Wegner, Dimitar Lukarski, Henning Meyerhenke
Estimating Current-Flow Closeness Centrality with a Multigrid Laplacian Solver. CSC (2016)
Elisabetta Bergamini, Michael Wegner, Dimitar Lukarski, Henning Meyerhenke
Estimating Current-Flow Closeness Centrality with a Multigrid Laplacian Solver. CoRR (2016)
Elisabetta Bergamini, Michele Borassi, Pierluigi Crescenzi, Andrea Marino, Henning Meyerhenke
Closeness Centrality Faster in Unweighted Graphs. ALENEX (2016)
Elisabetta Bergamini, Henning Meyerhenke
Approximating Betweenness Centrality in Fully Dynamic Networks. Internet Math. 12 (5) (2016)
Elisabetta Bergamini, Romina D'Aurizio, Mauro Leoncini, Marco Pellegrini
CNVScan: detecting borderline copy number variations in NGS data via scan statistics. BCB (2015)
Elisabetta Bergamini, Henning Meyerhenke
Fully-Dynamic Approximation of Betweenness Centrality. ESA (2015)
Elisabetta Bergamini, Henning Meyerhenke
Approximating Betweenness Centrality in Fully-dynamic Networks. CoRR (2015)
Elisabetta Bergamini, Henning Meyerhenke, Christian Staudt
Approximating Betweenness Centrality in Large Evolving Networks. ALENEX (2015)
Elisabetta Bergamini, Henning Meyerhenke
Fully-dynamic Approximation of Betweenness Centrality. CoRR (2015)
Elisabetta Bergamini, Henning Meyerhenke, Christian Staudt
Approximating Betweenness Centrality in Large Evolving Networks. CoRR (2014)