| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6126509 | 2024-04-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6126516 | 2024-04-09 | Paper |
| Any Platonic solid can transform to another by \(O(1)\) refoldings | 2023-07-12 | Paper |
| Negative instance for the edge patrolling beacon problem | 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 |
| Developing a tetramonohedron with minimum cut length | 2022-10-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5104352 | 2022-09-09 | Paper |
| Rigid flattening of polyhedra with slits | 2022-05-24 | Paper |
| Scaling any surface down to any fraction | 2022-05-24 | Paper |
| Characterization of Curved Creases and Rulings: Design and Analysis of Lens Tessellations | 2022-05-24 | Paper |
| Weaving a uniformly thick sheet from rectangles | 2022-05-24 | Paper |
| On the effects of hierarchical self-assembly for reducing program-size complexity | 2021-11-11 | Paper |
| Continuous flattening of all polyhedral manifolds using countably infinite creases | 2021-09-17 | Paper |
| Snipperclips: cutting tools into desired polygons using themselves | 2021-09-17 | Paper |
| Folding polyominoes with holes into a cube | 2021-01-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5133640 | 2020-11-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5133641 | 2020-11-10 | Paper |
| Existence and hardness of conveyor belts | 2020-11-05 | Paper |
| Universal hinge patterns for folding strips efficiently into any grid polyhedron | 2020-10-23 | Paper |
| Escaping a Polygon | 2020-07-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3295674 | 2020-07-10 | Paper |
| Path puzzles: discrete tomography with a path constraint is hard | 2020-04-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5379516 | 2019-06-12 | Paper |
| Any monotone function is realized by interlocked polygons | 2019-03-26 | Paper |
| Flat foldings of plane graphs with prescribed angles and edge lengths | 2019-02-27 | Paper |
| Folding Polyominoes into (Poly)Cubes | 2018-11-26 | Paper |
| Bumpy pyramid folding | 2018-10-31 | Paper |
| Juggling and Card Shuffling Meet Mathematical Fonts | 2018-10-09 | Paper |
| Universal Shape Replicators via Self-Assembly with Attractive and Repulsive Forces | 2018-07-16 | Paper |
| Continuously Flattening Polyhedra Using Straight Skeletons | 2018-04-23 | Paper |
| Pachinko | 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 | 2017-09-22 | Paper |
| Dissection with the Fewest Pieces is Hard, Even to Approximate | 2017-02-01 | Paper |
| Continuous Flattening of Orthogonal Polyhedra | 2017-02-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2957882 | 2017-01-30 | Paper |
| Algorithms for Designing Pop-Up Cards | 2017-01-30 | Paper |
| FOLDING EQUILATERAL PLANE GRAPHS | 2015-12-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2949117 | 2015-10-07 | Paper |
| Linear-time algorithm for sliding tokens on trees | 2015-09-16 | Paper |
| Polynomial-Time Algorithm for Sliding Tokens on Trees | 2015-09-11 | Paper |
| Fun with fonts: algorithmic typography | 2015-05-26 | Paper |
| Picture-hanging puzzles | 2015-01-21 | Paper |
| Flat Foldings of Plane Graphs with Prescribed Angles and Edge Lengths | 2015-01-07 | Paper |
| One Tile to Rule Them All: Simulating Any Tile Assembly System with a Single Universal Tile | 2014-07-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417689 | 2014-05-22 | Paper |
| UNO is hard, even for a single player | 2014-01-22 | Paper |
| Reprint of: Refold rigidity of convex polyhedra | 2014-01-22 | Paper |
| Variations on Instant Insanity | 2013-09-13 | Paper |
| Refold rigidity of convex polyhedra | 2013-07-31 | Paper |
| GHOST CHIMNEYS | 2013-06-24 | Paper |
| Meshes Preserving Minimum Feature Size | 2013-01-07 | Paper |
| Bounded-degree polyhedronization of point sets | 2012-12-04 | Paper |
| Non-crossing matchings of points with geometric objects | 2012-10-12 | Paper |
| Hinged dissections exist | 2012-03-02 | Paper |
| (Non)Existence of pleated folds: How paper folds between creases | 2012-01-24 | Paper |
| Algorithmic folding complexity | 2012-01-24 | Paper |
| Continuous blooming of convex polyhedra | 2012-01-24 | Paper |
| Folding Equilateral Plane Graphs | 2011-12-16 | Paper |
| Making Polygons by Simple Folds and One Straight Cut | 2011-11-11 | Paper |
| Common Unfoldings of Polyominoes and Polycubes | 2011-11-11 | Paper |
| Algorithms for Solving Rubik’s Cubes | 2011-09-16 | Paper |
| Covering points by disjoint boxes with outliers | 2011-01-21 | Paper |
| Locked and unlocked chains of planar shapes | 2010-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3574138 | 2010-07-09 | Paper |
| Matching Points with Things | 2010-04-27 | Paper |
| Algorithmic Folding Complexity | 2009-12-17 | Paper |
| Folding a Better Checkerboard | 2009-12-17 | Paper |
| Minimal Locked Trees | 2009-10-20 | Paper |
| Wrapping spheres with flat paper | 2009-06-30 | Paper |
| Dynamic ham-sandwich cuts in the plane | 2009-06-18 | Paper |
| Hinged dissections exist | 2009-02-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3601523 | 2009-02-10 | Paper |
| Deflating the Pentagon | 2009-01-13 | Paper |
| Staged self-assembly: nanomanufacture of arbitrary shapes with \(O(1)\) glues | 2008-09-02 | Paper |
| Staged Self-assembly: Nanomanufacture of Arbitrary Shapes with O(1) Glues | 2008-04-04 | Paper |
| Sand drawings and Gaussian graphs§ | 2007-09-12 | Paper |
| Jigsaw puzzles, edge matching, and polyomino packing: Connections and complexity | 2007-07-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3445222 | 2007-06-08 | Paper |
| Morpion solitaire | 2007-02-13 | Paper |
| Puzzles, art, and magic with algorithms | 2007-02-13 | Paper |
| Algorithms and Data Structures | 2006-10-25 | Paper |
| Hinged dissection of polyominoes and polyforms | 2005-08-05 | Paper |
| Solitaire clobber | 2004-10-27 | Paper |
| When can you fold a map? | 2004-10-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4407718 | 2003-11-10 | Paper |
| Palindrome recognition using a multidimensional tape. | 2003-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4778574 | 2002-11-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536356 | 2002-10-13 | Paper |
| A note on reconfiguring tree linkages: Trees can lock | 2002-05-15 | Paper |
| Enumerating foldings and unfoldings between polygons and polytopes | 2002-05-14 | Paper |
| Polygons cuttable by a circular saw | 2002-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4407713 | 2002-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4407717 | 2002-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4504019 | 2000-09-14 | Paper |
| Folding flat silhouettes and wrapping polyhedral packages: New results in computational origami | 2000-06-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252395 | 2000-01-25 | Paper |
