{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:52:50Z","timestamp":1725663170785},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540514862"},{"type":"electronic","value":"9783540481768"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-51486-4_76","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T15:58:00Z","timestamp":1330185480000},"page":"291-304","source":"Crossref","is-referenced-by-count":0,"title":["Testing approximate symmetry in the plane is NP-hard"],"prefix":"10.1007","author":[{"given":"Sebastian","family":"Iwanowski","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,25]]},"reference":[{"key":"24_CR1","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/BF02187910","volume":"3","author":"H. Alt","year":"1988","unstructured":"Helmut Alt \/ Kurt Mehlhorn \/ Hubert Wagener \/ Emo Welzl: Congruence, Similarity, and Symmetries of Geometric Objects, Discrete Comput. Geom. 3 pp.237\u2013256, 1988","journal-title":"Discrete Comput. Geom."},{"key":"24_CR2","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/BF00977833","volume":"13","author":"Mikhail J. J. Atallah","year":"1984","unstructured":"Mikhail J. Atallah: Checking Similarity of Planar Figures, International J. Comp. Inf. Science 13 pp. 279\u2013290, 1984","journal-title":"International J. Comp. Inf. Science"},{"key":"24_CR3","doi-asserted-by":"crossref","first-page":"663","DOI":"10.1109\/TC.1985.1676605","volume":"34","author":"Mikhail J. J. Atallah","year":"1985","unstructured":"Mikhail J. Atallah: On Symmetry Detection, IEEE Trans. Comput. 34 pp. 663\u2013666, 1985","journal-title":"IEEE Trans. Comput."},{"key":"24_CR4","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/0196-6774(87)90036-8","volume":"8","author":"M. D. Atkinson","year":"1987","unstructured":"M. D. Atkinson: An Optimal Algorithm for Geometrical Congruence, J. Algorithms 8 pp. 159\u2013172, 1987","journal-title":"J. Algorithms"},{"key":"24_CR5","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1016\/0196-6774(86)90002-7","volume":"7","author":"M. E. Dyer","year":"1986","unstructured":"M. E. Dyer \/ A. M. Frieze: Planar 3DM is NP-Complete, J. Algorithms 7 pp. 174\u2013184, 1986","journal-title":"J. Algorithms"},{"key":"24_CR6","unstructured":"Michael R. Garey \/ David S. Johnson: Computers and Intractability \u2014 A Guide to the Theory of NP-Completeness, Freeman, 1979"},{"key":"24_CR7","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/0020-0190(86)90097-9","volume":"22","author":"P. T. Highnam","year":"1986","unstructured":"P. T. Highnam: Optimal Algorithms for Finding the Symmetries of a Planar Point Set, Information Processing Letters 22 pp. 219\u2013222, 1986","journal-title":"Information Processing Letters"},{"key":"24_CR8","doi-asserted-by":"crossref","unstructured":"Sebastian Iwanowski: Linear Time Algorithms for Testing Approximate Congruence in the Plane, Proceedings of the Workshop on Graph Theoretic Concepts 88, Lecture Notes in Computer Science 344, pp. 213\u2013228","DOI":"10.1007\/3-540-50728-0_45"},{"issue":"2","key":"24_CR9","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1137\/0211025","volume":"11","author":"D. Lichtenstein","year":"1982","unstructured":"David Lichtenstein: Planar Formulae and their Uses, SIAM J. Comp. 11,2 pp.329\u2013343, 1982","journal-title":"SIAM J. Comp."},{"key":"24_CR10","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1007\/BF02187706","volume":"1","author":"P. Rosenstiehl","year":"1986","unstructured":"Pierre Rosenstiehl \/ Robert Tarjan: Rectilinear Planar Layouts and Bipolar Orientations of Planar Graphs, Discrete Comput. Geom. 1 pp.343\u2013353, 1986","journal-title":"Discrete Comput. Geom."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1989"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-51486-4_76.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:03:26Z","timestamp":1619557406000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-51486-4_76"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540514862","9783540481768"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-51486-4_76","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]}}}