Hirotaka Ono — accepted AI-conference papers

2026

Charging Station Placement for Anonymous Mobile Agents: A Parameterized Complexity Perspective

Arun Kumar Das, Tesshu Hanaka, Nikolaos Melissinos, Hirotaka Ono

IJCAI 2026

We study the problem of optimally placing charging stations for a set of k anonymous mobile agents, each of which must reach a distinct terminal. The agents are identical and can travel only up to a given distance r on a single charge. The objective is to find a placement of charging stations so tha

Cited by 0 Scholar ↗

2024

Theoretical Aspects of Generating Instances with Unique Solutions: Pre-assignment Models for Unique Vertex Cover

Takashi Horiyama, Yasuaki Kobayashi, Hirotaka Ono, Kazuhisa Seto, Ryu Suzuki

AAAI 2024technical

The uniqueness of an optimal solution to a combinatorial optimization problem attracts many fields of researchers' attention because it has a wide range of applications, it is related to important classes in computational complexity, and the existence of only one solution is often critical for algor…

Cited by 3 Source ↗PDF ↗Scholar ↗