Hirotaka Ono

activity

20202023

collaborators

Showing cs.DSShow all

3 papers · 1 filter

cs.DS2021

Reallocation Problems with Minimum Completion Time

Toshimasa Ishii, Jun Kawahara, Kazuhisa Makino +1

Reallocation scheduling is one of the most fundamental problems in various areas such as supply chain management, logistics, and transportation science. In this paper, we introduce…

cs.DS2020

Computing $L (p, 1)$ -Labeling with Combined Parameters

Tesshu Hanaka, Kazuma Kawai, Hirotaka Ono

Given a graph, an $L (p, 1)$ -labeling of the graph is an assignment $f$ from the vertex set to the set of nonnegative integers such that for any pair of vertices $(u,v),|f (u) - f (v…

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…

Reallocation Problems with Minimum Completion Time

Computing L(p,1)-Labeling with Combined Parameters

Parameterized Complexity of (A,ℓ)-Path Packing

Computing $L (p, 1)$ -Labeling with Combined Parameters

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