Research assistant in the
research group Parallel Computing at the Institute for Theoretical Computer Science, Karlsruhe Institute of Technology (KIT).
Contact
- E-Mail: elisabetta.bergamini@kit.edu
- Office: Room 029, Building 50.34 - Am Fasanengarten 5, KIT Campus Süd
- Telephone: +49-721-608-41821
Currently
- E. Bergamini, P. Crescenzi, G. D'Angelo, H. Meyerhenke, L. Severini, Y. Velaj: Improving the betweenness centrality of a node by adding links - accepted by ACM Journal of Experimental Algorithms (JEA). To appear.
- Identification of the k most central nodes of a network
- Centrality of groups of nodes
- Influence maximization
- Recomputation of centrality and pairwise distances in dynamic networks
- Centrality approximation in external memory
- Developer of NetworKit, the high-performance toolkit for network analysis
Publications
- E. Bergamini, T. Gonser, H. Meyerhenke: Scaling Up Group Closeness Maximization - accepted at ALENEX 2018.
- P. Bisenius, E. Bergamini, E. Angriman, H. Meyerhenke: Computing Top-k Closeness Centrality in Fully-dynamic Graphs - accepted at ALENEX 2018.
- E. Bergamini, H. Meyerhenke, M. Ortmann, A. Slobbe: Faster Betweenness Centrality Updates in Evolving Networks - accepted at SEA 2017.
- E. Bergamini, M. Wegner, D. Lukarski, H. Meyerhenke: Estimating Current-Flow Closeness Centrality with a Multigrid Laplacian Solver - at CSC 2016.
- E. Bergamini, H. Meyerhenke: Fully-dynamic Approximation of Betweenness Centrality - to appear in Internet Mathematics arXiv.org preprint.
- E. Bergamini, M. Borassi, P. Crescenzi, A. Marino, H. Meyerhenke: Computing Top-k Closeness Centrality Faster in Unweighted Graphs - at ALENEX 2016, January 2016.
- E. Bergamini, H. Meyerhenke: Fully-dynamic Approximation of Betweenness Centrality - at ESA 2015, September 2015 arXiv.org preprint.
- E. Bergamini, R. D'Aurizio, M. Leoncini, M. Pellegrini: CNVScan: detecting borderline copy number variations in NGS data via scan statistics - at ACM-BCB 2015, September 2015 [pdf].
- E. Bergamini, H. Meyerhenke, C.L. Staudt: Approximating Betweenness Centrality in Large Evolving Networks - at ALENEX 15, January 2015 [pdf].
CV
- since 05/2014: Research assistant in the research group Theoretical Computer Science / Parallel Computing at KIT, supervised by Juniorprof. Dr. H. Meyerhenke
- 11/2011-04/2014: Laurea Magistrale (Master's Degree) in Mathematics, Università degli Studi di Modena e Reggio Emilia
- 09/2008-10/2011: Laurea Triennale (Bachelor's Degree) in Computer Science, Università degli Studi di Modena e Reggio Emilia
