Journal papers

  1. 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 link][📝arXiv]
  2. 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 link][📝arXiv]

Conference papers

  1. *Tatsuya Gima, Yota Otachi. Extended MSO Model Checking via Small Vertex Integrity. The 33rd International Symposium on Algorithms and Computation (ISAAC 2022). Korea. LIPIcs, 248, pp. 20:1–20:15. 2022, Dec. [📕doi link][📝arXiv]
  2. *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. 2022, Sep. [📕doi link][📝arXiv]
  3. *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. 2021, May. [📕doi link][📝arXiv]