1. Antonick, G.: Roderick Kimball’s Path Puzzles. The New York Times: Numberplay 28 (2014).
https://wordplay.blogs.nytimes.com/2014/07/28/path-2/
2. Dyer, M.E., Frieze, A.M.: Planar 3DM is NP-complete. J. Algorithms 7(2), 174–184 (1986)
3. Del Lungo, A., Navat, M.: Reconstruction of connected sets from two projections. In: Herman and Kuba [5], chapter 7
4. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1979)
5. Herman, G.T., Kuba, A. (eds.): Discrete Tomography: Foundations, Algorithms, and Applications. Birkhäuser, Basel (2012)