3 citations · 3 across the 5 of their papers we have counts for
5 papers
Maximizing Utilitarian and Egalitarian Welfare of Fractional Hedonic Games on Tree-like Graphs
Tesshu Hanaka, Airi Ikeyama, Hirotaka Ono
Fractional hedonic games are coalition formation games where a player's utility is determined by the average value they assign to the members of their coalition. These games are a…
Turning Tiles is PSPACE-complete
Kanae Yoshiwatari, Hironori Kiya, Koki Suetsugu +2
In combinatorial game theory, the winning player for a position in normal play is analyzed and characterized via algebraic operations. Such analyses define a value for each positio…
Solving Distance-constrained Labeling Problems for Small Diameter Graphs via TSP
Tesshu Hanaka, Hirotaka Ono, Kosuke Sugiyama
In this paper, we give a simple polynomial-time reduction of {L(p)-Labeling} on graphs with a small diameter to {Metric (Path) TSP}, which enables us to use numerous results on {(M…
Grouped Domination Parameterized by Vertex Cover, Twin Cover, and Beyond
Tesshu Hanaka, Hirotaka Ono, Yota Otachi +1
A dominating set of graph is called an -grouped dominating set if can be partitioned into such that the size of each unit is and the s…
Computing Diverse Shortest Paths Efficiently: A Theoretical and Experimental Study
Tesshu Hanaka, Yasuaki Kobayashi, Kazuhiro Kurita +2
Finding diverse solutions in combinatorial problems recently has received considerable attention (Baste et al. 2020; Fomin et al. 2020; Hanaka et al. 2021). In this paper we study…