10 citations · 15 across the 9 of their papers we have counts for
17 papers
Independent set reconfiguration on directed graphs
Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi +4
\textsc{Directed Token Sliding} asks, given a directed graph and two sets of pairwise nonadjacent vertices, whether one can reach from one set to the other by repeatedly applying a…
Finding shortest non-separating and non-disconnecting paths
Yasuaki Kobayashi, Shunsuke Nagano, Yota Otachi
For a connected graph and , a non-separating - path is a path between and such that the set of vertices of does not separate , tha…
An Improved Deterministic Parameterized Algorithm for Cactus Vertex Deletion
Yuuki Aoike, Tatsuya Gima, Tesshu Hanaka +5
A cactus is a connected graph that does not contain as a minor. Given a graph and integer , Cactus Vertex Deletion (also known as Diamond Hitting Se…
A Note on Exponential-Time Algorithms for Linearwidth
Yasuaki Kobayashi, Yu Nakahata
In this note, we give an algorithm that computes the linearwidth of input -vertex graphs in time , which improves a trivial -time algorithm, where and $m…
Finding a Maximum Minimal Separator: Graph Classes and Fixed-Parameter Tractability
Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi +1
We study the problem of finding a maximum cardinality minimal separator of a graph. This problem is known to be NP-hard even for bipartite graphs. In this paper, we strengthen this…
Finding Diverse Trees, Paths, and More
Tesshu Hanaka, Yasuaki Kobayashi, Kazuhiro Kurita +1
Mathematical modeling is a standard approach to solve many real-world problems and {\em diversity} of solutions is an important issue, emerging in applying solutions obtained from…