Skip to main content

8 Result(s)

within Computer Science Remove this filter Algorithm Analysis and Problem Complexity Remove this filter Computer Communication Networks Remove this filter Discrete Mathematics in Computer Science Remove this filter Martin L. Demaine Remove this filter Conference Paper Remove this filter

and

  1. No Access

    Chapter and Conference Paper

    Universal Hinge Patterns for Folding Strips Efficiently into Any Grid Polyhedron

    We present two universal hinge patterns that enable a strip of material to fold into any connected surface made up of unit squares on the 3D cube grid—for example, the surface of any polycube. The folding is e...

    Nadia M. Benbernou, Erik D. Demaine, Martin L. Demaine… in Algorithms and Data Structures (2017)

  2. No Access

    Chapter and Conference Paper

    One Tile to Rule Them All: Simulating Any Tile Assembly System with a Single Universal Tile

    In the classical model of tile self-assembly, unit square tiles translate in the plane and attach edgewise to form large crystalline structures. This model of self-assembly has been shown to be capable of asympto...

    Erik D. Demaine, Martin L. Demaine… in Automata, Languages, and Programming (2014)

  3. No Access

    Chapter and Conference Paper

    Picture-Hanging Puzzles

    We show how to hang a picture by wrap** rope around n nails, making a polynomial number of twists, such that the picture falls whenever any k out of the n nails get removed, and the picture remains hanging when...

    Erik D. Demaine, Martin L. Demaine, Yair N. Minsky… in Fun with Algorithms (2012)

  4. No Access

    Chapter and Conference Paper

    Folding Equilateral Plane Graphs

    We consider two types of folding applied to equilateral plane graph linkages. First, under continuous folding motions, we show how to reconfigure any linear equilateral tree (lying on a line) into a canonical con...

    Zachary Abel, Erik D. Demaine, Martin L. Demaine… in Algorithms and Computation (2011)

  5. No Access

    Chapter and Conference Paper

    Algorithms for Solving Rubik’s Cubes

    The Rubik’s Cube is perhaps the world’s most famous and iconic puzzle, well-known to have a rich underlying mathematical structure (group theory). In this paper, we show that the Rubik’s Cube also has a rich u...

    Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Anna Lubiw… in Algorithms – ESA 2011 (2011)

  6. No Access

    Chapter and Conference Paper

    UNO Is Hard, Even for a Single Player

    UNO \(\mbox{}^{\scriptsize\textregistered}\) is one of the world-wide well-known and popular card games. We investigate UNO from t...

    Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara, Takeaki Uno… in Fun with Algorithms (2010)

  7. No Access

    Chapter and Conference Paper

    Kaboozle Is NP-complete, Even in a Strip

    Kaboozle is a puzzle consisting of several square cards, each annotated with colored paths and dots drawn on both sides and holes drilled. The goal is to join two colored dots with paths of the same color (and...

    Tetsuo Asano, Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara in Fun with Algorithms (2010)

  8. No Access

    Chapter and Conference Paper

    Matching Points with Things

    Given an ordered set of points and an ordered set of geometric objects in the plane, we are interested in finding a non-crossing matching between point-object pairs. We show that when the objects we match the ...

    Greg Aloupis, Jean Cardinal, Sébastien Collette… in LATIN 2010: Theoretical Informatics (2010)