Fast and scalable reachability queries on graphs by pruned labeling with landmarks and paths. - Yosuke Yano; Takuya Akiba; Yoichi Iwata; Yuichi Yoshida (CIKM, 2013)

Coverage centralities for temporal networks. - Taro Takaguchi; Yosuke Yano; Yuichi Yoshida (CoRR, 2015)

Hierarchical and Dynamic k-Path Covers. - Takuya Akiba; Yosuke Yano; Naoto Mizuno (CIKM, 2016)

Cut Tree Construction from Massive Graphs. - Takuya Akiba; Yoichi Iwata; Yosuke Sameshima; Naoto Mizuno; Yosuke Yano (ICDM, 2016)

Compact and Scalable Graph Neighborhood Sketching. - Takuya Akiba; Yosuke Yano (KDD, 2016)