A Faster Algorithm for Dominating Set Analyzed by the Potential Method. - Yoichi Iwata (IPEC, 2011)

Linear-time enumeration of maximal K-edge-connected subgraphs in large networks by random contraction. - Takuya Akiba; Yoichi Iwata; Yuichi Yoshida (CIKM, 2013)

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

Fast exact shortest-path distance queries on large networks by pruned landmark labeling. - Takuya Akiba; Yoichi Iwata; Yuichi Yoshida (SIGMOD Conference, 2013)

Exact and Approximation Algorithms for the Maximum Constraint Satisfaction Problem over the Point Algebra. - Yoichi Iwata; Yuichi Yoshida (STACS, 2013)

Fast Shortest-path Distance Queries on Road Networks by Pruned Highway Labeling. - Takuya Akiba; Yoichi Iwata; Ken-ichi Kawarabayashi; Yuki Kawata (ALENEX, 2014)

Linear-Time FPT Algorithms via Network Flow. - Yoichi Iwata; Keigo Oka; Yuichi Yoshida (SODA, 2014)

Fast Dynamic Graph Algorithms for Parameterized Problems. - Yoichi Iwata; Keigo Oka (SWAT, 2014)

Dynamic and historical shortest-path distance queries on large evolving networks by pruned landmark labeling. - Takuya Akiba; Yoichi Iwata; Yuichi Yoshida (WWW, 2014)

Computing Personalized PageRank Quickly by Exploiting Graph Structures. - Takanori Maehara; Takuya Akiba; Yoichi Iwata; Ken-ichi Kawarabayashi (Proc. VLDB Endow., 2014)

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)

On the Equivalence among Problems of Bounded Width. - Yoichi Iwata; Yuichi Yoshida (ESA, 2015)

An Exact Algorithm for Diameters of Large Real Directed Graphs. - Takuya Akiba; Yoichi Iwata; Yuki Kawata (SEA, 2015)

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

Half-integrality, LP-branching, and FPT Algorithms. - Yoichi Iwata; Magnus Wahlström; Yuichi Yoshida (SIAM J. Comput., 2016)

Branch-and-reduce exponential/FPT algorithms in practice: A case study of vertex cover. - Takuya Akiba; Yoichi Iwata (Theor. Comput. Sci., 2016)

Linear-Time Kernelization for Feedback Vertex Set. - Yoichi Iwata (ICALP, 2017)

Linear-Time FPT Algorithms via Half-Integral Non-returning A-path Packing. - Yoichi Iwata; Yutaro Yamaguchi 001; Yuichi Yoshida (CoRR, 2017)

0/1/All CSPs, Half-Integral A-Path Packing, and Linear-Time FPT Algorithms. - Yoichi Iwata; Yutaro Yamaguchi 001; Yuichi Yoshida (FOCS, 2018)

On the Power of Tree-Depth for Fully Polynomial FPT Algorithms. - Yoichi Iwata; Tomoaki Ogasawara; Naoto Ohsaka (STACS, 2018)

Parameterized Algorithms to Compute Ising Partition Function. - Hidefumi Hiraishi; Hiroshi Imai; Yoichi Iwata; Bingkai Lin (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2018)

Separator-Based Pruned Dynamic Programming for Steiner Tree. - Yoichi Iwata; Takuto Shigemura (AAAI, 2019)

Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP. - Édouard Bonnet; Yoichi Iwata; Bart M. P. Jansen; Lukasz Kowalik (ESA, 2019)

Improved Analysis of Highest-Degree Branching for Feedback Vertex Set. - Yoichi Iwata; Yusuke Kobayashi 001 (Algorithmica, 2021)

Finding a Shortest Non-Zero Path in Group-Labeled Graphs. - Yoichi Iwata; Yutaro Yamaguchi 001 (Comb., 2022)

ALE-Bench: A Benchmark for Long-Horizon Objective-Driven Algorithm Engineering. - Yuki Imajuku; Kohki Horie; Yoichi Iwata; Kensho Aoki; Naohiro Takahashi; Takuya Akiba (CoRR, 2025)