Flattening fixed-angle chains is strongly NP-hard by Demaine, Erik D., Eisenstat, Sarah Charmian

Get full text
Get full text
Get full text

Solving the Rubik’s Cube optimally is NP-complete by Demaine, Erik D, Eisenstat, Sarah Charmian, Rudoy, Mikhail

Get full text

One-dimensional staged self-assembly by Demaine, Erik D, Eisenstat, Sarah, Ishaque, Mashhood, Winslow, Andrew

Get full text

On the Learnability of Shuffle Ideals by Eisenstat, Sarah Charmian, Angluin, Dana, Aspnes, James, Kontorovich, Aryeh

Get full text
Get full text

One-dimensional staged self-assembly by Demaine, Erik D., Eisenstat, Sarah Charmian, Ishaque, Mashhood, Winslow, Andrew

Get full text
Get full text
Get full text

Remarks on separating words by Demaine, Erik D., Eisenstat, Sarah Charmian, Shallit, Jeffrey, Wilson, David A.

Get full text
Get full text
Get full text

Algorithms for solving rubik's cubes by Demaine, Erik D., Demaine, Martin L., Eisenstat, Sarah Charmian, Lubiw, Anna, Winslow, Andrew

Get full text
Get full text
Get full text

Variations on Instant Insanity by Demaine, Erik D., Demaine, Martin L., Morgan, Thomas D., Uehara, Ryuhei, Eisenstat, Sarah Charmian

Get full text
Get full text
Get full text

Who Needs Crossings? Hardness of Plane Graph Rigidity by Abel, Zachary R, Demaine, Erik D, Demaine, Martin L, Eisenstat, Sarah Charmian, Lynch, Jayson R., Schardl, Tao Benjamin

Get full text
Get full text
Get full text
Get full text
Get full text

Total Tetris: Tetris with Monominoes, Dominoes, Trominoes, Pentominoes,... by Demaine, Erik D, Demaine, Martin L, Eisenstat, Sarah Charmian, Hesterberg, Adam Classen, Lincoln, Andrea I, Lynch, Jayson R.

Get full text

Finding a Hamiltonian Path in a Cube with Specified Turns is Hard by Abel, Zachary Ryan, Demaine, Erik D., Demaine, Martin L., Eisenstat, Sarah Charmian, Lynch, Jayson R., Schardl, Tao Benjamin

Get full text
Get full text
Get full text
Get full text
Get full text

Free Edge Lengths in Plane Graphs by Connelly, Robert, Fulek, Radoslav, Morić, Filip, Okamoto, Yoshio, Szabó, Tibor, Tóth, Csaba D., Abel, Zachary R, Eisenstat, Sarah Charmian

Get full text
Get full text
Get full text

Folding equilateral plane graphs by Abel, Zachary R., Demaine, Erik D., Demaine, Martin L., Eisenstat, Sarah, Lynch, Jayson, Schardl, Tao B., Shapiro-Ellowitz, Isaac

Get full text

Folding equilateral plane graphs by Abel, Zachary Ryan, Demaine, Erik D., Demaine, Martin L., Eisenstat, Sarah Charmian, Lynch, Jayson R., Schardl, Tao Benjamin, Shapiro-Ellowitz, Isaac

Get full text
Get full text
Get full text
Get full text
Get full text

Two Hands Are Better Than One (up to constant factors): Self-Assembly In The 2HAM vs. aTAM by Demaine, Erik D., Demaine, Martin L., Eisenstat, Sarah Charmian, Cannon, Sarah, Patitz, Matthew J., Schweller, Robert T., Summers, Scott M., Winslow, Andrew

Get full text
Get full text
Get full text

Algorithms for Designing Pop-Up Cards by Abel, Zachary Ryan, Demaine, Erik D., Demaine, Martin L., Eisenstat, Sarah Charmian, Lubiw, Anna, Schulz, Andre, Souvaine, Diane L., Viglietta, Giovanni, Winslow, Andrew

Get full text
Get full text
Get full text
Get full text