{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:27:31Z","timestamp":1760441251675,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":14,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,11,4]],"date-time":"2014-11-04T00:00:00Z","timestamp":1415059200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"SUN Microsystems of Canada"},{"name":"Natural Sciences and Engineering Research Council of Canada"},{"name":"High Performance Computing Virtual Laboratory"},{"name":"DAAD","award":["57052155"],"award-info":[{"award-number":["57052155"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,11,4]]},"DOI":"10.1145\/2666310.2666418","type":"proceedings-article","created":{"date-parts":[[2015,2,3]],"date-time":"2015-02-03T13:43:11Z","timestamp":1422970991000},"page":"381-388","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Minimum backward fr\u00e9chet distance"],"prefix":"10.1145","author":[{"given":"Amin","family":"Gheibi","sequence":"first","affiliation":[{"name":"Carleton University, Ottawa, ON, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anil","family":"Maheshwari","sequence":"additional","affiliation":[{"name":"Carleton University, Ottawa, ON, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00f6rg-R\u00fcdiger","family":"Sack","sequence":"additional","affiliation":[{"name":"Carleton University, Ottawa, ON, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Scheffer","sequence":"additional","affiliation":[{"name":"Westf\u00e4lische, Wilhelms-Universit\u00e4t, M\u00fcnster, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2014,11,4]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218195995000064"},{"key":"e_1_3_2_1_2_1","first-page":"853","volume-title":"K. B\u00f6hm, C. S. Jensen, L. M. Haas, M. L. Kersten, P.-\u00c5","author":"Brakatsoulas S.","year":"2005","unstructured":"S. Brakatsoulas , D. Pfoser , R. Salas , and C. Wenk . On map-matching vehicle tracking data . In K. B\u00f6hm, C. S. Jensen, L. M. Haas, M. L. Kersten, P.-\u00c5 . Larson, and B. C. Ooi, editors, Proceeding of VLDB, pages 853 -- 864 . ACM , 2005 . S. Brakatsoulas, D. Pfoser, R. Salas, and C. Wenk. On map-matching vehicle tracking data. In K. B\u00f6hm, C. S. Jensen, L. M. Haas, M. L. Kersten, P.-\u00c5. Larson, and B. C. Ooi, editors, Proceeding of VLDB, pages 853--864. ACM, 2005."},{"key":"e_1_3_2_1_3_1","first-page":"645","volume-title":"Proceeding of SODA","author":"Buchin K.","year":"2009","unstructured":"K. Buchin , M. Buchin , and Y. Wang . Exact algorithms for partial curve matching via the Fr\u00e9chet distance . In C. Mathieu, editor, Proceeding of SODA , pages 645 -- 654 . SIAM , 2009 . K. Buchin, M. Buchin, and Y. Wang. Exact algorithms for partial curve matching via the Fr\u00e9chet distance. In C. Mathieu, editor, Proceeding of SODA, pages 645--654. SIAM, 2009."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2582112.2582144"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2014.01.002"},{"key":"e_1_3_2_1_6_1","first-page":"293","volume-title":"30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013), volume 20 of Leibniz International Proceedings in Informatics (LIPIcs)","author":"Chen D. Z.","year":"2013","unstructured":"D. Z. Chen and H. Wang . L1 Shortest Path Queries among Polygonal Obstacles in the Plane . In 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013), volume 20 of Leibniz International Proceedings in Informatics (LIPIcs) , pages 293 -- 304 , 2013 . D. Z. Chen and H. Wang. L1 Shortest Path Queries among Polygonal Obstacles in the Plane. In 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013), volume 20 of Leibniz International Proceedings in Informatics (LIPIcs), pages 293--304, 2013."},{"key":"e_1_3_2_1_7_1","unstructured":"Free-space diagram ipelet from G\u00fcnter Rote's homepage http:\/\/www.inf.fu-berlin.de\/inst\/ag-ti\/people\/rote\/Software\/ipelets.html#fsd.  Free-space diagram ipelet from G\u00fcnter Rote's homepage http:\/\/www.inf.fu-berlin.de\/inst\/ag-ti\/people\/rote\/Software\/ipelets.html#fsd."},{"key":"e_1_3_2_1_8_1","first-page":"794","volume-title":"C. Koch, J. Gehrke, M. N. Garofalakis, D. Srivastava, K. Aberer, A. Deshpande, D. Florescu, C. Y. Chan, V. Ganti, C.-C","author":"Gonzalez H.","year":"2007","unstructured":"H. Gonzalez , J. Han , X. Li , M. Myslinska , and J. P. Sondag . Adaptive fastest path computation on a road network: A traffic mining approach . In C. Koch, J. Gehrke, M. N. Garofalakis, D. Srivastava, K. Aberer, A. Deshpande, D. Florescu, C. Y. Chan, V. Ganti, C.-C . Kanne, W. Klas, and E. J. Neuhold, editors, Proceeding of VLDB, pages 794 -- 805 . ACM , 2007 . H. Gonzalez, J. Han, X. Li, M. Myslinska, and J. P. Sondag. Adaptive fastest path computation on a road network: A traffic mining approach. In C. Koch, J. Gehrke, M. N. Garofalakis, D. Srivastava, K. Aberer, A. Deshpande, D. Florescu, C. Y. Chan, V. Ganti, C.-C. Kanne, W. Klas, and E. J. Neuhold, editors, Proceeding of VLDB, pages 794--805. ACM, 2007."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-35973-1_823"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2424321.2424355"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2424321.2424417"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.2307\/2323971"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1653771.1653820"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01758836"}],"event":{"name":"SIGSPATIAL '14: 22nd SIGSPATIAL International Conference on Advances in Geographic Information Systems","sponsor":["ESRI","Yandex","Google Inc.","NVIDIA","University of North Texas University of North Texas","Microsoft Microsoft","ORACLE ORACLE","Facebook Facebook","SIGSPATIAL ACM Special Interest Group on Spatial Information"],"location":"Dallas Texas","acronym":"SIGSPATIAL '14"},"container-title":["Proceedings of the 22nd ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2666310.2666418","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2666310.2666418","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:12:50Z","timestamp":1750227170000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2666310.2666418"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,11,4]]},"references-count":14,"alternative-id":["10.1145\/2666310.2666418","10.1145\/2666310"],"URL":"https:\/\/doi.org\/10.1145\/2666310.2666418","relation":{},"subject":[],"published":{"date-parts":[[2014,11,4]]},"assertion":[{"value":"2014-11-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}