Elisabetta Bergamini

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