| Publication | Date of Publication | Type |
|---|
| When Can You Tile an Integer Rectangle with Integer Squares? | 2023-08-29 | Paper |
Negative instance for the edge patrolling beacon problem
(available as arXiv preprint) | 2023-03-31 | Paper |
Rigid flattening of polyhedra with slits
Origami⁶ | 2022-05-24 | Paper |
Locked rigid origami with multiple degrees of freedom
Origami⁶ | 2022-05-24 | 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 |
Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible
Theoretical Computer Science | 2020-09-03 | Paper |
Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible
(available as arXiv preprint) | 2020-08-11 | Paper |
| Escaping a Polygon | 2020-07-17 | Paper |
Flat foldings of plane graphs with prescribed angles and edge lengths
(available as arXiv preprint) | 2019-02-27 | Paper |
Conflict-free coloring of graphs
SIAM Journal on Discrete Mathematics | 2018-11-28 | Paper |
Bumpy pyramid folding
Computational Geometry | 2018-10-31 | Paper |
Three colors suffice: conflict-free coloring of planar graphs
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 |
Free edge lengths in plane graphs
Proceedings of the thirtieth annual symposium on Computational geometry | 2018-04-23 | Paper |
| Who needs crossings? Hardness of plane graph rigidity | 2018-01-30 | Paper |
Rigid Origami Vertices: Conditions and Forcing Sets
(available as arXiv preprint) | 2017-03-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 |
Free edge lengths in plane graphs
Discrete & Computational Geometry | 2015-07-20 | 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 |
| Shape replication through self-assembly and RNase enzymes | 2014-05-22 | Paper |
Hinged dissections exist
Discrete & Computational Geometry | 2012-03-02 | Paper |
Every large point set contains many collinear points or an empty pentagon
Graphs and Combinatorics | 2012-01-24 | Paper |
Every large point set contains many collinear points or an empty pentagon
Graphs and Combinatorics | 2012-01-24 | Paper |
| Complexity of Interlocking Polyominoes | 2011-12-17 | Paper |
Folding equilateral plane graphs
Algorithms and Computation | 2011-12-16 | Paper |
A categorical construction of ultrafilters
Rocky Mountain Journal of Mathematics | 2010-12-21 | Paper |
Configurations of rank-\(40r\) extremal even unimodular lattices \((r=1,2,3)\)
Journal de Théorie des Nombres de Bordeaux | 2009-04-14 | Paper |
Configurations of rank-\(40r\) extremal even unimodular lattices \((r=1,2,3)\)
Journal de Théorie des Nombres de Bordeaux | 2009-04-14 | Paper |
Configurations of rank-\(40r\) extremal even unimodular lattices \((r=1,2,3)\)
Journal de Théorie des Nombres de Bordeaux | 2009-04-14 | Paper |
Hinged dissections exist
Proceedings of the twenty-fourth annual symposium on Computational geometry | 2009-02-12 | Paper |
