{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:25:54Z","timestamp":1767338754021},"publisher-location":"Cham","reference-count":9,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319156118"},{"type":"electronic","value":"9783319156125"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-15612-5_11","type":"book-chapter","created":{"date-parts":[[2015,2,23]],"date-time":"2015-02-23T04:05:18Z","timestamp":1424664318000},"page":"113-124","source":"Crossref","is-referenced-by-count":1,"title":["Folding a Paper Strip to Minimize Thickness"],"prefix":"10.1007","author":[{"given":"Erik D.","family":"Demaine","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Eppstein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adam","family":"Hesterberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiro","family":"Ito","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anna","family":"Lubiw","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ryuhei","family":"Uehara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yushi","family":"Uno","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"11_CR1","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.comgeo.2004.03.012","volume":"29","author":"E.M. Arkin","year":"2004","unstructured":"Arkin, E.M., Bender, M.A., Demaine, E.D., Demaine, M.L., Mitchell, J.S.B., Sethia, S., Skiena, S.S.: When can you fold a map? Computational Geometry: Theory and Applications\u00a029(1), 23\u201346 (2004)","journal-title":"Computational Geometry: Theory and Applications"},{"key":"11_CR2","doi-asserted-by":"publisher","first-page":"651","DOI":"10.7155\/jgaa.00263","volume":"16","author":"M.J. Bannister","year":"2012","unstructured":"Bannister, M.J., Eppstein, D., Simons, J.A.: Inapproximability of orthogonal compaction. Journal of Graph Algorithms and Applications\u00a016, 651\u2013673 (2012)","journal-title":"Journal of Graph Algorithms and Applications"},{"key":"11_CR3","unstructured":"Bern, M., Hayes, B.: The complexity of flat origami. In: Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 175\u2013183 (1996)"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Demaine, E.D., O\u2019Rourke, J.: Geometric Folding Algorithms: Linkages, Origami, Polyhedra. Cambridge University Press (2007)","DOI":"10.1017\/CBO9780511735172"},{"key":"11_CR5","unstructured":"Gallivan, B.: Folding paper in half 12 times: An \u2018Impossible Challenge\u2019 Solved and Explained. Historical Society of Pomona Valley (2002)"},{"key":"11_CR6","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co. (1979)"},{"key":"11_CR7","unstructured":"Uehara, R.: On stretch minimization problem on unit strip paper. In: 22nd Canadian Conference on Computational Geometry (CCCG), pp. 223\u2013226 (2010)"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Uehara, R.: Stamp foldings with a given mountain-valley assignment. In: Origami5: Proceedings of the 5th International Meeting of Origami Science, Mathematics, and Education, pp. 585\u2013597. AK Peters\/CRC Press (2011)","DOI":"10.1201\/b10971-50"},{"key":"11_CR9","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.tcs.2012.08.006","volume":"497","author":"T. Umesato","year":"2013","unstructured":"Umesato, T., Saitoh, T., Uehara, R., Ito, H., Okamoto, Y.: The complexity of the stamp folding problem. Theoretical Computer Science\u00a0497, 13\u201319 (2013)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-15612-5_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:53:37Z","timestamp":1559123617000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-15612-5_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319156118","9783319156125"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-15612-5_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}