{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:39:35Z","timestamp":1767339575832},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2011,3,17]],"date-time":"2011-03-17T00:00:00Z","timestamp":1300320000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2011,5]]},"DOI":"10.1007\/s00373-011-1019-0","type":"journal-article","created":{"date-parts":[[2011,3,16]],"date-time":"2011-03-16T05:26:12Z","timestamp":1300253172000},"page":"341-351","source":"Crossref","is-referenced-by-count":4,"title":["Algorithmic Folding Complexity"],"prefix":"10.1007","volume":"27","author":[{"given":"Jean","family":"Cardinal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Erik D.","family":"Demaine","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin L.","family":"Demaine","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shinji","family":"Imahori","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tsuyoshi","family":"Ito","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masashi","family":"Kiyomi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Langerman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ryuhei","family":"Uehara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takeaki","family":"Uno","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,3,17]]},"reference":[{"key":"1019_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. 1, 133\u2013143 (1994)","journal-title":"Bull. Belg. Math. Soc."},{"issue":"1","key":"1019_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. 29(1), 23\u201346 (2004)","journal-title":"Comput. Geom. Theory Appl."},{"key":"1019_CR3","unstructured":"Cardinal, J., Demaine, E.D., Demaine, M.L., Imahori, S., Langerman, S., Uehara, R.: Algorithmic folding complexity. In: 20th international symposium on algorithms and computation (ISAAC 2009). Lecture Notes in Computer Science, vol. 5856, pp. 452\u2013461. Springer, Berlin (2009). (Extended abstract was presented at 7th Japan Conference on Computational Geometry and Graphs (JCCGG 2009), 143\u2013144, 2009.)"},{"key":"1019_CR4","unstructured":"chosotec. The making of Mens et Manus (in origami), vol. 1 (2007). http:\/\/techtv.mit.edu\/collections\/chosetec\/videos\/361-the-making-of-mens-et-manus-in-origami-vol-1"},{"key":"1019_CR5","unstructured":"Dekking, M.: Michel Mend\u00e8s France, Alf van der Poorten. Folds! Math. Intell. 4, 130\u2013138 (1982) (173\u2013181, 190\u2013195)"},{"key":"1019_CR6","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":"1019_CR7","unstructured":"Demaine, E.D., O\u2019Rourke, J.: Open problems from CCCG 2008. In: Proceedings of 21st Canadian Conference on Computational Geometry (CCCG\u201909) (2009, to appear)"},{"key":"1019_CR8","doi-asserted-by":"crossref","unstructured":"Gardner, M.: Mathematical games. Sci. Am. 216(3), 124\u2013125 (1967) (216, 4 (April 1967), 118\u2013120; 217, 1 (July 1967), 115)","DOI":"10.1038\/scientificamerican0367-124"},{"key":"1019_CR9","unstructured":"Ito, T., Kiyomi, M., Imahori, S., Uehara, R.: Complexity of pleat folding. In: Proceedings of 25th Workshop on Computational Geometry (EuroCG\u201909), pp. 53\u201356 (2009)"},{"issue":"3","key":"1019_CR10","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1109\/TIT.1977.1055714","volume":"23","author":"J. Ziv","year":"1977","unstructured":"Ziv J., Lempel A.: A universal algorithm for sequential data compression. IEEE Trans. Inform. Theory 23(3), 337\u2013343 (1977)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"5","key":"1019_CR11","doi-asserted-by":"crossref","first-page":"530","DOI":"10.1109\/TIT.1978.1055934","volume":"24","author":"J. Ziv","year":"1978","unstructured":"Ziv J., Lempel A.: Compression of individual sequences via variable-rate coding. IEEE Trans. Inform. Theory 24(5), 530\u2013536 (1978)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"1019_CR12","doi-asserted-by":"crossref","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. 24, 123\u2013131 (1981)","journal-title":"Bull. Austr. Math. Soc."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-011-1019-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-011-1019-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-011-1019-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,17]],"date-time":"2020-06-17T10:19:15Z","timestamp":1592389155000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-011-1019-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,3,17]]},"references-count":12,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,5]]}},"alternative-id":["1019"],"URL":"https:\/\/doi.org\/10.1007\/s00373-011-1019-0","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,3,17]]}}}