{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T05:36:06Z","timestamp":1725600966254},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642229527"},{"type":"electronic","value":"9783642229534"}],"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-22953-4_10","type":"book-chapter","created":{"date-parts":[[2011,8,17]],"date-time":"2011-08-17T08:28:08Z","timestamp":1313569688000},"page":"114-125","source":"Crossref","is-referenced-by-count":2,"title":["Edge-Matching Problems with Rotations"],"prefix":"10.1007","author":[{"given":"Martin","family":"Ebbesen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul","family":"Fischer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carsten","family":"Witt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"17","key":"10_CR1","doi-asserted-by":"publisher","first-page":"9748","DOI":"10.1073\/pnas.171285098","volume":"98","author":"P. Pevzner","year":"2001","unstructured":"Pevzner, P., Tang, H., Waterman, M.: An Eulerian path approach to DNA fragment assembly. Proceedings of the National Academy of Sciences of the United States of America\u00a098(17), 9748\u20139753 (2001)","journal-title":"Proceedings of the National Academy of Sciences of the United States of America"},{"key":"10_CR2","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1002\/jgt.3190100306","volume":"10","author":"L. Lesniak","year":"1986","unstructured":"Lesniak, L., Oellermann, O.R.: An Eulerian exposition. Journal of Graph Theory\u00a010, 277\u2013297 (1986)","journal-title":"Journal of Graph Theory"},{"key":"10_CR3","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M. Garey","year":"1979","unstructured":"Garey, M., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York (1979)"},{"key":"10_CR4","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/S0304-3975(96)00291-5","volume":"188","author":"E. Goles","year":"1997","unstructured":"Goles, E., Rapaport, I.: Complexity of tile rotation problems. Theoretical Computer Science\u00a0188, 129\u2013159 (1997)","journal-title":"Theoretical Computer Science"},{"key":"10_CR5","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/s00373-007-0713-4","volume":"23","author":"E.D. Demaine","year":"2007","unstructured":"Demaine, E.D., Demaine, M.L.: Jigsaw puzzles, edge matching, and polyomino packing: Connections and complexity. Graphs and Combinatorics\u00a023, 195\u2013208 (2007)","journal-title":"Graphs and Combinatorics"},{"key":"10_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/978-3-642-11266-9_13","volume-title":"SOFSEM 2010: Theory and Practice of Computer Science","author":"A. Antoniadis","year":"2010","unstructured":"Antoniadis, A., Lingas, A.: Approximability of edge matching puzzles. In: van Leeuwen, J., Muscholl, A., Peleg, D., Pokorn\u00fd, J., Rumpe, B. (eds.) SOFSEM 2010. LNCS, vol.\u00a05901, pp. 153\u2013164. Springer, Heidelberg (2010)"},{"key":"10_CR7","unstructured":"Ebbesen, M.: Analysis of restricted edge-matching problems (2011) Master thesis, Technical University of Denmark, reference no. IMM-M.Sc.-2011-08, \n                  \n                    http:\/\/tinyurl.com\/6jcf7kf"},{"key":"10_CR8","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1145\/800133.804350","volume-title":"Proceedings of the Tenth Annual ACM Symposium on Theory of Computing, STOC 1978","author":"T.J. Schaefer","year":"1978","unstructured":"Schaefer, T.J.: The complexity of satisfiability problems. In: Proceedings of the Tenth Annual ACM Symposium on Theory of Computing, STOC 1978, pp. 216\u2013226. ACM, New York (1978)"},{"key":"10_CR9","first-page":"331","volume-title":"Where the really hard problems","author":"P. Cheeseman","year":"1991","unstructured":"Cheeseman, P., Kanefsky, B., Taylor, W.M.: Where the really hard problems, pp. 331\u2013337. Morgan Kaufmann, San Francisco (1991)"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22953-4_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,31]],"date-time":"2019-03-31T13:27:28Z","timestamp":1554038848000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22953-4_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642229527","9783642229534"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22953-4_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}