1. Adler, A., Bosboom, J., Demaine, E.D., Demaine, M.L., Liu, Q.C., Lynch, J.: Tatamibari is NP-complete. In: Farach-Colton, M., Prencipe, G., Uehara, R. (eds.) 10th International Conference on Fun with Algorithms (FUN 2021). Leibniz International Proceedings in Informatics (LIPIcs), vol. 157, pp. 1:1–1:24. Schloss Dagstuhl–Leibniz-Zentrum für Informatik, Dagstuhl, Germany (2020). https://drops.dagstuhl.de/opus/volltexte/2020/12762
2. Iwamoto, C., Ibusuki, T.: Polynomial-time reductions from 3SAT to Kurotto and Juosan puzzles. IEICE Trans. Inf. Syst. 103(3), 500–505 (2020). https://www.jstage.jst.go.jp/article/transinf/E103.D/3/E103.D_2019FCP0004/_pdf
3. Bosboom, J., Demaine, E.D., Demaine, M.L., Hesterberg, A., Kimball, R., Kopinsky, J.: Path puzzles: discrete tomography with a path constraint is hard. Graphs Comb. 36(2), 251–267 (2020). https://link.springer.com/content/pdf/10.1007/s00373-019-02092-5.pdf
4. Demaine, E.D., Lynch, J., Rudoy, M., Uno, Y.: Yin-Yang Puzzles are NP-complete. In: 33rd Canadian Conference on Computational Geometry (CCCG) (2021)
5. Iwamoto, C., Ide, T.: Five cells and tilepaint are NP-complete. IEICE Trans. Inf. Syst. 105(3), 508–516 (2022). https://www.jstage.jst.go.jp/article/transinf/E105.D/3/E105.D_2021FCP0001/_pdf