@InProceedings{demaine_et_al:LIPIcs.STACS.2018.24,
  author =	{Demaine, Erik D. and Eisenstat, Sarah and Rudoy, Mikhail},
  title =	{{Solving the Rubik's Cube Optimally is NP-complete}},
  booktitle =	{35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)},
  pages =	{24:1--24:13},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-062-0},
  ISSN =	{1868-8969},
  year =	{2018},
  volume =	{96},
  editor =	{Niedermeier, Rolf and Vall\'{e}e, Brigitte},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2018.24},
  URN =		{urn:nbn:de:0030-drops-85336},
  doi =		{10.4230/LIPIcs.STACS.2018.24},
  annote =	{Keywords: combinatorial puzzles, NP-hardness, group theory, Hamiltonicity}
}