Tatsuya Imai

Publication Activity (10 Years)

Years Active: 2011-2019
Publications (10 Years): 2

Top Topics

Optimal Planning

Iterative Deepening

Heuristic Search

Top Venues

Electron. Colloquium Comput. Complex.

J. Artif. Intell. Res.

Computational Complexity Conference

Publications

Ryo Ashida, Tatsuya Imai, Kotaro Nakagawa, A. Pavan, N. V. Vinodchandran, Osamu Watanabe
A Sublinear-space and Polynomial-time Separator Algorithm for Planar Graphs. Electron. Colloquium Comput. Complex. 26 (2019)
Tatsuya Imai, Osamu Watanabe
Relating Sublinear Space Computability Among Graph Connectivity and Related Problems. SOFSEM (2016)
Tatsuya Imai, Alex Fukunaga
On a Practical, Integer-Linear Programming Model for Delete-Free Tasks and its Use as a Heuristic for Cost-Optimal Planning. J. Artif. Intell. Res. 54 (2015)
Tatsuya Imai, Alex Fukunaga
A Practical, Integer-Linear Programming Model for the Delete-Relaxation in Cost-Optimal Planning. ECAI (2014)
Fan Xie, Martin Müller, Robert Holte, Tatsuya Imai
Type-Based Exploration with Multiple Search Queues for Satisficing Planning. AAAI (2014)
Tatsuya Imai, Kotaro Nakagawa, Aduri Pavan, N. V. Vinodchandran, Osamu Watanabe
An O(n½+∑)-Space and Polynomial-Time Algorithm for Directed Planar Reachability. Computational Complexity Conference (2013)
Akihiro Kishimoto, Rong Zhou, Tatsuya Imai
Diverse Depth-First Search in Satisificing Planning. SOCS (2012)
Tatsuya Imai, Akihiro Kishimoto
A Novel Technique for Avoiding Plateaus of Greedy Best-First Search in Satisficing Planning. SOCS (2011)
Tatsuya Imai, Akihiro Kishimoto
A Novel Technique for Avoiding Plateaus of Greedy Best-First Search in Satisficing Planning. AAAI (2011)