3 citations · 7 across the 32 of their papers we have counts for
5 papers · 1 filter
On the complexity of finding a spanning even tree in a graph
Tesshu Hanaka, Yasuaki Kobayashi, Kazuhiro Kurita +4
A tree is said to be even if for every pair of distinct leaves, the length of the unique path between them is even. In this paper we discuss the problem of determining whether an i…
Basis sequence reconfiguration in the union of matroids
Tesshu Hanaka, Yuni Iwamasa, Yasuaki Kobayashi +2
Given a graph and two spanning trees and in , Spanning Tree Reconfiguration asks whether there is a step-by-step transformation from to such that all inter…
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…
Core Stability in Additively Separable Hedonic Games of Low Treewidth
Tesshu Hanaka, Noleen Köhler, Michael Lampis
Additively Separable Hedonic Game (ASHG) are coalition-formation games where we are given a graph whose vertices represent selfish agents and the weight of each edge denot…
Parameterized Vertex Integrity Revisited
Tesshu Hanaka, Michael Lampis, Manolis Vasilakis +1
Vertex integrity is a graph parameter that measures the connectivity of a graph. Informally, its meaning is that a graph has small vertex integrity if it has a small separator whos…