Tatsuya Gima

According to our database, Tatsuya Gima authored at least 13 papers between 2022 and 2025.

Collaborative distances:

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

2025

Dichotomies for tree minor containment with structural parameters.

Tatsuya Gima, Soh Kumabe, Kazuhiro Kurita, Yuto Okada, Yota Otachi

Theor. Comput. Sci., 2025

Structural parameterizations of vertex integrity.

Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Ryota Murai, Hirotaka Ono, Yota Otachi

Theor. Comput. Sci., 2025

An improved spectral lower bound of treewidth.

Tatsuya Gima, Tesshu Hanaka, Kohei Noro, Hirotaka Ono, Yota Otachi

Inf. Process. Lett., 2025

2024

Algorithmic Meta-Theorems for Combinatorial Reconfiguration Revisited.

Tatsuya Gima, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi

Algorithmica, November, 2024

Extended MSO Model Checking via Small Vertex Integrity.

Tatsuya Gima, Yota Otachi

Algorithmica, January, 2024

On a Spectral Lower Bound of Treewidth.

Tatsuya Gima, Tesshu Hanaka, Kohei Noro, Hirotaka Ono, Yota Otachi

IEICE Trans. Inf. Syst., 2024

Computing diverse pair of solutions for tractable SAT.

Tatsuya Gima, Yuni Iwamasa, Yasuaki Kobayashi, Kazuhiro Kurita, Yota Otachi, Rin Saito

CoRR, 2024

On the Complexity of List H-Packing for Sparse Graph Classes.

Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Yota Otachi, Tomohito Shirai, Akira Suzuki, Yuma Tamura, Xiao Zhou

Proceedings of the WALCOM: Algorithms and Computation, 2024

Orientable Burning Number of Graphs.

Julien Courtiel, Paul Dorbec, Tatsuya Gima, Romain Lecoq, Yota Otachi

Proceedings of the WALCOM: Algorithms and Computation, 2024

2023

Minimum Consistent Subset for Trees Revisited.

Hiroki Arimura, Tatsuya Gima, Yasuaki Kobayashi, Hiroomi Nochide, Yota Otachi

CoRR, 2023

Bandwidth Parameterized by Cluster Vertex Deletion Number.

Tatsuya Gima, Eun Jung Kim, Noleen Köhler, Nikolaos Melissinos, Manolis Vasilakis

Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023

2022

Exploring the gap between treedepth and vertex cover through vertex integrity.

Tatsuya Gima, Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yota Otachi

Theor. Comput. Sci., 2022

An Improved Deterministic Parameterized Algorithm for Cactus Vertex Deletion.

Yuuki Aoike, Tatsuya Gima, Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Kazuhiro Kurita, Yota Otachi

Theory Comput. Syst., 2022