Elisabetta Bergamini

According to our database, Elisabetta Bergamini authored at least 15 papers between 2015 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

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

Computing Top-k Closeness Centrality in Fully Dynamic Graphs.

Eugenio Angriman, Patrick Bisenius, Elisabetta Bergamini, Henning Meyerhenke

Proceedings of the Massive Graph Analytics, 2022

2019

Computing top-<i>k</i> Closeness Centrality Faster in Unweighted Graphs.

Elisabetta Bergamini, Michele Borassi, Pierluigi Crescenzi, Andrea Marino, Henning Meyerhenke

ACM Trans. Knowl. Discov. Data, 2019

2018

Algorithms for the Identification of Central Nodes in Large Real-World Networks

Elisabetta Bergamini

PhD thesis, 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

Computing Top-<i>k</i> Closeness Centrality in Fully-dynamic Graphs.

Patrick Bisenius, Elisabetta Bergamini, Eugenio Angriman, Henning Meyerhenke

Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments, 2018

Scaling up Group Closeness Maximization.

Elisabetta Bergamini, Tanya Gonser, Henning Meyerhenke

Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments, 2018

2017

Computing Top-k Closeness Centrality in Fully-dynamic Graphs.

Patrick Bisenius, Elisabetta Bergamini, Eugenio Angriman, Henning Meyerhenke

CoRR, 2017

Computing top-k Closeness Centrality Faster in Unweighted Graphs.

Elisabetta Bergamini, Michele Borassi, Pierluigi Crescenzi, Andrea Marino, Henning Meyerhenke

CoRR, 2017

Faster Betweenness Centrality Updates in Evolving Networks.

Elisabetta Bergamini, Henning Meyerhenke, Mark Ortmann, Arie Slobbe

Proceedings of the 16th International Symposium on Experimental Algorithms, 2017

2016

Approximating Betweenness Centrality in Fully Dynamic Networks.

Elisabetta Bergamini, Henning Meyerhenke

Internet Math., 2016

Estimating Current-Flow Closeness Centrality with a Multigrid Laplacian Solver.

Elisabetta Bergamini, Michael Wegner, Dimitar Lukarski, Henning Meyerhenke

Proceedings of the 2016 Proceedings of the Seventh SIAM Workshop on Combinatorial Scientific Computing, 2016

2015

Fully-Dynamic Approximation of Betweenness Centrality.

Elisabetta Bergamini, Henning Meyerhenke

Proceedings of the Algorithms - ESA 2015, 2015

CNVScan: detecting borderline copy number variations in NGS data via scan statistics.

Elisabetta Bergamini, Romina D'Aurizio, Mauro Leoncini, Marco Pellegrini

Proceedings of the 6th ACM Conference on Bioinformatics, 2015

Approximating Betweenness Centrality in Large Evolving Networks.

Elisabetta Bergamini, Henning Meyerhenke, Christian Staudt

Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments, 2015