Tree-residue vertex-breaking: A new tool for proving hardness

by Demaine, Erik, Rudoy, Mikhail
Published 2021

Solving the Rubik's Cube optimally is NP-complete

by Demaine, Erik D, Eisenstat, Sarah Charmian, Rudoy, Mikhail
Published 2019

Circumscribing Polygons and Polygonizations for Disjoint Line Segments

by Akitaya, Hugo A., Korman, Matias, Korten, Oliver, Rudoy, Mikhail, Souvaine, Diane L., Tóth, Csaba D.
Published 2022

Dissection with the Fewest Pieces is Hard, Even to Approximate

by Manurangsi, Pasin, Bosboom, Jeffrey William, Demaine, Erik D, Demaine, Martin L, Lynch, Jayson R., Rudoy, Mikhail, Yodpinyanee, Anak
Published 2018

Who witnesses the witness? Finding witnesses in the witness is hard and sometimes impossible

by Abel, Zachary R, Bosboom, Jeffrey William, Demaine, Erik D, Hamilton, Linus Ulysses, Hesterberg, Adam Classen, Kopinsky, Justin, Lynch, Jayson R., Rudoy, Mikhail
Published 2020

Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible

by Abel, Zachary R, Bosboom, Jeffrey William, Coulombe, Michael Joseph, Demaine, Erik D., Hamilton, Linus, Hesterberg, Adam, Kopinsky, Justin, Lynch, Jayson R., Rudoy, Mikhail, Thielen, Clemens
Published 2020