3 citations · 7 across the 32 of their papers we have counts for
4 papers · 1 filter
Winner Determination Algorithms for Graph Games with Matching Structures
Tesshu Hanaka, Hironori Kiya, Hirotaka Ono +1
Cram, Domineering, and Arc Kayles are well-studied combinatorial games. They are interpreted as edge-selecting-type games on graphs, and the selected edges during a game form a mat…
Computing Densest -Subgraph with Structural Parameters
Tesshu Hanaka
\textsc{Densest -Subgraph} is the problem to find a vertex subset of size such that the number of edges in the subgraph induced by is maximized. In this paper, we sh…
Hedonic Games and Treewidth Revisited
Tesshu Hanaka, Michael Lampis
We revisit the complexity of the well-studied notion of Additively Separable Hedonic Games (ASHGs). Such games model a basic clustering or coalition formation scenario in which sel…
Frameworks to Design Approximation Algorithms for Finding Diverse Solutions in Combinatorial Problems
Tesshu Hanaka, Masashi Kiyomi, Yasuaki Kobayashi +4
Finding a \emph{single} best solution is the most common objective in combinatorial optimization problems. However, such a single solution may not be applicable to real-world probl…