Andersson, Daniel (2009), "Hashiwokakero is NP-complete", Information Processing Letters, 109 (19): 1145–1146, doi:10.1016/j.ipl.2009.07.017, MR2552932.
arxiv.org
Coelho, L.C.; Laporte, G.; Lindbeck, A.; Vidal, T. (2019), "Benchmark instances and branch-and-cut algorithm for the Hashiwokakero puzzle", arXiv:1905.00973 [cs.DM].
Andersson, Daniel (2009), "Hashiwokakero is NP-complete", Information Processing Letters, 109 (19): 1145–1146, doi:10.1016/j.ipl.2009.07.017, MR2552932.