Palindromes are strings that read the same forward and backward. Problem...
Grammar-based compression is a loss-less data compression scheme that
re...
In this paper, we propose a fast method for exactly enumerating a very l...
A rep-tile is a polygon that can be dissected into smaller copies (of th...
We investigate the folding problem that asks if a polygon P can be folde...
We introduce a computational origami problem which we call the segment
f...
We present the first o(n)-space polynomial-time algorithm for
computing ...
Given n points in the plane, we propose algorithms to compile connected
...
In this work, we show the geometric properties of a family of polyhedra
...
Given graphs G and H, we propose a method to implicitly enumerate
topolo...
Unigraphs are graphs uniquely determined by their own degree sequence up...
In this paper, we show that deciding rigid foldability of a given crease...
A cryptarithm is a mathematical puzzle where given an arithmetic equatio...
We investigate the computational complexity of the following problem. We...