{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:20:44Z","timestamp":1750306844039,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":18,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,6,8]],"date-time":"2014-06-08T00:00:00Z","timestamp":1402185600000},"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":[[2014,6,8]]},"DOI":"10.1145\/2582112.2582144","type":"proceedings-article","created":{"date-parts":[[2014,5,2]],"date-time":"2014-05-02T14:01:31Z","timestamp":1399039291000},"page":"367-376","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Computing the Fr\u00e9chet distance with shortcuts is NP-hard"],"prefix":"10.1145","author":[{"given":"Maike","family":"Buchin","sequence":"first","affiliation":[{"name":"Faculty of Mathematics, Ruhr-University Bochum"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anne","family":"Driemel","sequence":"additional","affiliation":[{"name":"Dep. Mathematics and Computer Science, TU Eindhoven"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bettina","family":"Speckmann","sequence":"additional","affiliation":[{"name":"Dep. Mathematics and Computer Science, TU Eindhoven"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2014,6,8]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-005-1165-y"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0196-6774(03)00085-3"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218195995000064"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2582112.2582155"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/1792918.1792972"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/1083592.1083691"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1463434.1463476"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218195911003652"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973402.103"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/1496770.1496841"},{"key":"e_1_3_2_1_11_1","volume-title":"Computing the Fr\u00e9chet distance with shortcuts is NP-hard. CoRR, abs\/1307.2097","author":"Buchin M.","year":"2013","unstructured":"M. Buchin , A. Driemel , and B. Speckmann . Computing the Fr\u00e9chet distance with shortcuts is NP-hard. CoRR, abs\/1307.2097 , 2013 . M. Buchin, A. Driemel, and B. Speckmann. Computing the Fr\u00e9chet distance with shortcuts is NP-hard. CoRR, abs\/1307.2097, 2013."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2005.08.003"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2014.01.002"},{"key":"e_1_3_2_1_15_1","first-page":"318","volume-title":"Proc. 23rd ACM-SIAM Sympos. Discrete Algorithms","author":"Driemel A.","year":"2011","unstructured":"A. Driemel and S. Har-Peled . Jaywalking your dog -- computing the Fr\u00e9chet distance with shortcuts . In Proc. 23rd ACM-SIAM Sympos. Discrete Algorithms , pages 318 -- 337 , 2011 . A. Driemel and S. Har-Peled. Jaywalking your dog -- computing the Fr\u00e9chet distance with shortcuts. In Proc. 23rd ACM-SIAM Sympos. Discrete Algorithms, pages 318--337, 2011."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-012-9402-z"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/648003.743125"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-35589-8_25"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-30191-9_27"}],"event":{"name":"SOCG'14: Annual Symposium on Computational Geometry","sponsor":["SIGGRAPH ACM Special Interest Group on Computer Graphics and Interactive Techniques","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Kyoto Japan","acronym":"SOCG'14"},"container-title":["Proceedings of the thirtieth annual symposium on Computational geometry"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2582112.2582144","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2582112.2582144","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:10:09Z","timestamp":1750234209000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2582112.2582144"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6,8]]},"references-count":18,"alternative-id":["10.1145\/2582112.2582144","10.1145\/2582112"],"URL":"https:\/\/doi.org\/10.1145\/2582112.2582144","relation":{},"subject":[],"published":{"date-parts":[[2014,6,8]]},"assertion":[{"value":"2014-06-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}