Journal Articles by E. Bergamini
Conference Papers
P. Bisenius,
E. Bergamini,
E. Angriman, and
H. Meyerhenke
Computing Top-k Closeness Centrality in Fully-dynamic Graphs
Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments, ALENEX 2018, New Orleans, LA, USA, January 7-8, 2018.,
2018
DOI,
RIS,
BibTex
A. van der Grinten,
E. Bergamini,
O. Green,
D. A. Bader, and
H. Meyerhenke
Scalable Katz Ranking Computation in Large Static and Dynamic Graphs
26th Annual European Symposium on Algorithms, ESA 2018, August 20-22, 2018, Helsinki, Finland,
2018
DOI,
RIS,
BibTex
E. Bergamini,
T. Gonser, and
H. Meyerhenke
Scaling up Group Closeness Maximization
Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments, ALENEX 2018, New Orleans, LA, USA, January 7-8, 2018.,
2018
DOI,
RIS,
BibTex
E. Bergamini,
H. Meyerhenke,
M. Ortmann, and
A. Slobbe
Faster Betweenness Centrality Updates in Evolving Networks
16th International Symposium on Experimental Algorithms, SEA 2017, June 21-23, 2017, London, UK,
2017
DOI,
RIS,
BibTex
E. Bergamini,
M. Borassi,
P. Crescenzi,
A. Marino, and
H. Meyerhenke
Computing Top-k Closeness Centrality Faster in Unweighted Graphs
Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments, ALENEX 2016, Arlington, Virginia, USA, January 10, 2016,
2016
DOI,
RIS,
BibTex
E. Bergamini,
M. Wegner,
D. Lukarski, and
H. Meyerhenke
Estimating Current-Flow Closeness Centrality with a Multigrid Laplacian Solver
2016 Proceedings of the Seventh SIAM Workshop on Combinatorial Scientific Computing, CSC 2016, Albuquerque, New Mexico, USA, October 10-12, 2016.,
2016
DOI,
RIS,
BibTex
E. Bergamini,
H. Meyerhenke, and
C. Staudt
Approximating Betweenness Centrality in Large Evolving Networks
Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments, ALENEX 2015, San Diego, CA, USA, January 5, 2015,
2015
DOI,
RIS,
BibTex