A Novel Technique for Avoiding Plateaus of Greedy Best-First Search in Satisficing Planning. - Tatsuya Imai; Akihiro Kishimoto (AAAI, 2011)

Diverse Depth-First Search in Satisificing Planning. - Akihiro Kishimoto; Rong Zhou 001; Tatsuya Imai (SOCS, 2012)

An O(n½+∑)-Space and Polynomial-Time Algorithm for Directed Planar Reachability. - Tatsuya Imai; Kotaro Nakagawa; Aduri Pavan; N. V. Vinodchandran; Osamu Watanabe 001 (CCC, 2013)

Type-Based Exploration with Multiple Search Queues for Satisficing Planning. - Fan Xie 001; Martin Müller 003; Robert Holte; Tatsuya Imai (AAAI, 2014)

A Practical, Integer-Linear Programming Model for the Delete-Relaxation in Cost-Optimal Planning. - Tatsuya Imai; Alex Fukunaga (ECAI, 2014)

On a Practical, Integer-Linear Programming Model for Delete-Free Tasks and its Use as a Heuristic for Cost-Optimal Planning. - Tatsuya Imai; Alex Fukunaga (J. Artif. Intell. Res., 2015)

Relating Sublinear Space Computability Among Graph Connectivity and Related Problems. - Tatsuya Imai; Osamu Watanabe 001 (SOFSEM, 2016)

A Sublinear-space and Polynomial-time Separator Algorithm for Planar Graphs. - Ryo Ashida; Tatsuya Imai; Kotaro Nakagawa; A. Pavan 001; N. V. Vinodchandran; Osamu Watanabe 001 (Electron. Colloquium Comput. Complex., 2019)