1. Garey, M.R. and Johnson, D.S., Computers and Intractability: A Guide to the Theory of NP-Completeness (1979), W.H. Freeman, San Francisco.
2. Imahori, S. and Karuno, Y., Pseudo-polynomial time algorithms for food mixture packing by automatic combination weighers, Proceedings of International Symposium on Scheduling 2013 (ISS 2013), JSME No. 13-202 (2013), pp. 59-64.
3. Imahori, S., Karuno, Y., Nagamochi, H. and Wang, X., Kansei engineering, humans and computers: Efficient dynamic programming algorithms for combinatorial food packing problems, International Journal of Biometrics, Vol. 3 (2011), pp. 228-245.
4. Imahori, S., Karuno, Y., Nishizaki, R. and Yoshimoto, Y., Duplex and quasi-duplex operations in automated food packing systems, The Fifth IEEE/SICE International Symposium on System Integration (SII 2012), IEEE Xplore (2012), pp. 810-815.
5. Imahori, S., Karuno, Y. and Yoshimoto, Y., Dynamic programming algorithms for duplex food packing problems, The Eighth IEEE International Conference on Industrial Informatics (INDIN 2010), IEEE Xplore (2010), pp. 857-862.