Takehiro Ito

most citedFixed-Parameter Tractability of Token Jumping on Planar Graphs

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

collaborators

Showing cs.DMShow all

3 papers · 1 filter

cs.DM2016

The Complexity of (List) Edge-Coloring Reconfiguration Problem

Hiroki Osawa, Akira Suzuki, Takehiro Ito +1

Let $G$ be a graph such that each edge has its list of available colors, and assume that each list is a subset of the common set consisting of $k$ colors. Suppose that we are given…

cs.DM2014★ 1 cited

Linear-Time Algorithm for Sliding Tokens on Trees

Erik D. Demaine, Martin L. Demaine, Eli Fox-Epstein +6

Suppose that we are given two independent sets $I_{b}$ and $I_{r}$ of a graph such that $∣ I_{b} ∣ = ∣ I_{r} ∣$ , and imagine that a token is placed on each vertex in $I_{b}$ . Then, the sliding tok…

cs.DM2014★ 4 cited

Fixed-Parameter Tractability of Token Jumping on Planar Graphs

Takehiro Ito, Marcin Kamiński, Hirotaka Ono

Suppose that we are given two independent sets $I_{0}$ and $I_{r}$ of a graph such that $∣ I_{0} ∣ = ∣ I_{r} ∣$ , and imagine that a token is placed on each vertex in $I_{0}$ . The token jumping p…