Hirotaka Ono

activity

20202023

most citedFair Ride Allocation on a Line

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

collaborators

Showing 2020Show all

3 papers · 1 filter

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…

cs.GT2020★ 2 cited

Fair Ride Allocation on a Line

Yuki Amano, Ayumi Igarashi, Yasushi Kawase +2

The airport game is a classical and well-known model of fair cost-sharing for a single facility among multiple agents. This paper extends it to the so-called assignment setting, th…

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

Parameterized Complexity of (A,ℓ)-Path Packing

Fair Ride Allocation on a Line

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

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