{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:37:35Z","timestamp":1760441855898,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319171418"},{"type":"electronic","value":"9783319171425"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-17142-5_21","type":"book-chapter","created":{"date-parts":[[2015,4,15]],"date-time":"2015-04-15T11:19:29Z","timestamp":1429096769000},"page":"236-247","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Common Developments of Three Incongruent Boxes of Area 30"],"prefix":"10.1007","author":[{"given":"Dawei","family":"Xu","sequence":"first","affiliation":[]},{"given":"Takashi","family":"Horiyama","sequence":"additional","affiliation":[]},{"given":"Toshihiro","family":"Shirakawa","sequence":"additional","affiliation":[]},{"given":"Ryuhei","family":"Uehara","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,4,16]]},"reference":[{"key":"21_CR1","unstructured":"Abel, Z., Demaine, E., Demaine, M., Matsui, H., Rote, G., Uehara, R.: Common development of several different orthogonal boxes. In: 23rd Canadian Conference on Computational Geometry (CCCG 2011), pp. 77\u201382 (2011)"},{"key":"21_CR2","first-page":"602","volume":"114","author":"J Akiyama","year":"2007","unstructured":"Akiyama, J.: Tile-makers and semi-tile-makers. Math. Assoc. Amerika 114, 602\u2013609 (2007)","journal-title":"Math. Assoc. Amerika"},{"issue":"1","key":"21_CR3","first-page":"99","volume":"13","author":"J Akiyama","year":"2007","unstructured":"Akiyama, J., Nara, C.: Developments of polyhedra using oblique coordinates. J. Indonesia. Math. Soc. 13(1), 99\u2013114 (2007)","journal-title":"J. Indonesia. Math. Soc."},{"key":"21_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1007\/978-3-319-15612-5_26","volume-title":"WALCOM: Algorithms and Computation","author":"Y Araki","year":"2015","unstructured":"Araki, Y., Horiyama, T., Uehara, R.: Common unfolding of regular Tetrahedron and Johnson-Zalgaller solid. In: Rahman, M.S., Tomita, E. (eds.) WALCOM 2015. LNCS, vol. 8973, pp. 294\u2013305. Springer, Heidelberg (2015)"},{"key":"21_CR5","unstructured":"Biedl, T., Chan, T., Demaine, E., Demaine, M., Lubiw, A., Munro, J.I., Shallit, J.: Notes from the University of Waterloo Algorithmic Problem Session, 8 September 1999"},{"key":"21_CR6","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511735172","volume-title":"Geometric Folding Algorithms: Linkages, Origami, Polyhedra","author":"ED Demaine","year":"2007","unstructured":"Demaine, E.D., O\u2019Rourke, J.: Geometric Folding Algorithms: Linkages, Origami, Polyhedra. Cambridge University Press, Cambridge (2007)"},{"key":"21_CR7","doi-asserted-by":"crossref","DOI":"10.1515\/9780691215051","volume-title":"Polyominoes","author":"SW Golomb","year":"1994","unstructured":"Golomb, S.W.: Polyominoes. Princeton University Press, Princeton (1994)"},{"key":"21_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/978-3-642-03367-4_38","volume-title":"Algorithms and Data Structures","author":"D Kane","year":"2009","unstructured":"Kane, D., Price, G.N., Demaine, E.D.: A pseudopolynomial algorithm for Alexandrov\u2019s theorem. In: Dehne, F., Gavrilova, M., Sack, J.-R., T\u00f3th, C.D. (eds.) WADS 2009. LNCS, vol. 5664, pp. 435\u2013446. Springer, Heidelberg (2009)"},{"key":"21_CR9","unstructured":"Kawahara, J., Inoue, T., Iwashita, H., Minato, S.: Frontier-based search for enumerating all constrained subgraphs with compressed representation. Technical report TCS-TR-A-14-76, Division of Computer Science, Hokkaido University (2014)"},{"key":"21_CR10","unstructured":"Lubiw, A., O\u2019Rourke, J.: When can a polygon fold to a polytope? Technical report 048. Department of Computer Science, Smith College (1996)"},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"Minato, S.: Zero-suppressed bdds for set manipulation in combinatorial problems. In: 30th ACM\/IEEE Design Automation Conference (DAC 1993), pp. 272\u2013277 (1993)","DOI":"10.1145\/157485.164890"},{"key":"21_CR12","unstructured":"Mitani, J., Uehara, R.: Polygons folding to plural incongruent orthogonal boxes. In: Canadian Conference on Computational Geometry (CCCG 2008), pp. 39\u201342 (2008)"},{"key":"21_CR13","unstructured":"Okumura, T.: Personal communication, August 2014"},{"key":"21_CR14","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511975028","volume-title":"How to Fold It: The Mathematics of Linkage, Origami and Polyhedra","author":"J O\u2019Rourke","year":"2011","unstructured":"O\u2019Rourke, J.: How to Fold It: The Mathematics of Linkage, Origami and Polyhedra. Cambridge University Press, Cambridge (2011)"},{"key":"21_CR15","unstructured":"Shirakawa, T., Horiyama, T., Uehara, R.: Construct of common development of regular tetrahedron and cube. In: 27th European Workshop on Computational Geometry (EuroCG 2011), pp. 47\u201350, 28\u201330 March 2011"},{"issue":"1","key":"21_CR16","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1142\/S0218195913500040","volume":"23","author":"T Shirakawa","year":"2013","unstructured":"Shirakawa, T., Uehara, R.: Common developments of three incongruent orthogonal boxes. Int. J. Comput. Geom. Appl. 23(1), 65\u201371 (2013)","journal-title":"Int. J. Comput. Geom. Appl."}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-17142-5_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,8]],"date-time":"2023-02-08T10:14:36Z","timestamp":1675851276000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-17142-5_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319171418","9783319171425"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-17142-5_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"16 April 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}