{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T04:52:47Z","timestamp":1725598367139},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642226151"},{"type":"electronic","value":"9783642226168"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-22616-8_25","type":"book-chapter","created":{"date-parts":[[2011,7,29]],"date-time":"2011-07-29T21:25:42Z","timestamp":1311974742000},"page":"311-321","source":"Crossref","is-referenced-by-count":0,"title":["Complexity of the Stamp Folding Problem"],"prefix":"10.1007","author":[{"given":"Takuya","family":"Umesato","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Toshiki","family":"Saitoh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ryuhei","family":"Uehara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiro","family":"Ito","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"25_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? Comput. Geom.Theory Appl.\u00a029(1), 23\u201346 (2004)","journal-title":"Comput. Geom.Theory Appl."},{"key":"25_CR2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511735172","volume-title":"Geometric Folding Algorithms: Linkages, Origami, Polyhedra","author":"E.D. Demaine","year":"2007","unstructured":"Demaine, E.D., O\u2019Rourke, J.: Geometric Folding Algorithms: Linkages, Origami, Polyhedra. Cambridge University Press, Cambridge (2007)"},{"key":"25_CR3","volume-title":"An Introduction to Probability Theory and Its Applications","author":"W. Feller","year":"1968","unstructured":"Feller, W.: An Introduction to Probability Theory and Its Applications, 3rd edn., vol.\u00a01. John Wiley & Sons, Inc., Chichester (1968)","edition":"3"},{"key":"25_CR4","volume-title":"Parameterized Complexity Theory","author":"J. Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)"},{"key":"25_CR5","volume-title":"Computers and Intractability \u2014 A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability \u2014 A Guide to the Theory of NP-Completeness. Freeman, New York (1979)"},{"key":"25_CR6","doi-asserted-by":"crossref","unstructured":"Motwani, R., Raghavan, P.: Randomized Algorithms, Cambridge (1995)","DOI":"10.1017\/CBO9780511814075"},{"key":"25_CR7","doi-asserted-by":"crossref","unstructured":"Niedermeier, R.: Invitation to Fixed-Parameter Algorithms, Oxford (2006)","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001"},{"key":"25_CR8","volume-title":"Applied Combinatorics","author":"A. Tucker","year":"1995","unstructured":"Tucker, A.: Applied Combinatorics, 3rd edn. John Wiley & Sons, Inc., Chichester (1995)","edition":"3"},{"key":"25_CR9","unstructured":"Uehara, R.: On Stretch Minimization Problem on Unit Strip Paper. In: 22nd Canadian Conference on Computational Geometry (CCCG), pp. 223\u2013226 (2010)"},{"key":"25_CR10","unstructured":"Uehara, R.: Stretch Minimization Problem of a Strip Paper. In 5th International Conference on Origami in Science, Mathematics and Education (5OSME) (2010)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22616-8_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,2]],"date-time":"2019-04-02T16:50:29Z","timestamp":1554223829000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22616-8_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642226151","9783642226168"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22616-8_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}