{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T16:29:34Z","timestamp":1743006574311,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319037790"},{"type":"electronic","value":"9783319037806"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-319-03780-6_2","type":"book-chapter","created":{"date-parts":[[2013,11,21]],"date-time":"2013-11-21T01:13:18Z","timestamp":1384996398000},"page":"13-24","source":"Crossref","is-referenced-by-count":0,"title":["Discretely Following a Curve"],"prefix":"10.1007","author":[{"given":"Tim","family":"Wylie","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"2_CR1","unstructured":"Accisano, P., \u00dcng\u00f6r, A.: Hardness results on curve\/point set matching with Fr\u00e9chet distance. In: Proc. of the 29th European Workshop on Computational Geometry, EuroCG 2013, pp. 51\u201354 (March 2013)"},{"key":"2_CR2","unstructured":"Acharyya, R., Manjanna, B., Das, G.K.: Unit disk cover problem. CoRR, abs\/1209.2951 (2012)"},{"key":"2_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1007\/978-3-642-17514-5_36","volume-title":"Algorithms and Computation","author":"H.-K. Ahn","year":"2010","unstructured":"Ahn, H.-K., Knauer, C., Scherfenberg, M., Schlipf, L., Vigneron, A.: Computing the discrete Fr\u00e9chet distance with imprecise input. In: Cheong, O., Chwa, K.-Y., Park, K. (eds.) ISAAC 2010, Part II. LNCS, vol.\u00a06507, pp. 422\u2013433. Springer, Heidelberg (2010)"},{"issue":"2","key":"2_CR4","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1016\/S0196-6774(03)00085-3","volume":"49","author":"H. Alt","year":"2003","unstructured":"Alt, H., Efrat, A., Rote, G., Wenk, C.: Matching planar maps. J. Algorithms\u00a049(2), 262\u2013283 (2003)","journal-title":"J. Algorithms"},{"key":"2_CR5","doi-asserted-by":"publisher","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. International Journal of Computational Geometry and Applications\u00a05, 75\u201391 (1995)","journal-title":"International Journal of Computational Geometry and Applications"},{"key":"2_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/978-3-642-19094-0_16","volume-title":"WALCOM: Algorithms and Computation","author":"G.K. Das","year":"2011","unstructured":"Das, G.K., Fraser, R., L\u00f2pez-Ortiz, A., Nickerson, B.G.: On the discrete unit disk cover problem. In: Katoh, N., Kumar, A. (eds.) WALCOM 2011. LNCS, vol.\u00a06552, pp. 146\u2013157. Springer, Heidelberg (2011)"},{"key":"2_CR7","unstructured":"Eiter, T., Mannila, H.: Computing discrete Fr\u00e9chet distance. Technical Report CD-TR 94\/64, Information Systems Department, Technical University of Vienna (1994)"},{"key":"2_CR8","unstructured":"Fraser, R., L\u00f2pez-Ortiz, A.: The within-strip discrete unit disk cover problem. In: Proc. of the 24th Canadian Conf. on Computational Geometry, CCCG 2012, pp. 53\u201358 (2012)"},{"issue":"1","key":"2_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF03018603","volume":"22","author":"M. Fr\u00e9chet","year":"1906","unstructured":"Fr\u00e9chet, M.: Sur quelques points du calcul fonctionnel. Rendiconti del Circolo Matematico di Palermo (1884 - 1940)\u00a022(1), 1\u201372 (1906)","journal-title":"Rendiconti del Circolo Matematico di Palermo (1884 - 1940)"},{"key":"2_CR10","unstructured":"Jiang, M.: Map Labeling with Circles. PhD thesis, Montana State University (2005)"},{"issue":"2","key":"2_CR11","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1137\/0211025","volume":"11","author":"D. Lichtenstein","year":"1982","unstructured":"Lichtenstein, D.: Planar Formulae and Their Uses. SIAM Journal on Computing\u00a011(2), 329\u2013343 (1982)","journal-title":"SIAM Journal on Computing"},{"key":"2_CR12","unstructured":"Maheshwari, A., Sack, J.-R., Shahbaz, K., Zarrabi-Zadeh, H.: Staying close to a curve. In: Proc. of the 23rd Canadian Conf. on Computational Geometry, CCCG 2011, August 10-12 (2011)"},{"issue":"2","key":"2_CR13","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/j.comgeo.2004.05.004","volume":"30","author":"A. Mosig","year":"2005","unstructured":"Mosig, A., Clausen, M.: Approximately matching polygonal curves with respect to the Fr\u00e9chet distance. Computational Geometry: Theory and Applications\u00a030(2), 113\u2013127 (2005)","journal-title":"Computational Geometry: Theory and Applications"},{"issue":"4","key":"2_CR14","doi-asserted-by":"publisher","first-page":"883","DOI":"10.1007\/s00454-010-9285-9","volume":"44","author":"N.H. Mustafa","year":"2010","unstructured":"Mustafa, N.H., Ray, S.: Improved results on geometric hitting set problems. Discrete and Computational Geometry\u00a044(4), 883\u2013895 (2010)","journal-title":"Discrete and Computational Geometry"},{"key":"2_CR15","unstructured":"Shahbaz, K.: Applied Similarity Problems Using Fr\u00e9chet Distance. PhD thesis, Carleton University (2013)"},{"key":"2_CR16","unstructured":"Wolff, A.: A simple proof for the NP-hardness of edge labeling. Technical Report W-SPNPH-00, Institut f\u00fcr Mathematik und Informatik, Universit\u00e4t Greifswald (2000)"},{"key":"2_CR17","unstructured":"Wylie, T.: The Discrete Fr\u00e9chet Distance with Applications. PhD thesis, Montana State University (2013)"},{"key":"2_CR18","unstructured":"Wylie, T., Zhu, B.: Discretely following a curve (short abstract). In: Computational Geometry: Young Researchers Forum, CG:YRF 2012, pp. 33\u201334 (2012)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-03780-6_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T08:53:19Z","timestamp":1558687999000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-03780-6_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319037790","9783319037806"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-03780-6_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}