
Solving Reptile by Computers: Performance of Solvers and Analyses of Solutions
A reptile is a polygon that can be dissected into smaller copies (of th...
read it

Efficient Folding Algorithms for Regular Polyhedra
We investigate the folding problem that asks if a polygon P can be folde...
read it

Efficient Segment Folding is Hard
We introduce a computational origami problem which we call the segment f...
read it

Longest Common Subsequence in Sublinear Space
We present the first o(n)space polynomialtime algorithm for computing ...
read it

Compiling Crossingfree Geometric Graphs with Connectivity Constraint for Fast Enumeration, Random Sampling, and Optimization
Given n points in the plane, we propose algorithms to compile connected ...
read it

Geodesic Folding of Tetrahedron
In this work, we show the geometric properties of a family of polyhedra ...
read it

Implicit Enumeration of TopologicalMinorEmbeddings and Its Application to Planar Subgraph Enumeration
Given graphs G and H, we propose a method to implicitly enumerate topolo...
read it

Decomposing a Graph into Unigraphs
Unigraphs are graphs uniquely determined by their own degree sequence up...
read it

Rigid Foldability is NPHard
In this paper, we show that deciding rigid foldability of a given crease...
read it

Enumerating Cryptarithms Using Deterministic Finite Automata
A cryptarithm is a mathematical puzzle where given an arithmetic equatio...
read it

Swapping Colored Tokens on Graphs
We investigate the computational complexity of the following problem. We...
read it
Takashi Horiyama
is this you? claim profile