3 citations · 8 across the 6 of their papers we have counts for
11 papers
RePair Grammars are the Smallest Grammars for Fibonacci Words
Takuya Mieno, Shunsuke Inenaga, Takashi Horiyama
Grammar-based compression is a loss-less data compression scheme that represents a given string by a context-free grammar that generates only . While computing the smallest…
Solving Rep-tile by Computers: Performance of Solvers and Analyses of Solutions
Mutsunori Banbara, Kenji Hashimoto, Takashi Horiyama +7
A rep-tile is a polygon that can be dissected into smaller copies (of the same size) of the original polygon. A polyomino is a polygon that is formed by joining one or more unit sq…
Efficient Folding Algorithms for Regular Polyhedra
Tonan Kamata, Akira Kadoguchi, Takashi Horiyama +1
We investigate the folding problem that asks if a polygon P can be folded to a polyhedron Q for given P and Q. Recently, an efficient algorithm for this problem has been developed…
Longest Common Subsequence in Sublinear Space
Masashi Kiyomi, Takashi Horiyama, Yota Otachi
We present the first -space polynomial-time algorithm for computing the length of a longest common subsequence. Given two strings of length , the algorithm runs i…
Compiling Crossing-free Geometric Graphs with Connectivity Constraint for Fast Enumeration, Random Sampling, and Optimization
Yu Nakahata, Takashi Horiyama, Shin-ichi Minato +1
Given points in the plane, we propose algorithms to compile connected crossing-free geometric graphs into directed acyclic graphs (DAGs). The DAGs allow efficient counting, enu…
Geodesic Folding of Tetrahedron
Seri Nishimoto, Takashi Horiyama, Tomohiro Tachi
In this work, we show the geometric properties of a family of polyhedra obtained by folding a regular tetrahedron along regular triangular grids. Each polyhedron is identified by a…