4 citations · 5 across the 6 of their papers we have counts for
6 papers
An improved spectral lower bound of treewidth
Tatsuya Gima, Tesshu Hanaka, Kohei Noro +2
We show that for every -vertex graph with at least one edge, its treewidth is greater than or equal to , where and are the maximum degree a…
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…
Reconfiguration of Cliques in a Graph
Takehiro Ito, Hirotaka Ono, Yota Otachi
We study reconfiguration problems for cliques in a graph, which determine whether there exists a sequence of cliques that transforms a given clique into another one in a step-by-st…
Linear-Time Algorithm for Sliding Tokens on Trees
Erik D. Demaine, Martin L. Demaine, Eli Fox-Epstein +6
Suppose that we are given two independent sets and of a graph such that , and imagine that a token is placed on each vertex in . Then, the sliding tok…
Fixed-Parameter Tractability of Token Jumping on Planar Graphs
Takehiro Ito, Marcin Kamiński, Hirotaka Ono
Suppose that we are given two independent sets and of a graph such that , and imagine that a token is placed on each vertex in . The token jumping p…