Tatsuya Gima

According to our database, Tatsuya Gima authored at least 18 papers between 2021 and 2025.

Collaborative distances:

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

2025

Forcing a unique minimum spanning tree and a unique shortest path.

Tatsuya Gima, Yasuaki Kobayashi, Yota Otachi, Takumi Sato

CoRR, September, 2025

Hitting Geodesic Intervals in Structurally Restricted Graphs.

Tatsuya Gima, Yasuaki Kobayashi, Yuto Okada, Yota Otachi, Hayato Takaike

CoRR, September, 2025

Structural Parameterizations of <i>k</i>-Planarity.

Tatsuya Gima, Yasuaki Kobayashi, Yuto Okada

CoRR, June, 2025

An improved spectral lower bound of treewidth.

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

Inf. Process. Lett., 2025

Broadcasting Under Structural Restrictions.

Yudai Egami, Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Michael Lampis, Valia Mitsou, Edouard Nemery, Yota Otachi, Manolis Vasilakis, Daniel Vaz

Proceedings of the 50th International Symposium on Mathematical Foundations of Computer Science, 2025

Courcelle's Theorem for Lipschitz Continuity.

Tatsuya Gima, Soh Kumabe, Yuichi Yoshida

Proceedings of the 33rd Annual European Symposium on Algorithms, 2025

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

Dichotomies for Tree Minor Containment with Structural Parameters.

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

Proceedings of the WALCOM: Algorithms and Computation, 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

Structural Parameterizations of Vertex Integrity.

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

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

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

Extended MSO Model Checking via Small Vertex Integrity.

Tatsuya Gima, Yota Otachi

Proceedings of the 33rd International Symposium on Algorithms and Computation, 2022

Algorithmic Meta-Theorems for Combinatorial Reconfiguration Revisited.

Tatsuya Gima, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi

Proceedings of the 30th Annual European Symposium on Algorithms, 2022

2021

Exploring the Gap Between Treedepth and Vertex Cover Through Vertex Integrity.

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

Proceedings of the Algorithms and Complexity - 12th International Conference, 2021