1. Computers and Intractability: A Guide to the Theory of NP-Completeness,;M. R. Garey;W.H. Freeman,1979
2. Pseudo-polynomial time algorithms for food mixture packing by automatic combination weighers,;S. Imahori;in Proceedings of International Symposium on Scheduling 2013 (ISS 2013),2013
3. Kansei engineering, humans and computers: Efficient dynamic programming algorithms for combinatorial food packing problems,;S. Imahori;International Journal of Biometrics,2011
4. Duplex and quasi-duplex operations in automated food packing systems,;S. Imahori;in IEEE Xplore of the Fifth IEEE/SICE International Symposium on System Integration (SII 2012),2012
5. Dynamic programming algorithms for producing food mixture packages by automatic combination weighers,;S. Imahori;Journal of Advanced Mechanical Design,2014