Publisher
Springer Nature Switzerland
Reference13 articles.
1. Banbara, M., et al.: Solving rep-tile by computers: performance of solvers and analyses of solutions. arXiv:2110.05184 (2021)
2. Bosboom, J., Demaine, E.D., Demaine, M.L., Hesterberg, A., Manurangsi, P., Yodpinyanee, A.: Even $$1\times n$$ edge matching and jigsaw puzzles are really hard. J. Inf. Process. 25, 682–694 (2017)
3. Demaine, E.D., Demaine, M.L.: Jigsaw puzzles, edge matching, and polyomino packing: connections and complexity. Graphs Combin. 23(Suppl 1), 195–208 (2007). https://doi.org/10.1007/s00373-007-0713-4
4. Demaine, E.D., et al.: Symmetric assembly puzzles are hard, beyond a few pieces. Comput. Geom.: Theory Appl. 90, 101648, 1–11 (2020). https://doi.org/10.1016/j.comgeo.2020.101648
5. Flake, G.W., Baum, E.B.: Rush hour is PSPACE-complete, or “why you should generously tip parking lot attendants’’. Theoret. Comput. Sci. 270, 895–911 (2002)