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.

P. Bisenius, E. Bergamini, E. Angriman, and H. Meyerhenke. {C}omputing {T}op-k {C}loseness {C}entrality in {F}ully-dynamic {G}raphs. Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments, ALENEX 2018, New Orleans, LA, USA, January 7-8, 2018., 2018.

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.

A. van der Grinten, E. Bergamini, O. Green, D. A. Bader, and H. Meyerhenke. {S}calable {K}atz {R}anking {C}omputation in {L}arge {S}tatic and {D}ynamic {G}raphs. CoRR, volume 180703847, 2018.

A. van der Grinten, E. Bergamini, O. Green, D. A. Bader, and H. Meyerhenke. {S}calable {K}atz {R}anking {C}omputation in {L}arge {S}tatic and {D}ynamic {G}raphs. 26th Annual European Symposium on Algorithms, ESA 2018, August 20-22, 2018, Helsinki, Finland, 2018.

E. Bergamini, T. Gonser, and H. Meyerhenke. {S}caling up {G}roup {C}loseness {M}aximization. Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments, ALENEX 2018, New Orleans, LA, USA, January 7-8, 2018., 2018.

E. Bergamini, H. Meyerhenke, M. Ortmann, and A. Slobbe. {F}aster {B}etweenness {C}entrality {U}pdates in {E}volving {N}etworks. CoRR, volume 170408592, 2017.

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, T. Gonser, and H. Meyerhenke. {S}caling up {G}roup {C}loseness {M}aximization. CoRR, volume 171001144, 2017.

P. Bisenius, E. Bergamini, E. Angriman, and H. Meyerhenke. {C}omputing {T}op-k {C}loseness {C}entrality in {F}ully-dynamic {G}raphs. CoRR, volume 171001143, 2017.

E. Bergamini, H. Meyerhenke, M. Ortmann, and A. Slobbe. {F}aster {B}etweenness {C}entrality {U}pdates in {E}volving {N}etworks. 16th International Symposium on Experimental Algorithms, SEA 2017, June 21-23, 2017, London, UK, 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.

E. Bergamini and H. Meyerhenke. {A}pproximating {B}etweenness {C}entrality in {F}ully {D}ynamic {N}etworks. Internet Mathematics, volume 12, issue 5, 2016.

E. Bergamini, M. Wegner, D. Lukarski, and H. Meyerhenke. {E}stimating {C}urrent-{F}low {C}loseness {C}entrality with a {M}ultigrid {L}aplacian {S}olver. CoRR, volume 160702955, 2016.

E. Bergamini, M. Wegner, D. Lukarski, and H. Meyerhenke. {E}stimating {C}urrent-{F}low {C}loseness {C}entrality with a {M}ultigrid {L}aplacian {S}olver. 2016 Proceedings of the Seventh SIAM Workshop on Combinatorial Scientific Computing, CSC 2016, Albuquerque, New Mexico, USA, October 10-12, 2016., 2016.

E. Bergamini and H. Meyerhenke. {A}pproximating {B}etweenness {C}entrality in {F}ully-dynamic {N}etworks. CoRR, volume 151007971, 2015.

E. Bergamini and H. Meyerhenke. {F}ully-dynamic {A}pproximation of {B}etweenness {C}entrality. CoRR, volume 150407091, 2015.

E. Bergamini and H. Meyerhenke. {F}ully-{D}ynamic {A}pproximation of {B}etweenness {C}entrality. Algorithms - ESA 2015 - 23rd Annual European Symposium, Patras, Greece, September 14-16, 2015, Proceedings, 2015.

E. Bergamini, H. Meyerhenke, and C. Staudt. {A}pproximating {B}etweenness {C}entrality in {L}arge {E}volving {N}etworks. Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments, ALENEX 2015, San Diego, CA, USA, January 5, 2015, 2015.

E. Bergamini, H. Meyerhenke, and C. Staudt. {A}pproximating {B}etweenness {C}entrality in {L}arge {E}volving {N}etworks. CoRR, volume 14096241, 2014.