Martin L. Demaine

According to our database1, Martin L. Demaine authored at least 122 papers between 1998 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Edge Matching with Inequalities, Triangles, Unknown Shape, and Two Players.
CoRR, 2020

2019
Folding Polyominoes with Holes into a Cube.
CoRR, 2019

Existence and hardness of conveyor belts.
CoRR, 2019

Some Polycubes Have No Edge-Unzipping.
CoRR, 2019

2018
An End-to-End Approach to Self-Folding Origami Structures.
IEEE Trans. Robotics, 2018

Flat foldings of plane graphs with prescribed angles and edge lengths.
JoCG, 2018

Folding Polyominoes into (Poly)Cubes.
Int. J. Comput. Geometry Appl., 2018

Conic Crease Patterns with Reflecting Rule Lines.
CoRR, 2018

Losing at Checkers is Hard.
CoRR, 2018

Path Puzzles: Discrete Tomography with a Path Constraint is Hard.
CoRR, 2018

Pachinko.
Comput. Geom., 2018

Bumpy pyramid folding.
Comput. Geom., 2018

2017
Total Tetris: Tetris with Monominoes, Dominoes, Trominoes, Pentominoes, ...
JIP, 2017

Even 1 × n Edge-Matching and Jigsaw Puzzles are Really Hard.
JIP, 2017

Folding and Punching Paper.
JIP, 2017

Unfolding and Dissection of Multiple Cubes, Tetrahedra, and Doubly Covered Squares.
JIP, 2017

Even 1×n Edge-Matching and Jigsaw Puzzles are Really Hard.
CoRR, 2017

Universal Hinge Patterns for Folding Strips Efficiently into Any Grid Polyhedron.
Proceedings of the Algorithms and Data Structures - 15th International Symposium, 2017

Universal Shape Replicators via Self-Assembly with Attractive and Repulsive Forces.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Computing 3SAT on a Fold-and-Cut Machine.
Proceedings of the 29th Canadian Conference on Computational Geometry, 2017

2016
Who Needs Crossings? Hardness of Plane Graph Rigidity.
Proceedings of the 32nd International Symposium on Computational Geometry, 2016

2015
Linear-time algorithm for sliding tokens on trees.
Theor. Comput. Sci., 2015

Fun with fonts: Algorithmic typography.
Theor. Comput. Sci., 2015

Zig-Zag Numberlink is NP-Complete.
JIP, 2015

Characterization of Curved Creases and Rulings: Design and Analysis of Lens Tessellations.
CoRR, 2015

Continuous Flattening of Orthogonal Polyhedra.
Proceedings of the Discrete and Computational Geometry and Graphs - 18th Japan Conference, 2015

Dissection with the Fewest Pieces is Hard, Even to Approximate.
Proceedings of the Discrete and Computational Geometry and Graphs - 18th Japan Conference, 2015

A Dissimilarity Measure for Comparing Origami Crease Patterns.
Proceedings of the ICPRAM 2015, 2015

2014
UNO is hard, even for a single player.
Theor. Comput. Sci., 2014

Picture-Hanging Puzzles.
Theory Comput. Syst., 2014

Covering Folded Shapes.
JoCG, 2014

Computational Complexity of Piano-Hinged Dissections.
IEICE Transactions, 2014

Reprint of: Refold rigidity of convex polyhedra.
Comput. Geom., 2014

Polynomial-Time Algorithm for Sliding Tokens on Trees.
Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

An end-to-end approach to making self-folded 3D surface shapes by uniform heating.
Proceedings of the 2014 IEEE International Conference on Robotics and Automation, 2014

One Tile to Rule Them All: Simulating Any Tile Assembly System with a Single Universal Tile.
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

Continuously Flattening Polyhedra Using Straight Skeletons.
Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

2013
Finding a Hamiltonian Path in a Cube with Specified Turns is Hard.
JIP, 2013

Folding Equilateral Plane graphs.
Int. J. Comput. Geometry Appl., 2013

Refold rigidity of convex polyhedra.
Comput. Geom., 2013

Bounded-degree polyhedronization of point sets.
Comput. Geom., 2013

Non-crossing matchings of points with geometric objects.
Comput. Geom., 2013

Two Hands Are Better Than One (up to constant factors): Self-Assembly In The 2HAM vs. aTAM.
Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013

Algorithms for Designing Pop-Up Cards.
Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013

Zipper Unfoldability of Domes and Prismoids.
Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

Variations on Instant Insanity.
Proceedings of the Space-Efficient Data Structures, 2013

2012
NP-completeness of generalized Kaboozle.
JIP, 2012

Ghost chimneys.
Int. J. Comput. Geometry Appl., 2012

Hinged Dissections Exist.
Discrete & Computational Geometry, 2012

One Tile to Rule Them All: Simulating Any Turing Machine, Tile Assembly System, or Tiling System with a Single Puzzle Piece
CoRR, 2012

Two Hands Are Better Than One (up to constant factors)
CoRR, 2012

Any Monotone Function Is Realized by Interlocked Polygons.
Algorithms, 2012

2011
(Non)Existence of Pleated Folds: How Paper Folds Between Creases.
Graphs and Combinatorics, 2011

Continuous Blooming of Convex Polyhedra.
Graphs and Combinatorics, 2011

Algorithmic Folding Complexity.
Graphs and Combinatorics, 2011

Covering points by disjoint boxes with outliers.
Comput. Geom., 2011

Meshes Preserving Minimum Feature Size.
Proceedings of the Computational Geometry - XIV Spanish Meeting on Computational Geometry, 2011

Algorithms for Solving Rubik's Cubes.
Proceedings of the Algorithms - ESA 2011, 2011

Edge-guarding Orthogonal Polyhedra.
Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

