Tatsuya Imai

According to our database, Tatsuya Imai authored at least 8 papers between 2011 and 2019.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2019

A Sublinear-space and Polynomial-time Separator Algorithm for Planar Graphs.

Ryo Ashida, Tatsuya Imai, Kotaro Nakagawa, A. Pavan, N. V. Vinodchandran, Osamu Watanabe

Electron. Colloquium Comput. Complex., 2019

2016

Relating Sublinear Space Computability Among Graph Connectivity and Related Problems.

Tatsuya Imai, Osamu Watanabe

Proceedings of the SOFSEM 2016: Theory and Practice of Computer Science, 2016

2015

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

2014

A Practical, Integer-Linear Programming Model for the Delete-Relaxation in Cost-Optimal Planning.

Tatsuya Imai, Alex Fukunaga

Proceedings of the ECAI 2014 - 21st European Conference on Artificial Intelligence, 18-22 August 2014, Prague, Czech Republic, 2014

Type-Based Exploration with Multiple Search Queues for Satisficing Planning.

Fan Xie, Martin Müller, Robert Holte, Tatsuya Imai

Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

2013

An O(n½+∑)-Space and Polynomial-Time Algorithm for Directed Planar Reachability.

Tatsuya Imai, Kotaro Nakagawa, Aduri Pavan, N. V. Vinodchandran, Osamu Watanabe

Proceedings of the 28th Conference on Computational Complexity, 2013

2012

Diverse Depth-First Search in Satisificing Planning.

Akihiro Kishimoto, Rong Zhou, Tatsuya Imai

Proceedings of the Fifth Annual Symposium on Combinatorial Search, 2012

2011

A Novel Technique for Avoiding Plateaus of Greedy Best-First Search in Satisficing Planning.

Tatsuya Imai, Akihiro Kishimoto

Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, 2011