18 citations · 32 across the 33 of their papers we have counts for
37 papers
Vertex Cover Interdiction in Bipartite Graphs
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama +2
In the vertex cover interdiction problem, we are given an undirected graph , two integers and and a vertex subset , and we are asked to find a set $X…
PSPACE-Completeness of Multi-Agent Path Finding for Large Agents
Maichi Zhang, Naoyuki Kamiyama, Kanae Yoshiwatari
Multi-Agent Path Finding for Large Agents (LA-MAPF) is a geometric variant of MAPF in which agents are modeled as disks and conflicts are determined by physical overlap in the unde…
Universal Vertices and Saturation Numbers for Disjoint Triangles
Xiaoteng Zhou, Naoyuki Kamiyama
A graph is -saturated if contains no member of , but the addition of any non-edge creates a copy of a member of . For , let $(m+…
Structure-Aware Optimization of Decision Diagrams for Health Guidance via Integer Programming
Nanako Shimaoka, Naoyuki Kamiyama, Shinji Hotta +5
In this paper, we consider a structure-aware optimization problem for decision diagrams used for health guidance. In particular, we focus on decision diagrams that decide to whom p…
Non-uniformly Stable Common Independent Sets
Naoyuki Kamiyama
In this paper, we consider a matroid generalization of the stable matching problem. In particular, we consider the setting where preferences may contain ties. For this generalizati…
The Strongly Stable Roommates Problem and Linear Programming
Naoyuki Kamiyama
The stable roommates problem is a non-bipartite version of the stable matching problem in a bipartite graph. In this paper, we consider the stable roommates problem with ties. In p…