Convexifying Polygons Without Losing Visibilities.
Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

Common Developments of Several Different Orthogonal Boxes.
Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

A Topologically Convex Vertex-Ununfoldable Polyhedron.
Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

2010
Locked and Unlocked Chains of Planar Shapes.
Discrete & Computational Geometry, 2010

The complexity of UNO
CoRR, 2010

Shape Replication through Self-Assembly and RNase Enzymes.
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010


UNO Is Hard, Even for a Single Player.
Proceedings of the Fun with Algorithms, 5th International Conference, 2010

Kaboozle Is NP-complete, Even in a Strip.
Proceedings of the Fun with Algorithms, 5th International Conference, 2010

Making Polygons by Simple Folds and One Straight Cut.
Proceedings of the Computational Geometry, Graphs and Applications, 2010

Common Unfoldings of Polyominoes and Polycubes.
Proceedings of the Computational Geometry, Graphs and Applications, 2010

Zipper unfoldings of polyhedral complexes.
Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010

Any monotone boolean function can be realized by interlocked polygons.
Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010

2009
A Universal Crease Pattern for Folding Orthogonal Shapes
CoRR, 2009

Minimum feature size preserving decompositions
CoRR, 2009

Wrapping spheres with flat paper.
Comput. Geom., 2009

Dynamic ham-sandwich cuts in the plane.
Comput. Geom., 2009

Minimal Locked Trees.
Proceedings of the Algorithms and Data Structures, 11th International Symposium, 2009

Folding a Better Checkerboard.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

Algorithmic Folding Complexity.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

2008
Staged self-assembly: nanomanufacture of arbitrary shapes with O (1) glues.
Natural Computing, 2008

Cauchy's Arm Lemma on a Growing Sphere
CoRR, 2008

Staged Self-Assembly:Nanomanufacture of Arbitrary Shapes with O(1) Glues
CoRR, 2008

A Locked Orthogonal Tree
CoRR, 2008

Computational Balloon Twisting: The Theory of Balloon Polyhedra.
Proceedings of the 20th Annual Canadian Conference on Computational Geometry, 2008

2007
Jigsaw Puzzles, Edge Matching, and Polyomino Packing: Connections and Complexity.
Graphs and Combinatorics, 2007

Deflating the Pentagon.
Proceedings of the Computational Geometry and Graph Theory, 2007

On Rolling Cube Puzzles.
Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

Disjoint Segments Have Convex Partitions with 2-Edge Connected Dual Graphs.
Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

Vertex Pops and Popturns.
Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

2006
Morpion Solitaire.
Theory Comput. Syst., 2006

Puzzles, Art, and Magic with Algorithms.
Theory Comput. Syst., 2006

Curves in the Sand: Algorithmic Drawing.
Proceedings of the 18th Annual Canadian Conference on Computational Geometry, 2006

2005
Hinged dissection of polyominoes and polyforms.
Comput. Geom., 2005

Hinged Dissection of Polypolyhedra.
Proceedings of the Algorithms and Data Structures, 9th International Workshop, 2005

Dynamic Ham-Sandwich Cuts of Convex Polygons in the Plane.
Proceedings of the 17th Canadian Conference on Computational Geometry, 2005

2004
Solitaire Clobber.
Theor. Comput. Sci., 2004

When can you fold a map?
Comput. Geom., 2004

2003
Palindrome recognition using a multidimensional tape.
Theor. Comput. Sci., 2003

Pushing blocks is hard.
Comput. Geom., 2003

2002
Enumerating Foldings and Unfoldings Between Polygons and Polytopes.
Graphs and Combinatorics, 2002

Balanced k-colorings.
Discret. Math., 2002

A note on reconfiguring tree linkages: trees can lock.
Discret. Appl. Math., 2002

Coin-Moving Puzzles
CoRR, 2002

Tighter bounds on the genus of nonorthogonal polyhedra built from rectangles.
Proceedings of the 14th Canadian Conference on Computational Geometry, 2002

2001
Locked and Unlocked Polygonal Chains in Three Dimensions.
Discrete & Computational Geometry, 2001

The Complexity of Clickomania
CoRR, 2001

Polygons cuttable by a circular saw.
Comput. Geom., 2001

The cccg 2001 logo.
Proceedings of the 13th Canadian Conference on Computational Geometry, 2001

2000
Examples, Counterexamples, and Enumeration Results for Foldings and Unfoldings between Polygons and Polytopes
CoRR, 2000

PushPush is NP-hard in 2D
CoRR, 2000

Phutball Endgames are Hard
CoRR, 2000

Folding flat silhouettes and wrapping polyhedral packages: New results in computational origami.
Comput. Geom., 2000

PushPush and Push-1 are NP-hard in 2D.
Proceedings of the 12th Canadian Conference on Computational Geometry, 2000

1999
Folding and One Straight Cut Suffice.
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

Locked and Unlocked Polygonal Chains in 3D.
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

Metamorphosis of the Cube.
Proceedings of the Fifteenth Annual Symposium on Computational Geometry, 1999

Hinged dissections of polyominoes and polyforms.
Proceedings of the 11th Canadian Conference on Computational Geometry, 1999

1998
Folding and Cutting Paper.
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 1998

Planar Drawings of Origami Polyhedra.
Proceedings of the Graph Drawing, 6th International Symposium, 1998

Hiding disks in folded polygons.
Proceedings of the 10th Canadian Conference on Computational Geometry, 1998

Unfolding some classes of orthogonal polyhedra.
Proceedings of the 10th Canadian Conference on Computational Geometry, 1998

On reconfiguring tree linkages: Trees can lock.
Proceedings of the 10th Canadian Conference on Computational Geometry, 1998


  Loading...