Efficient Top-k Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling. - Takuya Akiba; Takanori Hayashi 002; Nozomi Nori; Yoichi Iwata; Yuichi Yoshida (AAAI, 2015)

Fully Dynamic Betweenness Centrality Maintenance on Massive Networks. - Takanori Hayashi 002; Takuya Akiba; Yuichi Yoshida (Proc. VLDB Endow., 2015)

Fully Dynamic Shortest-Path Distance Query Acceleration on Massive Networks. - Takanori Hayashi 002; Takuya Akiba; Ken-ichi Kawarabayashi (CIKM, 2016)

Efficient Algorithms for Spanning Tree Centrality. - Takanori Hayashi 002; Takuya Akiba; Yuichi Yoshida (IJCAI, 2016)