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]
@inproceedings{Andersson07:0,
title = {HIROIMONO Is NP-Complete},
author = {Daniel Andersson},
year = {2007},
doi = {10.1007/978-3-540-72914-3_5},
url = {http://dx.doi.org/10.1007/978-3-540-72914-3_5},
tags = {completeness},
researchr = {https://researchr.org/publication/Andersson07%3A0},
cites = {0},
citedby = {0},
pages = {30-39},
booktitle = {Fun with Algorithms, 4th International Conference, FUN 2007, Castiglioncello, Italy, June 3-5, 2007, Proceedings},
editor = {Pierluigi Crescenzi and Giuseppe Prencipe and Geppino Pucci},
volume = {4475},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-540-72913-6},
}