E. Bergamini, M. Borassi, P. Crescenzi, A. Marino, and H. Meyerhenke. {C}omputing top-k {C}loseness {C}entrality {F}aster in {U}nweighted {G}raphs. TKDD, volume 13, issue 5, 2019. E. Bergamini, P. Crescenzi, G. D. Angelo, H. Meyerhenke, L. Severini, and Y. Velaj. {I}mproving the {B}etweenness {C}entrality of a {N}ode by {A}dding {L}inks. ACM Journal of Experimental Algorithmics, volume 23, 2018. E. Bergamini, P. Crescenzi, G. D. Angelo, H. Meyerhenke, L. Severini, and Y. Velaj. {I}mproving the betweenness centrality of a node by adding links. CoRR, volume 170205284, 2017. E. Bergamini, M. Borassi, P. Crescenzi, A. Marino, and H. Meyerhenke. {C}omputing top-k {C}loseness {C}entrality {F}aster in {U}nweighted {G}raphs. CoRR, volume 170401077, 2017. E. Bergamini, M. Borassi, P. Crescenzi, A. Marino, and H. Meyerhenke. {C}omputing {T}op-k {C}loseness {C}entrality {F}aster in {U}nweighted {G}raphs. Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments, ALENEX 2016, Arlington, Virginia, USA, January 10, 2016, 2016.