Yasuaki Kobayashi

collaborators

2 papers

cs.DS2020

Parameterized Complexity of $(A, ℓ)$ -Path Packing

Rémy Belmonte, Tesshu Hanaka, Masaaki Kanzaki +6

Given a graph $G = (V, E)$ , $A \subseteq V$ , and integers $k$ and $ℓ$ , the \textsc{ $(A, ℓ)$ -Path Packing} problem asks to find $k$ vertex-disjoint paths of length $ℓ$ that h…

cs.DS2019

Subgraph Isomorphism on Graph Classes that Exclude a Substructure

Hans L. Bodlaender, Tesshu Hanaka, Yasuaki Kobayashi +4

We study Subgraph Isomorphism on graph classes defined by a fixed forbidden graph. Although there are several ways for forbidding a graph, we observe that it is reasonable to focus…

Parameterized Complexity of (A,ℓ)-Path Packing

Subgraph Isomorphism on Graph Classes that Exclude a Substructure

Parameterized Complexity of $(A, ℓ)$ -Path Packing