{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T14:36:09Z","timestamp":1787495769504,"version":"build-2736575974"},"publisher-location":"New York, NY, USA","reference-count":37,"publisher":"ACM","license":[{"start":{"date-parts":[[2004,6,13]],"date-time":"2004-06-13T00:00:00Z","timestamp":1087084800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2004,6,13]]},"DOI":"10.1145\/1007352.1007398","type":"proceedings-article","created":{"date-parts":[[2004,7,20]],"date-time":"2004-07-20T11:55:38Z","timestamp":1090324538000},"page":"272-280","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":20,"title":["Low distortion maps between point sets"],"prefix":"10.1145","author":[{"given":"Claire","family":"Kenyon","sequence":"first","affiliation":[{"name":"Ecole Polytechnique, Palaiseau Cedex, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yuval","family":"Rabani","sequence":"additional","affiliation":[{"name":"Technion, Israel Institute of Technology, Haifa, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alistair","family":"Sinclair","sequence":"additional","affiliation":[{"name":"University of California, Berkeley, CA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2004,6,13]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(02)00282-2"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/800070.802206"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/34.993558"},{"key":"e_1_3_2_1_4_1","volume-title":"On approximation intractability of the bandwidth problem. ECCC technical report number TR98-014","author":"Blache G.","year":"1998","unstructured":"G. Blache , M. Karpinski , and J. Wirtgen . On approximation intractability of the bandwidth problem. ECCC technical report number TR98-014 , 1998 . G. Blache, M. Karpinski, and J. Wirtgen. On approximation intractability of the bandwidth problem. ECCC technical report number TR98-014, 1998."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(99)00181-4"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/780542.780620"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190060302"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-04295-9","volume-title":"Geometry of Cuts and Metrics","author":"Deza M.","year":"1997","unstructured":"M. Deza and M. Laurent . Geometry of Cuts and Metrics . Springer , Algorithms and Combinatorics, Vol. 15 , 1997 . M. Deza and M. Laurent. Geometry of Cuts and Metrics. Springer, Algorithms and Combinatorics, Vol. 15, 1997."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/568522.568523"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2003.1214417"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1090\/dimacs\/049\/04"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1999.1682"},{"key":"e_1_3_2_1_13_1","volume-title":"November","author":"Feige U.","year":"1998","unstructured":"U. Feige and R. Krauthgamer . Improved performance guarantees for bandwidth minimization heuristics. Unpublished manuscript , November 1998 . U. Feige and R. Krauthgamer. Improved performance guarantees for bandwidth minimization heuristics. Unpublished manuscript, November 1998."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/0134037"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/322077.322090"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.2000.1118"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02090396"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/276884.276911"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/800119.803896"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793260726"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/34.232073"},{"key":"e_1_3_2_1_23_1","volume-title":"FOCS '01 tutorial.","author":"Indyk P.","unstructured":"P. Indyk . Algorithmic aspects of geometric embeddings . FOCS '01 tutorial. Available at http:\/\/theory. lcs. mit. edu\/ indyk\/tut. html. P. Indyk. Algorithmic aspects of geometric embeddings. FOCS '01 tutorial. Available at http:\/\/theory. lcs. mit. edu\/ indyk\/tut. html."},{"key":"e_1_3_2_1_24_1","volume-title":"North-Holland","author":"Johnson W. B.","year":"2003","unstructured":"W. B. Johnson and J. Lindenstrauss (editors). Handbook of the Geometry of Banach Spaces . North-Holland , 2003 . W. B. Johnson and J. Lindenstrauss (editors). Handbook of the Geometry of Banach Spaces. North-Holland, 2003."},{"key":"e_1_3_2_1_25_1","volume-title":"An approximation algorithm for the bandwidth problem on dense graphs. ECCC technical report number TR97-017","author":"Karpinski M.","year":"1997","unstructured":"M. Karpinski , J. Wirtgen , and A. Zelikovsky . An approximation algorithm for the bandwidth problem on dense graphs. ECCC technical report number TR97-017 , 1997 . M. Karpinski, J. Wirtgen, and A. Zelikovsky. An approximation algorithm for the bandwidth problem on dense graphs. ECCC technical report number TR97-017, 1997."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0333-9","volume-title":"The Graph Isomorphism Problem: Its Structural Complexity. Progress in Theoretical Computer Science","author":"Kobler J.","year":"1993","unstructured":"J. Kobler , U. Schoning , and J. Toran . The Graph Isomorphism Problem: Its Structural Complexity. Progress in Theoretical Computer Science , Birkhauser , 1993 . J. Kobler, U. Schoning, and J. Toran. The Graph Isomorphism Problem: Its Structural Complexity. Progress in Theoretical Computer Science, Birkhauser, 1993."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(87)90028-9"},{"key":"e_1_3_2_1_28_1","first-page":"573","volume-title":"Proc. of the International Congress of Mathematicians III","author":"Linial N.","year":"2002","unstructured":"N. Linial . Finite metric spaces --- combinatorics, geometry and algorithms . In Proc. of the International Congress of Mathematicians III , Beijing , 2002 , pages 573 -- 586 . N. Linial. Finite metric spaces --- combinatorics, geometry and algorithms. In Proc. of the International Congress of Mathematicians III, Beijing, 2002, pages 573--586."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/sfcs.1994.365733"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(82)90009-5"},{"key":"e_1_3_2_1_31_1","volume-title":"Manuscript","author":"Marcus A.","year":"2003","unstructured":"A. Marcus and G. Tardos . Excluded permutation matrices and the Stanley-Wilf conjecture . Manuscript , November 2003 . Available at http:\/\/www. renyi. hu\/ tardos\/submatrix. ps A. Marcus and G. Tardos. Excluded permutation matrices and the Stanley-Wilf conjecture. Manuscript, November 2003. Available at http:\/\/www. renyi. hu\/ tardos\/submatrix. ps"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-0039-7","volume-title":"Lectures on Discrete Geometry","author":"Matousek J.","year":"2002","unstructured":"J. Matousek . Lectures on Discrete Geometry . Springer , Graduate Texts in Mathematics, Vol. 212 , 2002 . J. Matousek. Lectures on Discrete Geometry. Springer, Graduate Texts in Mathematics, Vol. 212, 2002."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/800141.804670"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1137\/0607057"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02280884"},{"key":"e_1_3_2_1_36_1","volume-title":"Preprint","author":"Papadimitriou C. H.","year":"2004","unstructured":"C. H. Papadimitriou and S. Safra . The complexity of low-distortion embeddings between point sets . Preprint , February 2004 . Available at http:\/\/www. cs. berkeley. edu\/ christos C. H. Papadimitriou and S. Safra. The complexity of low-distortion embeddings between point sets. Preprint, February 2004. Available at http:\/\/www. cs. berkeley. edu\/ christos"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1137\/0601042"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.5555\/795664.796465"}],"event":{"name":"STOC04: Symposium of Theory of Computing 2004","location":"Chicago IL USA","acronym":"STOC04","sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the thirty-sixth annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1007352.1007398","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1007352.1007398","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:23:56Z","timestamp":1750253036000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1007352.1007398"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,6,13]]},"references-count":37,"alternative-id":["10.1145\/1007352.1007398","10.1145\/1007352"],"URL":"https:\/\/doi.org\/10.1145\/1007352.1007398","relation":{},"subject":[],"published":{"date-parts":[[2004,6,13]]},"assertion":[{"value":"2004-06-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}