1 citations · 2 across the 4 of their papers we have counts for
8 papers
Finding One Local Optimum Is Easy -- but What About Two?
Yasuaki Kobayashi, Kazuhiro Kurita, Yutaro Yamaguchi
The class PLS (Polynomial Local Search) captures the complexity of finding a solution that is locally optimal and has proven to be an important concept in the theory of local searc…
The Complexity of Maximal Common Subsequence Enumeration
Giovanni Buzzega, Alessio Conte, Yasuaki Kobayashi +2
Frequent pattern mining is widely used to find ``important'' or ``interesting'' patterns in data. While it is not easy to mathematically define such patterns, maximal frequent patt…
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…
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…
Efficient Enumerations for Minimal Multicuts and Multiway Cuts
Kazuhiro Kurita, Yasuaki Kobayashi
Let be an undirected graph and let be a set of terminal pairs. A node/edge multicut is a subset of vertices/edges of whose removal destroy…
An Efficient Algorithm for Enumerating Chordal Bipartite Induced Subgraphs in Sparse Graphs
Kazuhiro Kurita, Kunihiro Wasa, Hiroki Arimura +1
In this paper, we propose a characterization of chordal bipartite graphs and an efficient enumeration algorithm for chordal bipartite induced subgraphs. A chordal bipartite graph i…