{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,30]],"date-time":"2026-07-30T03:53:57Z","timestamp":1785383637421,"version":"3.55.0"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2019,5,11]],"date-time":"2019-05-11T00:00:00Z","timestamp":1557532800000},"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":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2020,3]]},"DOI":"10.1007\/s00373-019-02041-2","type":"journal-article","created":{"date-parts":[[2019,5,11]],"date-time":"2019-05-11T15:01:58Z","timestamp":1557586918000},"page":"221-229","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Polyhedral Characterization of Reversible Hinged Dissections"],"prefix":"10.1007","volume":"36","author":[{"given":"Jin","family":"Akiyama","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Erik D.","family":"Demaine","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6999-3088","authenticated-orcid":false,"given":"Stefan","family":"Langerman","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2019,5,11]]},"reference":[{"issue":"1","key":"2041_CR1","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/s00454-010-9305-9","volume":"47","author":"TG Abbott","year":"2012","unstructured":"Abbott, T.G., Abel, Z., Charlton, D., Demaine, E.D., Demaine, M.L., Kominers, S.D.: Hinged dissections exist. Discrete Comput. Geom. 47(1), 150\u2013186 (2012)","journal-title":"Discrete Comput. Geom."},{"key":"2041_CR2","doi-asserted-by":"crossref","unstructured":"Akiyama, J., Langerman, S., Matsunaga, K.: Reversible nets of polyhedra. In: Revised Papers from the 18th Japan Conference on Discrete and Computational Geometry and Graphs, Kyoto, pp. 13\u201323 (2015)","DOI":"10.1007\/978-3-319-48532-4_2"},{"key":"2041_CR3","doi-asserted-by":"crossref","unstructured":"Akiyama, J., Nakamura, G.: Dudeney dissection of polygons. In: Revised Papers from the Japan Conference on Discrete and Computational Geometry, Tokyo, Lecture Notes in Computer Science, vol. 1763, pp. 14\u201329 (1998)","DOI":"10.1007\/978-3-540-46515-7_2"},{"issue":"2","key":"2041_CR4","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/s00373-015-1544-3","volume":"31","author":"J Akiyama","year":"2015","unstructured":"Akiyama, J., Seong, H.: A criterion for a pair of convex polygons to be reversible. Graphs Comb 31(2), 347\u2013360 (2015)","journal-title":"Graphs Comb"},{"key":"2041_CR5","volume-title":"Convex Polyhedra","author":"AD Alexandrov","year":"2005","unstructured":"Alexandrov, A.D.: Convex Polyhedra. Springer, Berlin (2005). (Translation of Russian edition, 1950)"},{"key":"2041_CR6","first-page":"369","volume":"7","author":"YuD Burago","year":"1996","unstructured":"Burago, YuD, Zalgaller, V.A.: Isometric piecewise linear immersions of two-dimensional manifolds with polyhedral metrics in $$\\mathbb{R}^3$$. St. Petersb. Math. J. 7, 369\u2013385 (1996). (Translation by S.V. Ivanov)","journal-title":"St. Petersb. Math. J."},{"key":"2041_CR7","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":"2041_CR8","unstructured":"Dudeney, H.E.: Puzzles and Prizes. Weekly Dispatch (1902) (The puzzle appeared in the April 6 issue of this column. A discussion followed on April 20, and the solution appeared on May 4)"},{"key":"2041_CR9","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574917","volume-title":"Dissections: Plane and Fancy","author":"GN Frederickson","year":"1997","unstructured":"Frederickson, G.N.: Dissections: Plane and Fancy. Cambridge University Press, Cambridge (1997)"},{"key":"2041_CR10","volume-title":"Hinged Dissections: Swinging & Twisting","author":"GN Frederickson","year":"2002","unstructured":"Frederickson, G.N.: Hinged Dissections: Swinging & Twisting. Cambridge University Press, Cambridge (2002)"},{"key":"2041_CR11","unstructured":"Langerman, S., Winslow, A.: A complete classification of tile-makers. In: Abstracts from the 18th Japan Conference on Discrete and Computational Geometry and Graphs, Kyoto (2015)"},{"key":"2041_CR12","unstructured":"O\u2019Rourke, J.: On folding a polygon to a polyhedron (2010). \narXiv:1007.3181"},{"key":"2041_CR13","doi-asserted-by":"crossref","unstructured":"Uehara, R.: A survey and recent results about common developments of two or more boxes. In: Origami$$^6$$: Proceedings of the 6th International Meeting on Origami in Science, Mathematics and Education, vol. 1 (Mathematics), pp. 77\u201384. American Mathematical Society (2014)","DOI":"10.1090\/mbk\/095.1\/08"},{"key":"2041_CR14","unstructured":"\u0411\u0443\u0440\u0430\u0433\u043e, \u042e.\u0414., \u0417\u0430\u043b\u0433\u0430\u043b\u043b\u0435\u0440, \u0412.\u0410.: \u0420\u0435\u0430\u043b\u0438\u0437\u0430\u0446\u0438\u044f \u0440\u0430\u0437\u0432\u0435\u0440\u0442\u043e\u043a \u0432 \u0432\u0438\u0434\u0435 \u043c\u043d\u043e\u0433\u043e\u0433\u0440\u0430\u043d\u043d\u0438\u043a\u043e\u0432 (polyhedral embedding of a net). \u0432 \u0435 \u0441 \u0442 \u043d\u0438\u043a\u041b\u0413\u0423 15, 66\u201380 (1960) (in Russian with English summary)"},{"key":"2041_CR15","unstructured":"\u0411\u0443\u0440\u0430\u0433\u043e, \u042e.\u0414., \u0417\u0430\u043b\u0433\u0430\u043b\u043b\u0435\u0440, \u0412.\u0410.: \u0418\u0437\u043e\u043c\u0435\u0442\u0440\u0438\u0447\u0435\u0441\u043a\u0438\u0435 \u043a\u0443\u0441\u043e\u0447\u043d\u043e-\u043b\u0438\u043d\u0435\u0419\u043d\u044b\u0435 \u043f\u043e\u0442\u0440\u0443\u0436\u0435\u043d\u0438\u044f \u0434\u0432\u0443\u043c\u0435\u0440\u043d\u044b\u0445 \u043c\u043d\u043e\u0433\u043e\u043e\u0431\u0440\u0430\u0437\u0438\u0419 \u0441 \u043f\u043e\u043b\u0438\u044d\u0434\u0440\u0430\u043b\u044c\u043d\u043e\u0419 \u043c\u0435\u0442\u0440\u0438\u043a\u043e\u0419 \u0432 $$\\mathbb{R}^3$$. \u0410\u043b\u0433\u0435\u0431\u0440\u0430\u0438\u0430\u043d\u0430\u043b\u0438\u0437 7, 76\u201395 (1995) (in Russian, translation in [6])"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-019-02041-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-019-02041-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-019-02041-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,9]],"date-time":"2020-05-09T23:20:44Z","timestamp":1589066444000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-019-02041-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5,11]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,3]]}},"alternative-id":["2041"],"URL":"https:\/\/doi.org\/10.1007\/s00373-019-02041-2","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,5,11]]},"assertion":[{"value":"5 January 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 February 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 May 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}