Fast exact shortest-path distance queries on large networks by pruned landmark labeling T Akiba, Y Iwata, Y Yoshida Proceedings of the 2013 ACM SIGMOD International Conference on Management of …, 2013 | 474 | 2013 |

Branch-and-reduce exponential/FPT algorithms in practice: A case study of vertex cover T Akiba, Y Iwata Theoretical Computer Science 609, 211-225, 2016 | 167 | 2016 |

Dynamic and historical shortest-path distance queries on large evolving networks by pruned landmark labeling T Akiba, Y Iwata, Y Yoshida Proceedings of the 23rd international conference on World wide web, 237-248, 2014 | 123 | 2014 |

Fast Shortest-path Distance Queries on Road Networks by Pruned Highway Labeling T Akiba, Y Iwata, K Kawarabayashi, Y Kawata Proceedings of the 16th Meeting on Algorithm Engineering and Experiments …, 0 | 123* | |

Computing personalized PageRank quickly by exploiting graph structures T Maehara, T Akiba, Y Iwata, K Kawarabayashi Proceedings of the VLDB Endowment 7 (12), 1023-1034, 2014 | 92 | 2014 |

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 | 88 | 2013 |

Half-integrality, LP-branching, and FPT Algorithms Y Iwata, M Wahlström, Y Yoshida SIAM Journal on Computing 45 (4), 1377-1411, 2016 | 78 | 2016 |

Linear-time FPT algorithms via network flow Y Iwata, K Oka, Y Yoshida Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete …, 2014 | 77 | 2014 |

Linear-time enumeration of maximal k-edge-connected subgraphs in large networks by random contraction T Akiba, Y Iwata, Y Yoshida Proceedings of the 22nd ACM international conference on Information …, 2013 | 71 | 2013 |

A faster algorithm for dominating set analyzed by the potential method Y Iwata International Symposium on Parameterized and Exact Computation, 41-54, 2011 | 58 | 2011 |

Linear-time Kernelization for Feedback Vertex Set Y Iwata arXiv preprint arXiv:1608.01463, 2016 | 52 | 2016 |

Efficient Top-k Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling T Akiba, T Hayashi, N Nori, Y Iwata, Y Yoshida Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015 | 43 | 2015 |

Improved Analysis of Highest-Degree Branching for Feedback Vertex Set Y Iwata, Y Kobayashi arXiv preprint arXiv:1905.12233, 2019 | 36 | 2019 |

On the Power of Tree-Depth for Fully Polynomial FPT Algorithms Y Iwata, T Ogasawara, N Ohsaka arXiv preprint arXiv:1710.04376, 2017 | 33 | 2017 |

0/1/all CSPs, Half-Integral A-path Packing, and Linear-Time FPT Algorithms Y Iwata, Y Yamaguchi, Y Yoshida arXiv preprint arXiv:1704.02700, 2017 | 29* | 2017 |

Calibrating research in program synthesis using 72,000 hours of programmer time T Akiba, K Imajo, H Iwami, Y Iwata, T Kataoka, N Takahashi, M Moskal, ... MSR, Redmond, WA, USA, Tech. Rep, 2013 | 23 | 2013 |

Separator-Based Pruned Dynamic Programming for Steiner Tree Y Iwata, T Shigemura Proceedings of the AAAI Conference on Artificial Intelligence 33, 1520-1527, 2019 | 18 | 2019 |

Fast dynamic graph algorithms for parameterized problems Y Iwata, K Oka Scandinavian Workshop on Algorithm Theory, 241-252, 2014 | 16 | 2014 |

On the Equivalence among Problems of Bounded Width Y Iwata, Y Yoshida Algorithms-ESA 2015, 754-765, 2015 | 13 | 2015 |

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 |