{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T03:51:36Z","timestamp":1794369096643,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642106309","type":"print"},{"value":"9783642106316","type":"electronic"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-10631-6_47","type":"book-chapter","created":{"date-parts":[[2009,12,4]],"date-time":"2009-12-04T02:03:43Z","timestamp":1259892223000},"page":"452-461","source":"Crossref","is-referenced-by-count":2,"title":["Algorithmic Folding Complexity"],"prefix":"10.1007","author":[{"given":"Jean","family":"Cardinal","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Erik D.","family":"Demaine","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Martin L.","family":"Demaine","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shinji","family":"Imahori","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stefan","family":"Langerman","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ryuhei","family":"Uehara","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"47_CR1","doi-asserted-by":"crossref","first-page":"133","DOI":"10.36045\/bbms\/1103408543","volume":"1","author":"J.-P. Allouche","year":"1994","unstructured":"Allouche, J.-P.: Sur la complexit\u00e9 des suites infinies. Bull. Belg. Math. Soc.\u00a01, 133\u2013143 (1994)","journal-title":"Bull. Belg. Math. Soc."},{"issue":"1","key":"47_CR2","doi-asserted-by":"crossref","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? Comput. Geom. Theory Appl.\u00a029(1), 23\u201346 (2004)","journal-title":"Comput. Geom. Theory Appl."},{"key":"47_CR3","unstructured":"Chan, B.: The making of Mens et Manus (in origami), vol.\u00a01 (March 2007), http:\/\/techtv.mit.edu\/collections\/chosetec\/videos\/361-the-making-of-mens-et-manus-in-origami-vol-1"},{"key":"47_CR4","unstructured":"Dekking, M., Mend\u00e8s France, M., van der Poorten, A.J.: Folds! Math. Intell.\u00a04, 130\u2013138, 173\u2013181, 190\u2013195 (1982), http:\/\/www.springerlink.com.libproxy.mit.edu\/content\/600308q03484h674\/?p=7ae69724020246ea9bf871d5d4b8b3af&pi=4"},{"key":"47_CR5","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511735172","volume-title":"Geometric Folding Algorithms","author":"E.D. Demaine","year":"2007","unstructured":"Demaine, E.D., O\u2019Rourke, J.: Geometric Folding Algorithms. Cambridge University Press, Cambridge (2007)"},{"key":"47_CR6","unstructured":"Demaine, E.D., O\u2019Rourke, J.: Open problems from CCCG 2008. In: Proc. 21st Canadian Conference on Computational Geometry, CCCG 2009 (to appear, 2009)"},{"key":"47_CR7","unstructured":"Ito, T., Kiyomi, M., Imahori, S., Uehara, R.: Complexity of pleat folding. In: Proc. 25th Workshop on Computational Geometry (EuroCG 2009), pp. 53\u201356 (2009)"},{"key":"47_CR8","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1017\/S0004972700007486","volume":"24","author":"M. Mend\u00e8s France","year":"1981","unstructured":"Mend\u00e8s France, M., van der Poorten, A.J.: Arithmetic and analytic properties of paper folding sequences. Bull. Austr. Math. Soc.\u00a024, 123\u2013131 (1981)","journal-title":"Bull. Austr. Math. Soc."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-10631-6_47","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,23]],"date-time":"2020-05-23T22:07:15Z","timestamp":1590271635000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-10631-6_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642106309","9783642106316"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-10631-6_47","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-3-642-10631-6","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}