E. Bergamini, M. Borassi, P. Crescenzi, A. Marino, and H. Meyerhenke
Computing top-k Closeness Centrality Faster in Unweighted Graphs
TKDD, 13(5), 2019
DOI, RIS, BibTex

E. Bergamini, P. Crescenzi, G. D. Angelo, H. Meyerhenke, L. Severini, and Y. Velaj
Improving the Betweenness Centrality of a Node by Adding Links
ACM Journal of Experimental Algorithmics, 23, 2018
URL, RIS, BibTex

E. Bergamini, P. Crescenzi, G. D. Angelo, H. Meyerhenke, L. Severini, and Y. Velaj
Improving the betweenness centrality of a node by adding links
CoRR, 170205284, 2017
arXiv eprint, RIS, BibTex

E. Bergamini, M. Borassi, P. Crescenzi, A. Marino, and H. Meyerhenke
Computing top-k Closeness Centrality Faster in Unweighted Graphs
CoRR, 170401077, 2017
arXiv eprint, 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