{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T03:52:34Z","timestamp":1742961154705,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030835071"},{"type":"electronic","value":"9783030835088"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-83508-8_5","type":"book-chapter","created":{"date-parts":[[2021,7,30]],"date-time":"2021-07-30T13:05:06Z","timestamp":1627650306000},"page":"57-70","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Pattern Matching in Doubling Spaces"],"prefix":"10.1007","author":[{"given":"Corentin","family":"Allair","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3586-3431","authenticated-orcid":false,"given":"Antoine","family":"Vigneron","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,7,31]]},"reference":[{"key":"5_CR1","unstructured":"Allair, C., Vigneron, A.: Pattern matching in doubling spaces. CoRR abs\/2012.10919 (2020)"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Alt, H., Guibas, L.J.: Discrete geometric shapes: Matching, interpolation, and approximation. In: Handbook of Computational Geometry, pp. 121\u2013153. Elsevier (2000)","DOI":"10.1016\/B978-044482537-7\/50004-8"},{"issue":"3","key":"5_CR3","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/BF02187910","volume":"3","author":"H Alt","year":"1988","unstructured":"Alt, H., Mehlhorn, K., Wagener, H., Welzl, E.: Congruence, similarity, and symmetries of geometric objects. Discrete Comput. Geom. 3(3), 237\u2013256 (1988). https:\/\/doi.org\/10.1007\/BF02187910","journal-title":"Discrete Comput. Geom."},{"key":"5_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/978-3-540-87744-8_10","volume-title":"Algorithms - ESA 2008","author":"S Arya","year":"2008","unstructured":"Arya, S., Mount, D.M., Vigneron, A., Xia, J.: Space-time tradeoffs for proximity searching in doubling spaces. In: Halperin, D., Mehlhorn, K. (eds.) ESA 2008. LNCS, vol. 5193, pp. 112\u2013123. Springer, Berlin, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-87744-8_10"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Borradaile, G., Le, H., Wulff-Nilsen, C.: Greedy spanners are optimal in doubling metrics. In: Proceedings of Symposium on Discrete Algorithms, pp. 2371\u20132379 (2019)","DOI":"10.1137\/1.9781611975482.145"},{"issue":"4","key":"5_CR6","doi-asserted-by":"publisher","first-page":"1705","DOI":"10.1137\/16M1107206","volume":"47","author":"TH Chan","year":"2018","unstructured":"Chan, T.H., Hu, S., Jiang, S.H.: A PTAS for the Steiner forest problem in doubling metrics. SIAM J. Comput. 47(4), 1705\u20131734 (2018)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"5_CR7","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1137\/130930984","volume":"44","author":"TH Chan","year":"2015","unstructured":"Chan, T.H., Li, M., Ning, L., Solomon, S.: New doubling spanners: better and simpler. SIAM J. Comput. 44(1), 37\u201353 (2015)","journal-title":"SIAM J. Comput."},{"key":"5_CR8","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/0925-7721(95)00047-X","volume":"7","author":"LP Chew","year":"1997","unstructured":"Chew, L.P., Goodrich, M.T., Huttenlocher, D.P., Kedem, K., Kleinberg, J.M., Kravets, D.: Geometric pattern matching under Euclidean motion. Comput. Geom. 7, 113\u2013124 (1997)","journal-title":"Comput. Geom."},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"Cole, R., Gottlieb, L.: Searching dynamic point sets in spaces with bounded doubling dimension. In: Proceedings of ACM Symposium on Theory of Computing, pp. 574\u2013583 (2006)","DOI":"10.1145\/1132516.1132599"},{"key":"5_CR10","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2009","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. MIT Press, Cambridge (2009)","edition":"3"},{"issue":"3","key":"5_CR11","doi-asserted-by":"publisher","first-page":"18:1","DOI":"10.1145\/3051094","volume":"64","author":"M Cygan","year":"2017","unstructured":"Cygan, M., et al.: Tight lower bounds on graph embedding problems. J. ACM 64(3), 18:1-18:22 (2017)","journal-title":"J. ACM"},{"key":"5_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3_15","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., et al.: Parameterized Algorithms. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21275-3_15"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Ding, H., Ye, M.: On geometric alignment in low doubling dimension. In: Proceedings of AAAI Conference on Artificial Intelligence, pp. 1460\u20131467 (2019)","DOI":"10.1609\/aaai.v33i01.33011460"},{"key":"5_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/978-3-642-02927-1_39","volume-title":"Proceedings of International Colloquium on Automata Languages and Programming","author":"MR Fellows","year":"2009","unstructured":"Fellows, M.R., Fomin, F.V., Lokshtanov, D., Losievskaja, E., Rosamond, F.A., Saurabh, S.: Distortion is fixed parameter tractable. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol. 5555, pp. 463\u2013474. Springer, Berlin, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02927-1_39"},{"issue":"2","key":"5_CR15","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1137\/17M1127181","volume":"48","author":"Z Friggstad","year":"2019","unstructured":"Friggstad, Z., Rezapour, M., Salavatipour, M.R.: Local search yields a PTAS for k-means in doubling metrics. SIAM J. Comput. 48(2), 452\u2013480 (2019)","journal-title":"SIAM J. Comput."},{"key":"5_CR16","unstructured":"Gottlieb, L., Roditty, L.: Improved algorithms for fully dynamic geometric spanners and geometric routing. In: Proceedings of ACM-SIAM Symposium on Discrete Algorithms, pp. 591\u2013600 (2008)"},{"key":"5_CR17","unstructured":"Gupta, A., Krauthgamer, R., Lee, J.R.: Bounded geometries, fractals, and low-distortion embeddings. In: Proceedings of IEEE Symposium on Foundations of Computer Science, pp. 534\u2013543 (2003)"},{"key":"5_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/11538462_10","volume-title":"Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques","author":"A Hall","year":"2005","unstructured":"Hall, A., Papadimitriou, C.: Approximating the distortion. In: Chekuri, C., Jansen, K., Rolim, J.D.P., Trevisan, L. (eds.) APPROX 2005, RANDOM 2005. LNCS, vol. 3624, pp. 111\u2013122. Springer, Berlin, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11538462_10"},{"issue":"5","key":"5_CR19","doi-asserted-by":"publisher","first-page":"1148","DOI":"10.1137\/S0097539704446281","volume":"35","author":"S Har-Peled","year":"2006","unstructured":"Har-Peled, S., Mendel, M.: Fast construction of nets in low-dimensional metrics and their applications. SIAM J. Comput. 35(5), 1148\u20131184 (2006)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"5_CR20","doi-asserted-by":"publisher","first-page":"1617","DOI":"10.1137\/080712921","volume":"39","author":"C Kenyon","year":"2009","unstructured":"Kenyon, C., Rabani, Y., Sinclair, A.: Low distortion maps between point sets. SIAM J. Comput. 39(4), 1617\u20131636 (2009)","journal-title":"SIAM J. Comput."},{"key":"5_CR21","unstructured":"Kerber, M., Nigmetov, A.: Metric spaces with expensive distances. CoRR abs\/1901.08805 (2019)"},{"key":"5_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/978-3-540-74208-1_16","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"S Khot","year":"2007","unstructured":"Khot, S., Saket, R.: Hardness of embedding metric spaces of equal size. In: Charikar, M., Jansen, K., Reingold, O., Rolim, J.D.P. (eds.) APPROX 2007, RANDOM 2007. LNCS, vol. 4627, pp. 218\u2013227. Springer, Berlin, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74208-1_16"},{"key":"5_CR23","unstructured":"Krauthgamer, R., Lee, J.R.: Navigating nets: simple algorithms for proximity search. In: Proceedings of ACM-SIAM Symposium on Discrete Algorithms, pp. 798\u2013807 (2004)"},{"key":"5_CR24","doi-asserted-by":"crossref","unstructured":"Nayyeri, A., Raichel, B.: Reality distortion: Exact and approximate algorithms for embedding into the line. In: Proceedings of IEEE Symposium on Foundations of Computer Science, pp. 729\u2013747 (2015)","DOI":"10.1109\/FOCS.2015.50"},{"key":"5_CR25","doi-asserted-by":"crossref","unstructured":"Talwar, K.: Bypassing the embedding: algorithms for low dimensional metrics. In: Proceedings of ACM Symposium on Theory of Computing, pp. 281\u2013290 (2004)","DOI":"10.1145\/1007352.1007399"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-83508-8_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,18]],"date-time":"2022-02-18T11:25:28Z","timestamp":1645183528000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-83508-8_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030835071","9783030835088"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-83508-8_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"31 July 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WADS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Workshop on Algorithms and Data Structures","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 August 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 August 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wads2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/projects.cs.dal.ca\/wads2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"123","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"47","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"38% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.1","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"13","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}