Last update: November, 16, 2023

DBLP

Journal papers

  1. Tatsuya Gima, Yota Otachi.
    Extended MSO Model Checking via Small Vertex Integrity.
    Algorithmica, 2023.
    [📕doi][📝arXiv]
  2. Tatsuya Gima, Tesshu Hanaka, Kohei Noro, Hirotaka Ono, Yota Otachi.
    On a spectral lower bound of treewidth.
    IEICE Transactions on Information and Systems, E107-D (in press), 2024.
    [📕doi]
  3. Tatsuya Gima, Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yota Otachi.
    Exploring the Gap Between Treedepth and Vertex Cover Through Vertex Integrity.
    Theoretical Computer Science, 918, pp. 60–76. 2022.
    [📕doi][📝arXiv]
  4. Yuuki Aoike, Tatsuya Gima, Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi, Kazuhiro Kurita, Yota Otachi.
    An improved deterministic parameterized algorithm for cactus vertex deletion.
    Theory of Computing Systems, 66, pp. 502–515. 2022.
    [📕doi][📝arXiv]

Conference papers

  1. Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Yota Otachi, Tomohito Shirai, Akira Suzuki, *Yuma Tamura, Xiao Zhou.
    On the Complexity of List $\mathcal H$-Packing for Sparse Graph Classes.
    The 18th International Conference and Workshops on Algorithms and Computation (WALCOM 2024), Kanazawa, Japan, accepted. March, 2024.
  2. Julien Courtiel, Paul Dorbec, *Tatsuya Gima, Romain Lecoq, Yota Otachi.
    Orientable Burning Number of Graphs.
    The 18th International Conference and Workshops on Algorithms and Computation (WALCOM 2024), Kanazawa, Japan, accepted. March, 2024.
  3. Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, *Ryota Murai, Hirotaka Ono, Yota Otachi.
    Structural Parameterizations of Vertex Integrity.
    The 18th International Conference and Workshops on Algorithms and Computation (WALCOM 2024), Kanazawa, Japan, accepted. March, 2024.
    [📝arXiv]
  4. Tatsuya Gima, Soh Kumabe, Kazuhiro Kurita, *Yuto Okada, Yota Otachi.
    Dichotomies for Tree Minor Containment with Structural Parameters.
    The 18th International Conference and Workshops on Algorithms and Computation (WALCOM 2024), Kanazawa, Japan, accepted. March, 2024.
    [📝arXiv]
  5. Tatsuya Gima, Eun Jung Kim, Noleen Köhler, Nikolaos Melissinos, *Manolis Vasilakis.
    Bandwidth Parameterized by Cluster Vertex Deletion Number.
    The 18th International Symposium on Parameterized and Exact Computation (IPEC 2023), Amsterdam, Netherlands, accepted. September, 2023.
    [📝arXiv]
  6. *Tatsuya Gima, Yota Otachi.
    Extended MSO Model Checking via Small Vertex Integrity.
    The 33rd International Symposium on Algorithms and Computation (ISAAC 2022), Seoul, Korea, LIPIcs, 248, pp. 20:1–20:15. December, 2022.
    [📘doi][📝arXiv]
  7. *Tatsuya Gima, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi.
    Algorithmic Meta-Theorems for Combinatorial Reconfiguration Revisited.
    The 30th Annual European Symposium on Algorithms (ESA 2022), Potsdam, Germany, LIPIcs, 244, pp. 61:1–61:15. September, 2022.
    [📘doi][📝arXiv]
  8. *Tatsuya Gima, Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi, Yota Otachi.
    Exploring the Gap Between Treedepth and Vertex Cover Through Vertex Integrity.
    The 12th International Conference on Algorithms and Complexity (CIAC 2021), Online, LNCS, 12701, pp. 271–285. May, 2021.
    [📘doi][📝arXiv]

Presentations on International Workshops

  1. Hiroki Arimura, Tatsuya Gima, Yasuaki Kobayashi, *Hiroomi Nochide, Yota Otachi.
    Minimum Consistent Subset for Trees Revisited.
    The 23rd Japan-Korea Joint Workshop on Algorithms and Computation (WAAC 2023), Nagoya, Japan, accepted. June, 2023.
  2. *Ryota Murai, Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Hirotaka Ono, Yota Otachi.
    Structural parameterizations of vertex integrity.
    The 23rd Japan-Korea Joint Workshop on Algorithms and Computation (WAAC 2023), Nagoya, Japan, accepted. June, 2023.
  3. Tatsuya Gima, Tesshu Hanaka, *Kohei Noro, Hirotaka Ono, Yota Otachi.
    On a spectral lower bound of treewidth.
    The 23rd Japan-Korea Joint Workshop on Algorithms and Computation (WAAC 2023), Nagoya, Japan, accepted. June, 2023.

Preprint papers

  1. Hiroki Arimura, Tatsuya Gima, Yasuaki Kobayashi, Hiroomi Nochide, Yota Otachi.
    Minimum Consistent Subset for Trees Revisited.
    [📝arXiv]