{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T19:02:03Z","timestamp":1757617323785,"version":"3.44.0"},"reference-count":4,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"9","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Fundamentals"],"published-print":{"date-parts":[[2025,9,1]]},"DOI":"10.1587\/transfun.2024dmp0004","type":"journal-article","created":{"date-parts":[[2025,2,2]],"date-time":"2025-02-02T17:13:22Z","timestamp":1738516402000},"page":"1084-1091","source":"Crossref","is-referenced-by-count":0,"title":["Computational Complexity of One-Dimensional Origami with Constraints on Thickness at Creases"],"prefix":"10.1587","volume":"E108.A","author":[{"given":"Junnosuke","family":"HOSHIDO","sequence":"first","affiliation":[{"name":"FLECT Co., Ltd."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tonan","family":"KAMATA","sequence":"additional","affiliation":[{"name":"Computing Science Research Area, Japan Advanced Institute of Science and Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tsutomu","family":"ANSAI","sequence":"additional","affiliation":[{"name":"National Institute of Technology (KOSEN), Ibaraki College"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ryuhei","family":"UEHARA","sequence":"additional","affiliation":[{"name":"Computing Science Research Area, Japan Advanced Institute of Science and Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"publisher","unstructured":"[2] T. Umesato, T. Saitoh, R. Uehara, H. Ito, and Y. Okamoto, \u201cThe complexity of the stamp folding problem,\u201d Theoretical Computer Science, vol.497, pp.13-19, 2013. 10.1016\/j.tcs.2012.08.006","DOI":"10.1016\/j.tcs.2012.08.006"},{"key":"2","unstructured":"[4] R.I. Nishat, \u201cMap Folding,\u201d Master thesis, University of Victoria, Department of Computer Science, 2013."},{"key":"3","unstructured":"[5] M.R. Garey and D.S. Johnson, Computers and Intractability\u2006\u2014\u2006A Guide to the Theory of NP-Completeness, Freeman, 1979."},{"key":"4","doi-asserted-by":"publisher","unstructured":"[6] T. Asano, E.D. Demaine, M.L. Demaine, and R. Uehara, \u201cNP-completeness of generalized Kaboozle,\u201d Journal of Information Processing, vol.20, no.3, pp.713-718, 2012. 10.2197\/ipsjjip.20.713","DOI":"10.2197\/ipsjjip.20.713"}],"container-title":["IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E108.A\/9\/E108.A_2024DMP0004\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T03:33:17Z","timestamp":1757129597000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E108.A\/9\/E108.A_2024DMP0004\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,1]]},"references-count":4,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2025]]}},"URL":"https:\/\/doi.org\/10.1587\/transfun.2024dmp0004","relation":{},"ISSN":["0916-8508","1745-1337"],"issn-type":[{"type":"print","value":"0916-8508"},{"type":"electronic","value":"1745-1337"}],"subject":[],"published":{"date-parts":[[2025,9,1]]},"article-number":"2024DMP0004"}}