{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:40:56Z","timestamp":1740109256274,"version":"3.37.3"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2017,8,7]],"date-time":"2017-08-07T00:00:00Z","timestamp":1502064000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2018,9]]},"DOI":"10.1007\/s00453-017-0352-y","type":"journal-article","created":{"date-parts":[[2017,8,7]],"date-time":"2017-08-07T08:49:51Z","timestamp":1502095791000},"page":"2616-2636","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Fr\u00e9chet Distance Between a Line and Avatar Point Set"],"prefix":"10.1007","volume":"80","author":[{"given":"Aritra","family":"Banik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fahad","family":"Panolan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Venkatesh","family":"Raman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3188-5625","authenticated-orcid":false,"given":"Vibha","family":"Sahlot","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,8,7]]},"reference":[{"key":"352_CR1","unstructured":"Aronov, B., Har-Peled, S., Knauer, C., Wang, Y., Wenk, C.: Fr\u00e9chet distance for curves, revisited. In: Proceedings of Algorithms\u2013ESA 2006, 14th Annual European Symposium, Zurich, Switzerland, September 11\u201313, 2006, pp. 52\u201363 (2006)"},{"key":"352_CR2","unstructured":"Eiter, T., Mannila, H.: Computing discrete fr\u00e9chet distance. Technical report, Citeseer (1994)"},{"key":"352_CR3","unstructured":"Hausdorff, F.: Grundzge der Mengenlehre. Veit and Company, Leipzig. Das Hauptwerk von Felix Hausdorff (1914)"},{"issue":"8","key":"352_CR4","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1016\/j.jcss.2009.04.001","volume":"75","author":"HL Bodlaender","year":"2009","unstructured":"Bodlaender, H.L., Downey, R.G., Fellows, M.R., Hermelin, D.: On problems without polynomial kernels. J. Comput. Syst. Sci. 75(8), 423\u2013434 (2009)","journal-title":"J. Comput. Syst. Sci."},{"key":"352_CR5","doi-asserted-by":"crossref","unstructured":"Dell, H., van Melkebeek, D.: Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses. In: STOC, pp. 251\u2013260 (2010)","DOI":"10.1145\/1806689.1806725"},{"key":"352_CR6","doi-asserted-by":"crossref","unstructured":"Fortnow, L., Santhanam, R.: Infeasibility of instance compression and succinct PCPs for NP. In: STOC, pp. 133\u2013142 (2008)","DOI":"10.1145\/1374376.1374398"},{"key":"352_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., Fomin, F.V., Kowalik, L., Lokshtanov, D., Marx, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Parameterized Algorithms. Springer, Berlin (2015)"},{"key":"352_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4471-5559-1","volume-title":"Fundamentals of Parameterized Complexity","author":"R Downey","year":"2013","unstructured":"Downey, R., Fellows, M.: Fundamentals of Parameterized Complexity. Springer, Berlin (2013)"},{"key":"352_CR9","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1142\/S0218195995000064","volume":"5","author":"H Alt","year":"1995","unstructured":"Alt, H., Godau, M.: Computing the Fr\u00e9chet distance between two polygonal curves. Int. J. Comput. Geom. Appl. 5, 75\u201391 (1995)","journal-title":"Int. J. Comput. Geom. Appl."},{"issue":"2","key":"352_CR10","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1137\/130920526","volume":"43","author":"PK Agarwal","year":"2014","unstructured":"Agarwal, P.K., Avraham, R.B., Kaplan, H., Sharir, M.: Computing the discrete Fr\u00e9chet distance in subquadratic time. SIAM J. Comput. 43(2), 429\u2013449 (2014)","journal-title":"SIAM J. Comput."},{"key":"352_CR11","unstructured":"Shahbaz, K.: Applied similarity problems using Fr\u00e9chet distance. CoRR abs\/1307.6628 (2013)"},{"key":"352_CR12","unstructured":"Consuegra, M.E., Narasimhan, G.: Geometric avatar problems. In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2013, December 12\u201314, 2013, Guwahati, India, pp. 389\u2013400 (2013)"},{"key":"352_CR13","doi-asserted-by":"crossref","unstructured":"Arkin, E.M., Banik, A., Carmi, P., Citovsky, G., Katz, M.J., Mitchell, J.S.B., Simakov, M.: Choice is hard. In: Proceedings of Algorithms and Computation\u201426th International Symposium, ISAAC 2015, Nagoya, Japan, December 9\u201311, 2015, pp. 318\u2013328 (2015)","DOI":"10.1007\/978-3-662-48971-0_28"},{"key":"352_CR14","unstructured":"Arkin, E.M., Banik, A., Carmi, P., Citovsky, G., Katz, M.J., Mitchell, J.S.B., Simakov, M.: Conflict-free covering. In: Proceedings of the 27th Canadian Conference on Computational Geometry, CCCG 2015, Kingston, Ontario, Canada, August 10\u201312, 2015 (2015)"},{"key":"352_CR15","volume-title":"Davenport\u2013Schinzel Sequences and Their Geometric Applications","author":"PK Agarwal","year":"1995","unstructured":"Agarwal, P.K., Sharir, M.: Davenport\u2013Schinzel Sequences and Their Geometric Applications. Duke University, Durham (1995)"},{"issue":"12","key":"352_CR16","doi-asserted-by":"crossref","first-page":"1171","DOI":"10.1016\/0898-1221(85)90105-1","volume":"11","author":"MJ Atallah","year":"1985","unstructured":"Atallah, M.J.: Some dynamic computational geometry problems. Comput. Math. Appl. 11(12), 1171\u20131181 (1985)","journal-title":"Comput. Math. Appl."},{"issue":"4","key":"352_CR17","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0020-0190(89)90136-1","volume":"33","author":"J Hershberger","year":"1989","unstructured":"Hershberger, J.: Finding the upper envelope of n line segments in o (n log n) time. Inf. Process. Lett. 33(4), 169\u2013174 (1989)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"352_CR18","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1112\/jlms\/s1-10.37.26","volume":"s1\u201310","author":"P Hall","year":"1935","unstructured":"Hall, P.: On representatives of subsets. J. Lond. Math. Soc. s1\u201310(1), 26\u201330 (1935)","journal-title":"J. Lond. Math. Soc."},{"key":"352_CR19","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511808241","volume-title":"How to Think About Algorithms","author":"J Edmonds","year":"2008","unstructured":"Edmonds, J.: How to Think About Algorithms. Cambridge University Press, New York (2008)"},{"key":"352_CR20","doi-asserted-by":"crossref","unstructured":"Naor, M., Schulman, L.J., Srinivasan, A.: Splitters and near-optimal derandomization. In: 36th Annual Symposium on Foundations of Computer Science, Milwaukee, Wisconsin, 23\u201325 October 1995, pp. 182\u2013191 (1995)","DOI":"10.1109\/SFCS.1995.492475"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-017-0352-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-017-0352-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-017-0352-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,5,22]],"date-time":"2018-05-22T10:53:26Z","timestamp":1526986406000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-017-0352-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8,7]]},"references-count":20,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2018,9]]}},"alternative-id":["352"],"URL":"https:\/\/doi.org\/10.1007\/s00453-017-0352-y","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"type":"print","value":"0178-4617"},{"type":"electronic","value":"1432-0541"}],"subject":[],"published":{"date-parts":[[2017,8,7]]}}}