{"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":1785383637765,"version":"3.55.0"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,3,20]],"date-time":"2017-03-20T00:00:00Z","timestamp":1489968000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[2017,7]]},"DOI":"10.1007\/s00454-017-9876-9","type":"journal-article","created":{"date-parts":[[2017,3,20]],"date-time":"2017-03-20T18:22:07Z","timestamp":1490034127000},"page":"30-50","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Generalization of Haberdasher\u2019s Puzzle"],"prefix":"10.1007","volume":"58","author":[{"given":"Jin","family":"Akiyama","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kiyoko","family":"Matsunaga","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2017,3,20]]},"reference":[{"key":"9876_CR1","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/978-3-319-48532-4_2","volume-title":"Discrete and Computational Geometry and Graphs. Lecture Note in Computer Science","author":"J Akiyama","year":"2016","unstructured":"Akiyama, J., Langerman, S., Matsunaga, K.: Reversible nets of polyhedra. In: Akiyama, J., Ito, H., Sakai, T. (eds.) Discrete and Computational Geometry and Graphs. Lecture Note in Computer Science, vol. 9943, pp. 13\u201323. Springer, Berlin (2016)"},{"key":"9876_CR2","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1007\/978-3-540-46515-7_2","volume-title":"Discrete and Computational Geometry. Lecture Notes in Computer Science","author":"J Akiyama","year":"2000","unstructured":"Akiyama, J., Nakamura, G.: Dudeney dissections of polygons. In: Akiyama, J., Kano, M., Urabe, M. (eds.) Discrete and Computational Geometry. Lecture Notes in Computer Science, vol. 1763, pp. 14\u201329. Springer, Berlin (2000)"},{"key":"9876_CR3","series-title":"Algorithms and Combinatorics","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/978-3-642-55566-4_3","volume-title":"Discrete and Computational Geometry","author":"J Akiyama","year":"2003","unstructured":"Akiyama, J., Nakamura, G.: Congruent Dudeney dissections of triangles and convex quadrilaterals\u2014all hinge points interior to the sides of the polygons. In: Aronov, B., et al. (eds.) Discrete and Computational Geometry. Algorithms and Combinatorics, vol. 25, pp. 43\u201363. Springer, Berlin (2003)"},{"key":"9876_CR4","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1007\/978-3-540-44400-8_3","volume-title":"Discrete and Computational Geometry. Lecture Notes in Computer Science","author":"J Akiyama","year":"2003","unstructured":"Akiyama, J., Nakamura, G.: Congruent Dudeney dissections of polygons. All the hinge points on vertices of the polygon. In: Akiyama, J., Kano, M. (eds.) Discrete and Computational Geometry. Lecture Notes in Computer Science, vol. 2866, pp. 14\u201321. Springer, Berlin (2003)"},{"key":"9876_CR5","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/j.dam.2014.06.015","volume":"178","author":"J Akiyama","year":"2014","unstructured":"Akiyama, J., Rappaport, D., Seong, H.: A decision algorithm for reversible pairs of polygons. Discrete Appl. Math. 178, 19\u201326 (2014)","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"9876_CR6","doi-asserted-by":"crossref","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":"9876_CR7","unstructured":"Conway Criterion. \n                        http:\/\/en.wikipedia.org\/wiki\/Conway_criterion\n                        \n                     (this page was last modified on 8 Aug 2015, at 19:27)"},{"key":"9876_CR8","volume-title":"The Canterbury Puzzles and Other Curious Problems","author":"HE Dudeney","year":"1907","unstructured":"Dudeney, H.E.: The Canterbury Puzzles and Other Curious Problems. W. Heinemann, London (1907)"},{"key":"9876_CR9","doi-asserted-by":"crossref","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)"},{"issue":"4","key":"9876_CR10","doi-asserted-by":"crossref","first-page":"224","DOI":"10.2307\/2689617","volume":"53","author":"D Schattschneider","year":"1980","unstructured":"Schattschneider, D.: Will it tile? Try the Conway criterion!. Math. Mag. 53(4), 224\u2013233 (1980)","journal-title":"Math. Mag."}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00454-017-9876-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-017-9876-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-017-9876-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,2]],"date-time":"2017-06-02T14:40:13Z","timestamp":1496414413000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00454-017-9876-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,3,20]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,7]]}},"alternative-id":["9876"],"URL":"https:\/\/doi.org\/10.1007\/s00454-017-9876-9","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"value":"0179-5376","type":"print"},{"value":"1432-0444","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,3,20]]}}}