research
∙
04/03/2023
Every Author as First Author
We propose a new standard for writing author names on papers and in bibl...
share
research
∙
02/02/2022
Orthogonal Fold Cut
We characterize the shapes that can be produced by "orthogonal fold ...
research
∙
09/09/2021
Any Regular Polyhedron Can Transform to Another by O(1) Refoldings
We show that several classes of polyhedra are joined by a sequence of O(...
research
∙
05/22/2021
Continuous Flattening of All Polyhedral Manifolds using Countably Infinite Creases
We prove that any finite polyhedral manifold in 3D can be continuously f...
research
∙
05/18/2021
Snipperclips: Cutting Tools into Desired Polygons using Themselves
We study Snipperclips, a computer puzzle game whose objective is to crea...
research
∙
09/29/2020
Tetris is NP-hard even with O(1) rows or columns
We prove that the classic falling-block video game Tetris (both survival...
research
∙
07/28/2020
Acutely Triangulated, Stacked, and Very Ununfoldable Polyhedra
We present new examples of topologically convex edge-ununfoldable polyhe...
research
∙
07/17/2020
Escaping a Polygon
Suppose an "escaping" player moves continuously at maximum speed 1 in th...
research
∙
06/01/2020
Negative Instance for the Edge Patrolling Beacon Problem
Can an infinite-strength magnetic beacon always “catch” an iron ball, wh...
research
∙
03/18/2020
Tatamibari is NP-complete
In the Nikoli pencil-and-paper game Tatamibari, a puzzle consists of an ...
research
∙
02/10/2020
Edge Matching with Inequalities, Triangles, Unknown Shape, and Two Players
We analyze the computational complexity of several new variants of edge-...
research
∙
10/22/2019
Folding Polyominoes with Holes into a Cube
When can a polyomino piece of paper be folded into a unit cube? Prior wo...
research
∙
08/21/2019
Existence and hardness of conveyor belts
An open problem of Manuel Abellanas asks whether every set of disjoint c...
research
∙
12/04/2018
Conic Crease Patterns with Reflecting Rule Lines
We characterize when two conic curved creases are compatible with each o...
research
∙
06/14/2018
Losing at Checkers is Hard
We prove computational intractability of variants of checkers: (1) decid...
research
∙
03/03/2018
Path Puzzles: Discrete Tomography with a Path Constraint is Hard
We prove that path puzzles with complete row and column information--or ...
research
∙
12/26/2017