1. [1] Andersson, D.: HIROIMONO is NP-complete, Proc. 4th International Conference on Fun with Algorithms, Lecture Notes in Computer Science, Vol.4475, pp.30-39 (2007).
2. [2] Andersson, D.: Hashiwokakero is NP-complete, Inf. Process. Lett., Vol.109, No.19, pp.1145-1146 (2009).
3. [3] Demaine, E.D., Okamoto, Y., Uehara, R. and Uno, Y.: Computational complexity and an integer programming model of Shakashaka, IEICE Trans. Fundamentals of Electronics, Communications and Computer Sciences, Vol.E97-A, No.6, pp.1213-1219 (2014) (online), available from <http://hdl.handle.net/10119/12147>
4. [4] Dudeney, H.E.: 428. Planning Tours, 536 Puzzles and Curious Problems, Londres (1931), available from <http://jnsilva.ludicum.org/HMR13_14/536.pdf>
5. [5] Friedman, E.: Corral Puzzles are NP-complete, available from <http://www2.stetson.edu/~efriedma/papers/corral/corral.html>.