| Fast and scalable reachability queries on graphs by pruned labeling with landmarks and paths Y Yano, T Akiba, Y Iwata, Y Yoshida Proceedings of the 22nd ACM international conference on Information …, 2013 | 89 | 2013 |
| Coverage centralities for temporal networks T Takaguchi, Y Yano, Y Yoshida The European Physical Journal B 89, 1-11, 2016 | 59 | 2016 |
| Compact and scalable graph neighborhood sketching T Akiba, Y Yano Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge …, 2016 | 14 | 2016 |
| Cut tree construction from massive graphs T Akiba, Y Iwata, Y Sameshima, N Mizuno, Y Yano 2016 IEEE 16th International Conference on Data Mining (ICDM), 775-780, 2016 | 12 | 2016 |
| Hierarchical and Dynamic k-Path Covers T Akiba, Y Yano, N Mizuno Proceedings of the 25th ACM International on Conference on Information and …, 2016 | 7 | 2016 |
| Answering Reachability Queries by Extending Pruned BFSs to Paths Y Yano, T Akiba, Y Iwata IEICE Technical Report; IEICE Tech. Rep. 113 (14), 1-8, 2013 | | 2013 |
| Max Cuts in Graphs and Universal Optimization Software, and Benchmark H Imai, Y Yano IEICE Technical Report; IEICE Tech. Rep., 0 | | |
