Contact
- E-Mail: eugenio.angriman@kit.edu
- Office: Room 035, Building 50.34 - Am Fasanengarten 5, KIT Campus Süd
- Telephone: +49 176 28654367
Currently
- Computation of the top k most central nodes of a network
- Recomputation of centrality in dynamic networks
- Centrality approximation
- Developer and mantainer of NetworKit, the high-performance toolkit for network analysis
CV
- since 06/2016: Research assistant in the research group Theoretical Computer Science / Parallel Computing at KIT, supervised by Juniorprof. Dr. H. Meyerhenke
- 10/2014-10/2016: Laurea Magistrale (Master's Degree) in Computer Engineering, Università degli Studi di Padova (Italy)
- 09/2008-10/2011: Laurea Triennale (Bachelor's Degree) in Information Engineering, Università degli Studi di Padova (Italy)
Publications
- P. Bisenius, E. Bergamini, E. Angriman, H. Meyerhenke: Computing Top-k Closeness Centrality in Fully-dynamic Graphs - accepted at ALENEX 2018