3 citations · 7 across the 32 of their papers we have counts for
9 papers · 1 filter
On the complexity of list -packing for sparse graph classes
Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi +5
The problem of packing as many subgraphs isomorphic to as possible in a graph for a class of graphs is well studied in the literature. Both vertex-d…
Algorithms for Optimally Shifting Intervals under Intersection Graph Models
Nicolás Honorato-Droguett, Kazuhiro Kurita, Tesshu Hanaka +1
We introduce Geometric Graph Edit Distance, a model for modifying geometric intersection graphs by moving objects. The objective is to obtain a graph in a prescribed class while mi…
Structural Parameterizations of Vertex Integrity
Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi +3
The graph parameter vertex integrity measures how vulnerable a graph is to a removal of a small number of vertices. More precisely, a graph with small vertex integrity admits a sma…
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…
Finding a Minimum Spanning Tree with a Small Non-Terminal Set
Tesshu Hanaka, Yasuaki Kobayashi
In this paper, we study the problem of finding a minimum weight spanning tree that contains each vertex in a given subset of vertices as an internal vertex. This probl…