{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:21:56Z","timestamp":1725488516816},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424239"},{"type":"electronic","value":"9783540446347"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44634-6_37","type":"book-chapter","created":{"date-parts":[[2007,8,10]],"date-time":"2007-08-10T10:20:48Z","timestamp":1186741248000},"page":"401-413","source":"Crossref","is-referenced-by-count":3,"title":["When Can You Fold a Map?"],"prefix":"10.1007","author":[{"given":"Esther M.","family":"Arkin","sequence":"first","affiliation":[]},{"given":"Michael A.","family":"Bender","sequence":"additional","affiliation":[]},{"given":"Erik D.","family":"Demaine","sequence":"additional","affiliation":[]},{"given":"Martin L.","family":"Demaine","sequence":"additional","affiliation":[]},{"given":"Joseph S. B.","family":"Mitchell","sequence":"additional","affiliation":[]},{"given":"Saurabh","family":"Sethia","sequence":"additional","affiliation":[]},{"given":"Steven S.","family":"Skiena","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,8,2]]},"reference":[{"key":"37_CR1","unstructured":"E. M. Arkin, S. P. Fekete, J. S. B. Mitchell, and S. S. Skiena. On the manufacturability of paperclips and sheet metal structures. In Proc. of the 17th European Workshop on Computational Geometry, pages 187\u2013190, 2001."},{"key":"37_CR2","unstructured":"M. Bern and B. Hayes. The complexity of flat origami. In Proc. of the 7th ACM-SIAM Symposium on Discrete Algorithms, pages 175\u2013183, 1996."},{"key":"37_CR3","doi-asserted-by":"crossref","unstructured":"P. Crescenzi, D. Goldman, C. Papadimitriou, A. Piccolboni, and M. Yannakakis. On the complexity of protein folding. J. of Computational Biology, 5(3), 1998.","DOI":"10.1089\/cmb.1998.5.423"},{"key":"37_CR4","doi-asserted-by":"crossref","unstructured":"E. D. Demaine, M. L. Demaine, and J. S. B. Mitchell. Folding flat silhouettes and wrapping polyhedral packages: New results in computational origami. In Proc. of the 15th ACM Symposium on Computational Geometry, 1999.","DOI":"10.1145\/304893.304933"},{"key":"37_CR5","doi-asserted-by":"crossref","unstructured":"M. Farach. Optimal suffix tree construction with large alphabets. In Proc. of the 38th Symp. on Foundations of Computer Science, pages 137\u2013143, 1997.","DOI":"10.1109\/SFCS.1997.646102"},{"key":"37_CR6","unstructured":"M. Gardner. The combinatorics of paper folding. In Wheels, Life and Other Mathematical Amusements, Chapter 7, pp. 60\u201373. W. H. Freeman and Company, 1983."},{"key":"37_CR7","unstructured":"M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., 1979."},{"issue":"2","key":"37_CR8","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1137\/0213024","volume":"13","author":"D. Harel","year":"1984","unstructured":"D. Harel and R. E. Tarjan. Fast algorithms for finding nearest common ancestors. SIAM J. on Computing, 13(2):338\u2013355, 1984.","journal-title":"SIAM J. on Computing"},{"key":"37_CR9","first-page":"215","volume":"100","author":"T. Hull","year":"1994","unstructured":"T. Hull. On the mathematics of flat origamis. Congressum Numerantium, 100:215\u2013224, 1994.","journal-title":"Congressum Numerantium"},{"key":"37_CR10","unstructured":"J. Justin. Towards a mathematical theory of origami. In Koryo Miura, editor, Proc. of the 2nd International Meeting of Origami Science and Scientific Origami, pages 15\u201329, 1994."},{"issue":"2","key":"37_CR11","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1147\/rd.312.0249","volume":"31","author":"R. M. Karp","year":"1987","unstructured":"R. M. Karp and M. O. Rabin. Efficient randomized pattern-matching algorithms. IBM Journal of Research and Development, 31(2):249\u2013260, 1987.","journal-title":"IBM Journal of Research and Development"},{"key":"37_CR12","unstructured":"T. Kawasaki. On the relation between mountain-creases and valley-creases of a flat origami. In H. Huzita, editor, Proc. of the 1st International Meeting of Origami Science and Technology, pages 229\u2013237, Ferrara, Italy, December 1989. An unabridged Japanese version appeared in Sasebo College of Technology Report, 27:153\u2013157, 1990."},{"key":"37_CR13","doi-asserted-by":"crossref","unstructured":"R. J. Lang. A computational algorithm for origami design. In Proc. of the 12th ACM Symposium on Computational Geometry, pages 98\u2013105, 1996.","DOI":"10.1145\/237218.237249"},{"issue":"4","key":"37_CR14","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1109\/70.864227","volume":"16","author":"L. Lu","year":"2000","unstructured":"L. Lu and S. Akella. Folding cartons with fixtures: A motion planning approach. IEEE Trans. on Robotics and Automation, 16(4):346\u2013356, 2000.","journal-title":"IEEE Trans. on Robotics and Automation"},{"issue":"1","key":"37_CR15","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1093\/comjnl\/14.1.75","volume":"14","author":"W. F. Lunnon","year":"1971","unstructured":"W. F. Lunnon. Multi-dimensional map-folding. The Computer Journal, 14(1):75\u201380, 1971.","journal-title":"The Computer Journal"},{"key":"37_CR16","doi-asserted-by":"crossref","unstructured":"R. Motwani and P. Raghavan. Randomized Algorithms, Chapter 8.4, pages 213\u2013221. Cambridge University Press, 1995.","DOI":"10.1017\/CBO9780511814075"},{"issue":"6","key":"37_CR17","doi-asserted-by":"publisher","first-page":"1253","DOI":"10.1137\/0217079","volume":"17","author":"B. Schieber","year":"1988","unstructured":"B. Schieber and U. Vishkin. On finding lowest common ancestors: Simplification and parallelization. SIAM J. on Computing, 17(6):1253\u20131262, 1988.","journal-title":"SIAM J. on Computing"},{"key":"37_CR18","unstructured":"J. S. Smith. Origami profiles. British Origami, 58, 1976."},{"key":"37_CR19","unstructured":"J. S. Smith. Pureland Origami 1, 2, and 3. British Origami Society. Booklets 14, 29, and 43, 1980, 1988, and 1993."},{"key":"37_CR20","unstructured":"M. Thorup. Faster deterministic sorting and priority queues in linear space. In Proc. of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 50\u2013555, 1998."},{"key":"37_CR21","unstructured":"C-H. Wang. Manufacturability-driven decomposition of sheet metal. PhD thesis, Carnegie Mellon University 1997. Technical report CMU-RI-TR-97-35."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44634-6_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,21]],"date-time":"2019-02-21T09:25:42Z","timestamp":1550741142000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44634-6_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424239","9783540446347"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-44634-6_37","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}