Tadatoshi Utashima

According to our database, Tadatoshi Utashima authored at least 4 papers between 2019 and 2024.

Collaborative distances:

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

2024

Polynomial-time equivalences and refined algorithms for longest common subsequence variants.

Yuichi Asahiro, Jesper Jansson, Guohui Lin, Eiji Miyano, Hirotaka Ono, Tadatoshi Utashima

Discret. Appl. Math., 2024

2023

Path Cover Problems with Length Cost.

Kenya Kobayashi, Guohui Lin, Eiji Miyano, Toshiki Saitoh, Akira Suzuki, Tadatoshi Utashima, Tsuyoshi Yagita

Algorithmica, November, 2023

2020

Exact algorithms for the repetition-bounded longest common subsequence problem.

Yuichi Asahiro, Jesper Jansson, Guohui Lin, Eiji Miyano, Hirotaka Ono, Tadatoshi Utashima

Theor. Comput. Sci., 2020

2019

Exact Algorithms for the Bounded Repetition Longest Common Subsequence Problem.

Yuichi Asahiro, Jesper Jansson, Guohui Lin, Eiji Miyano, Hirotaka Ono, Tadatoshi Utashima

Proceedings of the Combinatorial Optimization and Applications, 2019