{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T22:25:13Z","timestamp":1743114313912,"version":"3.40.3"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030105631"},{"type":"electronic","value":"9783030105648"}],"license":[{"start":{"date-parts":[[2018,12,21]],"date-time":"2018-12-21T00:00:00Z","timestamp":1545350400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-10564-8_11","type":"book-chapter","created":{"date-parts":[[2018,12,20]],"date-time":"2018-12-20T12:40:07Z","timestamp":1545309607000},"page":"135-147","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Flat-Foldability for 1\u00a0\u00d7\u00a0n Maps with Square\/Diagonal Grid Patterns"],"prefix":"10.1007","author":[{"given":"Yiyang","family":"Jia","sequence":"first","affiliation":[]},{"given":"Yoshihiro","family":"Kanamori","sequence":"additional","affiliation":[]},{"given":"Jun","family":"Mitani","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,12,21]]},"reference":[{"key":"11_CR1","unstructured":"Bern, M., Hayes, B.: The complexity of flat origami. In: Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms SODA 1996, pp. 175\u2013183. Society for Industrial and Applied Mathematics, Philadelphia (1996)"},{"key":"11_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/978-3-319-48532-4_15","volume-title":"Discrete and Computational Geometry and Graphs","author":"HA Akitaya","year":"2016","unstructured":"Akitaya, H.A., et al.: Box pleating is hard. In: Akiyama, J., Ito, H., Sakai, T. (eds.) JCDCGG 2015. LNCS, vol. 9943, pp. 167\u2013179. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-48532-4_15"},{"key":"11_CR3","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511735172","volume-title":"Geometric Folding Algorithms: Linkages, Origami, and Polyhedra","author":"E Demaine","year":"2007","unstructured":"Demaine, E., O\u2019Rourke, J.: Geometric Folding Algorithms: Linkages, Origami, and Polyhedra. Cambridge University Press, Cambridge (2007)"},{"issue":"1","key":"11_CR4","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.comgeo.2004.03.012","volume":"29","author":"EM Arkin","year":"2004","unstructured":"Arkin, E.M., et al.: When can you fold a map? Comput. Geom. Theor. Appl. 29(1), 23\u201346 (2004)","journal-title":"Comput. Geom. Theor. Appl."},{"key":"11_CR5","unstructured":"Morgan, T.: Map folding. Master\u2019s thesis, Massachusetts Institute of Technology (2012)"},{"key":"11_CR6","unstructured":"Nishat, R.I., Whitesides, S.: Canadian Conference on Computational Geometry, pp. 49\u201354 (2013)"},{"key":"11_CR7","unstructured":"Justin, J.: Aspects mathematiques du pliage de papier (mathematical aspects of paper fold). In: Huzita, H. (ed.) 1st International Meeting of Origami Science and Scientific Origami, pp. 263\u2013277 (1989)"},{"key":"11_CR8","unstructured":"Hull, T.C.: Counting mountain-valley assignments for flat folds. arXiv preprint arXiv:1410.5022 (2014)"},{"issue":"2","key":"11_CR9","first-page":"169","volume":"21","author":"Y Matsukawa","year":"2017","unstructured":"Matsukawa, Y., Yamamoto, Y., Mitani, J.: Enumeration of flat-foldable crease patterns in the square\/diagonal grid and their folded shapes. J. Geom. Graph. 21(2), 169\u2013178 (2017)","journal-title":"J. Geom. Graph."},{"key":"11_CR10","unstructured":"Kasahara, K., Takahama, T.: Origami for the Connoisseur. Japan Publications Inc. (1978)"},{"issue":"2","key":"11_CR11","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/S0021-9800(68)80048-1","volume":"5","author":"JE Koehler","year":"1968","unstructured":"Koehler, J.E.: Folding a strip of stamps. J. Combinatorial Theor. 5(2), 135\u2013152 (1968)","journal-title":"J. Combinatorial Theor."}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-10564-8_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T14:50:45Z","timestamp":1709823045000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-10564-8_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12,21]]},"ISBN":["9783030105631","9783030105648"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-10564-8_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018,12,21]]},"assertion":[{"value":"21 December 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WALCOM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Algorithms and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Guwahati","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 February 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 March 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.iitg.ac.in\/walcom2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"100","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"9.8","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}