Daniel Andersson. HIROIMONO Is NP-Complete. In Pierluigi Crescenzi, Giuseppe Prencipe, Geppino Pucci, editors, Fun with Algorithms, 4th International Conference, FUN 2007, Castiglioncello, Italy, June 3-5, 2007, Proceedings. Volume 4475 of Lecture Notes in Computer Science, pages 30-39, Springer, 2007. [doi]
Abstract is missing.