Patrick Bisenius

According to our database, Patrick Bisenius authored at least 3 papers between 2017 and 2022.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2022

Computing Top-k Closeness Centrality in Fully Dynamic Graphs.

Eugenio Angriman, Patrick Bisenius, Elisabetta Bergamini, Henning Meyerhenke

Proceedings of the Massive Graph Analytics, 2022

2018

Computing Top-<i>k</i> Closeness Centrality in Fully-dynamic Graphs.

Patrick Bisenius, Elisabetta Bergamini, Eugenio Angriman, Henning Meyerhenke

Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments, 2018

2017

Computing Top-k Closeness Centrality in Fully-dynamic Graphs.

Patrick Bisenius, Elisabetta Bergamini, Eugenio Angriman, Henning Meyerhenke

CoRR, 2017