{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T16:41:41Z","timestamp":1725813701675},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319135236"},{"type":"electronic","value":"9783319135243"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-13524-3_5","type":"book-chapter","created":{"date-parts":[[2014,12,2]],"date-time":"2014-12-02T12:51:38Z","timestamp":1417524698000},"page":"51-62","source":"Crossref","is-referenced-by-count":0,"title":["The Parameterized Complexity of Geometric Graph Isomorphism"],"prefix":"10.1007","author":[{"given":"Vikraman","family":"Arvind","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gaurav","family":"Rattan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,12,3]]},"reference":[{"key":"5_CR1","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/S0022-4049(97)00014-5","volume":"117\u2013118","author":"SA Evdokimov","year":"1997","unstructured":"Evdokimov, S.A., Ponomarenko, I.N.: On the geometric graph isomorphism problem. Pure Appl. Algebra 117\u2013118, 253\u2013276 (1997)","journal-title":"Pure Appl. Algebra"},{"issue":"4","key":"5_CR2","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/S0925-7721(97)00010-2","volume":"9","author":"T Akutsu","year":"1998","unstructured":"Akutsu, T.: On determining the congruence of point sets in d dimensions. Comput. Geom. 9(4), 247\u2013256 (1998)","journal-title":"Comput. Geom."},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Bra\u00df, P., Knauer, C.: Testing the congruence of d-dimensional point sets. In: Symposium on Computational Geometry, pp. 310\u2013314 (2000)","DOI":"10.1145\/336154.336217"},{"key":"5_CR4","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/BF02187910","volume":"3","author":"H Alt","year":"1988","unstructured":"Alt, H., Mehlhorn, K., Wagener, H., Welzl, E.: Congruence, similarity, and symmetries of geometric objects. Discrete Comput. Geom. 3, 237\u2013256 (1988)","journal-title":"Discrete Comput. Geom."},{"key":"5_CR5","unstructured":"Papadimitriou, C.H., Safra, S.: The complexity of low-distortion embeddings between point sets. In: Proceedings of the 16th ACM SODA Conference, pp. 112\u2013118 (2005)"},{"issue":"3","key":"5_CR6","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1137\/100811970","volume":"42","author":"D Micciancio","year":"2013","unstructured":"Micciancio, D., Voulgaris, P.: A deterministic single exponential time algorithm for most lattice problems based on voronoi cell computations. SIAM J. Comput. 42(3), 1364\u20131391 (2013)","journal-title":"SIAM J. Comput."},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Haviv, I., Regev, O.: On the lattice isomorphism problem. In: Proceedings of the 25th Annual ACM-SIAM Conference, SODA 2014, pp. 391\u2013404 (2014)","DOI":"10.1137\/1.9781611973402.29"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Babai, L., Luks, E.M.: Canonical labeling of graphs. In: Proceedings of the ACM STOC Conference, pp. 171\u2013183 (1983)","DOI":"10.1145\/800061.808746"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"Furst, M.L., Hopcroft, J.E., Luks, E.M.: Polynomial-time algorithms for permutation groups. In: Proceedings of the 21st IEEE FOCS Conference, pp. 36\u201341 (1980)","DOI":"10.1109\/SFCS.1980.34"},{"key":"5_CR10","series-title":"Discrete Mathematics and Optimization","volume-title":"Theory of Integer and Linear Programming","author":"A Schrijver","year":"1998","unstructured":"Schrijver, A.: Theory of Integer and Linear Programming. Discrete Mathematics and Optimization. Wiley-Interscience, New York (1998)"},{"key":"5_CR11","unstructured":"Corbalan, A.G., Mazon, M., Recio, T.: About voronoi diagrams for strictly convex distances. In: 9th European Workshop on Computational Geometry (1993)"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Luks, E.M.: Hypergraph isomorphism and structural equivalence of boolean functions. In: Proceedings of the 31st ACM STOC Conference, pp. 652\u2013658 (1999)","DOI":"10.1145\/301250.301427"}],"container-title":["Lecture Notes in Computer Science","Parameterized and Exact Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-13524-3_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T18:50:00Z","timestamp":1559069400000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-13524-3_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319135236","9783319135243"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-13524-3_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}