1 citations · 1 across the 6 of their papers we have counts for
6 papers
The Complexity of Boolean Connectivity Problem of -Horn Formulas
Takashi Horiyama, Shoon Mineyoshi, Yuto Okura +2
The Boolean connectivity problem asks whether the set of satisfying assignments of a given Boolean formula forms a connected subgraph in the -dimensional hypercube. This problem…
Hardness of Forcing Unique Perfect Matchings in Bipartite Graphs of Maximum Degree 3
Ryoma Aoshima, Takashi Horiyama, Atsuki Nagao +4
In a graph , a set of edges is called a \emph{forcing set} if there exists a unique perfect matching such that . Similarly, a set of edges is called a…
On gapped repeats in a cyclic Fibonacci word
Takashi Horiyama, Yasuhide Numata, Kazuhisa Seto +1
In this article, we consider the words with cyclic indices. For given , we consider the pair of indices such that the word of length from is equal to the word of…
Online and Offline Algorithms for Counting Distinct Closed Factors via Sliding Suffix Trees
Takuya Mieno, Shun Takahashi, Kazuhisa Seto +1
A string is said to be closed if its length is one, or if it has a non-empty factor that occurs both as a prefix and as a suffix of the string, but does not occur elsewhere. The no…
Shortest cover after edit
Kazuki Mitani, Takuya Mieno, Kazuhisa Seto +1
This paper investigates the (quasi-)periodicity of a string when the string is edited. A string is called a cover (as known as a quasi-period) of a string if each character…
Theoretical Aspects of Generating Instances with Unique Solutions: Pre-assignment Models for Unique Vertex Cover
Takashi Horiyama, Yasuaki Kobayashi, Hirotaka Ono +2
The uniqueness of an optimal solution to a combinatorial optimization problem attracts many fields of researchers' attention because it has a wide range of applications, it is rela…