Tatsuya Gima

activity

20202026

most citedExtended MSO Model Checking via Small Vertex Integrity

5 citations · 5 across the 15 of their papers we have counts for

collaborators

Showing 2026Show all

3 papers · 1 filter

cs.DS2026

On the Complexity of Forcing and Anti-Forcing Minimum Cuts

Tatsuya Gima, Yasuaki Kobayashi, Hiraku Morimoto +1

For an instance of a combinatorial optimization problem, a \emph{forcing set} is a set of elements such that there is a unique optimal solution including it. Symmetrically, an \emp…

cs.DS2026

Extending Courcelle's Theorem with Optimality Predicates

Tatsuya Gima

Courcelle's theorem and its optimization variants yield fixed-parameter tractable algorithms for a wide range of graph problems on graphs of bounded treewidth or clique-width. Howe…

math.CO2026

Treewidth of the $n \times n$ toroidal grid

Tatsuya Gima, Hiraku Morimoto, Yuto Okada +1

In this paper, we show that the treewidth of the $n \times n$ toroidal grid is $2 n - 1$ for all $n \geq 5$ . This closes the gap between the previously known upper bound of $2 n - 1$ (Ell…

On the Complexity of Forcing and Anti-Forcing Minimum Cuts

Extending Courcelle's Theorem with Optimality Predicates

Treewidth of the n×n toroidal grid

Treewidth of the $n \times n$ toroidal grid