Given a hypergraph ℋ, the dual hypergraph of ℋ is the
hypergraph of all ...
For a set P of n points in the plane in general position, a non-crossing...
A rep-tile is a polygon that can be dissected into smaller copies (of th...
We prove NP-completeness of Yin-Yang / Shiromaru-Kuromaru pencil-and-pap...
We propose a new kind of sliding-block puzzle, called Gourds, where the
...
A graph G = (V,E) is a double-threshold graph if there exist a
vertex-we...
We consider problems in which a simple path of fixed length, in an undir...
We investigate the computational complexity of the following problem. We...