| Publication | Date of Publication | Type |
|---|
| Geodesic paths passing through all faces on a polyhedron | 2026-01-28 | Paper |
| Rolling polyhedra on tessellations | 2024-05-16 | Paper |
| Multifold tiles of polyominoes and convex lattice polygons | 2024-04-09 | Paper |
Orthogonal fold \& cut
(available as arXiv preprint) | 2024-04-09 | Paper |
| Orthogonal fold \& cut | 2024-04-09 | Paper |
Any Platonic solid can transform to another by \(O(1)\) refoldings
Computational Geometry | 2023-07-12 | Paper |
Negative instance for the edge patrolling beacon problem
(available as arXiv preprint) | 2023-03-31 | Paper |
| Toward unfolding doubly covered \(n\)-stars | 2023-03-31 | Paper |
| Packing cube nets into rectangles with \(O(1)\) holes | 2023-03-31 | Paper |
| Tatamibari is NP-complete | 2023-02-07 | Paper |
Developing a tetramonohedron with minimum cut length
Computational Geometry | 2022-10-06 | Paper |
Some polycubes have no edge zipper unfolding
(available as arXiv preprint) | 2022-09-09 | Paper |
Rigid flattening of polyhedra with slits
Origami⁶ | 2022-05-24 | Paper |
Characterization of Curved Creases and Rulings: Design and Analysis of Lens Tessellations
(available as arXiv preprint) | 2022-05-24 | Paper |
Scaling any surface down to any fraction
Origami⁶ | 2022-05-24 | Paper |
Weaving a uniformly thick sheet from rectangles
Origami⁶ | 2022-05-24 | Paper |
On the effects of hierarchical self-assembly for reducing program-size complexity
Theoretical Computer Science | 2021-11-11 | Paper |
Snipperclips: cutting tools into desired polygons using themselves
Computational Geometry | 2021-09-17 | Paper |
Continuous flattening of all polyhedral manifolds using countably infinite creases
Computational Geometry | 2021-09-17 | Paper |
Folding polyominoes with holes into a cube
Computational Geometry | 2021-01-07 | Paper |
| Coin-flipping magic | 2020-11-10 | Paper |
| scientific article; zbMATH DE number 7272496 (Why is no real title available?) | 2020-11-10 | Paper |
Existence and hardness of conveyor belts
The Electronic Journal of Combinatorics | 2020-11-05 | Paper |
Universal hinge patterns for folding strips efficiently into any grid polyhedron
Computational Geometry | 2020-10-23 | Paper |
| Escaping a Polygon | 2020-07-17 | Paper |
Conic crease patterns with reflecting rule lines
(available as arXiv preprint) | 2020-07-10 | Paper |
Path puzzles: discrete tomography with a path constraint is hard
Graphs and Combinatorics | 2020-04-03 | Paper |
| A review on curved creases in art, design and mathematics | 2019-06-12 | Paper |
Any monotone function is realized by interlocked polygons
Algorithms | 2019-03-26 | Paper |
Flat foldings of plane graphs with prescribed angles and edge lengths
(available as arXiv preprint) | 2019-02-27 | Paper |
Folding Polyominoes into (Poly)Cubes
International Journal of Computational Geometry & Applications | 2018-11-26 | Paper |
Bumpy pyramid folding
Computational Geometry | 2018-10-31 | Paper |
Juggling and card shuffling meet mathematical fonts
Connections in Discrete Mathematics | 2018-10-09 | Paper |
Universal shape replicators via self-assembly with attractive and repulsive forces
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Continuously flattening polyhedra using straight skeletons
Proceedings of the thirtieth annual symposium on Computational geometry | 2018-04-23 | Paper |
Pachinko
Computational Geometry | 2018-02-19 | Paper |
Pachinko
Computational Geometry | 2018-02-19 | Paper |
| Who needs crossings? Hardness of plane graph rigidity | 2018-01-30 | Paper |
Universal hinge patterns for folding strips efficiently into any grid polyhedron
Lecture Notes in Computer Science | 2017-09-22 | Paper |
Continuous flattening of orthogonal polyhedra
Lecture Notes in Computer Science | 2017-02-01 | Paper |
Dissection with the fewest pieces is hard, even to approximate
Lecture Notes in Computer Science | 2017-02-01 | Paper |
Two hands are better than one (up to constant factors): self-assembly in the 2HAM vs. aTAM
(available as arXiv preprint) | 2017-01-30 | Paper |
| Algorithms for designing pop-up cards | 2017-01-30 | Paper |
Folding equilateral plane graphs
International Journal of Computational Geometry & Applications | 2015-12-22 | Paper |
| Narrow misère dots-and-boxes | 2015-10-07 | Paper |
Linear-time algorithm for sliding tokens on trees
Theoretical Computer Science | 2015-09-16 | Paper |
Polynomial-time algorithm for sliding tokens on trees
Algorithms and Computation | 2015-09-11 | Paper |
Fun with fonts: algorithmic typography
Theoretical Computer Science | 2015-05-26 | Paper |
Picture-hanging puzzles
Theory of Computing Systems | 2015-01-21 | Paper |
Picture-hanging puzzles
Theory of Computing Systems | 2015-01-21 | Paper |
Flat foldings of plane graphs with prescribed angles and edge lengths
Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications | 2015-01-07 | Paper |
One tile to rule them all: simulating any tile assembly system with a single universal tile
Automata, Languages, and Programming | 2014-07-01 | Paper |
| Shape replication through self-assembly and RNase enzymes | 2014-05-22 | Paper |
UNO is hard, even for a single player
Theoretical Computer Science | 2014-01-22 | Paper |
Reprint of: Refold rigidity of convex polyhedra
Computational Geometry | 2014-01-22 | Paper |
Variations on instant insanity
Lecture Notes in Computer Science | 2013-09-13 | Paper |
Refold rigidity of convex polyhedra
Computational Geometry | 2013-07-31 | Paper |
Ghost chimneys
International Journal of Computational Geometry & Applications | 2013-06-24 | Paper |
Meshes preserving minimum feature size
Lecture Notes in Computer Science | 2013-01-07 | Paper |
Bounded-degree polyhedronization of point sets
Computational Geometry | 2012-12-04 | Paper |
Non-crossing matchings of points with geometric objects
Computational Geometry | 2012-10-12 | Paper |
Hinged dissections exist
Discrete & Computational Geometry | 2012-03-02 | Paper |
Algorithmic folding complexity
Graphs and Combinatorics | 2012-01-24 | Paper |
(Non)Existence of pleated folds: How paper folds between creases
Graphs and Combinatorics | 2012-01-24 | Paper |
Continuous blooming of convex polyhedra
Graphs and Combinatorics | 2012-01-24 | Paper |
Folding equilateral plane graphs
Algorithms and Computation | 2011-12-16 | Paper |
Common unfoldings of polyominoes and polycubes
Lecture Notes in Computer Science | 2011-11-11 | Paper |
Making polygons by simple folds and one straight cut
Lecture Notes in Computer Science | 2011-11-11 | Paper |
Algorithms for solving Rubik's cubes
Algorithms – ESA 2011 | 2011-09-16 | Paper |
Covering points by disjoint boxes with outliers
Computational Geometry | 2011-01-21 | Paper |
Locked and unlocked chains of planar shapes
Discrete & Computational Geometry | 2010-09-22 | Paper |
| scientific article; zbMATH DE number 5734572 (Why is no real title available?) | 2010-07-09 | Paper |
Matching points with things
LATIN 2010: Theoretical Informatics | 2010-04-27 | Paper |
Algorithmic folding complexity
Algorithms and Computation | 2009-12-17 | Paper |
Folding a better checkerboard
Algorithms and Computation | 2009-12-17 | Paper |
Minimal Locked Trees
Lecture Notes in Computer Science | 2009-10-20 | Paper |
Wrapping spheres with flat paper
Computational Geometry | 2009-06-30 | Paper |
Dynamic ham-sandwich cuts in the plane
Computational Geometry | 2009-06-18 | Paper |
Hinged dissections exist
Proceedings of the twenty-fourth annual symposium on Computational geometry | 2009-02-12 | Paper |
| scientific article; zbMATH DE number 5506193 (Why is no real title available?) | 2009-02-10 | Paper |
Deflating the Pentagon
Computational Geometry and Graph Theory | 2009-01-13 | Paper |
Staged self-assembly: nanomanufacture of arbitrary shapes with \(O(1)\) glues
Natural Computing | 2008-09-02 | Paper |
Staged Self-assembly: Nanomanufacture of Arbitrary Shapes with O(1) Glues
DNA Computing | 2008-04-04 | Paper |
Sand drawings and Gaussian graphs§
Journal of Mathematics and the Arts | 2007-09-12 | Paper |
Jigsaw puzzles, edge matching, and polyomino packing: Connections and complexity
Graphs and Combinatorics | 2007-07-19 | Paper |
| scientific article; zbMATH DE number 5163271 (Why is no real title available?) | 2007-06-08 | Paper |
Morpion solitaire
Theory of Computing Systems | 2007-02-13 | Paper |
Puzzles, art, and magic with algorithms
Theory of Computing Systems | 2007-02-13 | Paper |
Algorithms and Data Structures
Lecture Notes in Computer Science | 2006-10-25 | Paper |
Hinged dissection of polyominoes and polyforms
Computational Geometry | 2005-08-05 | Paper |
Solitaire clobber
Theoretical Computer Science | 2004-10-27 | Paper |
When can you fold a map?
Computational Geometry | 2004-10-13 | Paper |
| scientific article; zbMATH DE number 1944413 (Why is no real title available?) | 2003-11-10 | Paper |
Palindrome recognition using a multidimensional tape.
Theoretical Computer Science | 2003-08-17 | Paper |
| scientific article; zbMATH DE number 1830752 (Why is no real title available?) | 2002-11-18 | Paper |
| scientific article; zbMATH DE number 1759407 (Why is no real title available?) | 2002-10-13 | Paper |
Locked and unlocked polygonal chains in three dimensions
Discrete & Computational Geometry | 2002-07-22 | Paper |
A note on reconfiguring tree linkages: Trees can lock
Discrete Applied Mathematics | 2002-05-15 | Paper |
Enumerating foldings and unfoldings between polygons and polytopes
Graphs and Combinatorics | 2002-05-14 | Paper |
Polygons cuttable by a circular saw
Computational Geometry | 2002-01-14 | Paper |
| scientific article; zbMATH DE number 1944408 (Why is no real title available?) | 2002-01-01 | Paper |
| scientific article; zbMATH DE number 1944412 (Why is no real title available?) | 2002-01-01 | Paper |
| scientific article; zbMATH DE number 1507294 (Why is no real title available?) | 2000-09-14 | Paper |
Folding flat silhouettes and wrapping polyhedral packages: New results in computational origami
Computational Geometry | 2000-06-05 | Paper |
| scientific article; zbMATH DE number 1305504 (Why is no real title available?) | 2000-01-25 | Paper |
