{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T05:03:06Z","timestamp":1750309386939,"version":"3.41.0"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2017,6,6]],"date-time":"2017-06-06T00:00:00Z","timestamp":1496707200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100006221","name":"United States-Israel Binational Science Foundation (IL)","doi-asserted-by":"publisher","award":["2012\/229"],"award-info":[{"award-number":["2012\/229"]}],"id":[{"id":"10.13039\/100006221","id-type":"DOI","asserted-by":"publisher"}]},{"name":"ESF EUROCORES programme Euro-GIGA-VORONOI, (DFG)","award":["RO 2338\/5-1"],"award-info":[{"award-number":["RO 2338\/5-1"]}]},{"name":"Obra Social La Caixa and DAAD"},{"name":"Hungarian National Science Fund (OTKA)","award":["PD 108406"],"award-info":[{"award-number":["PD 108406"]}]},{"name":"EUROGIGA project GraDR 10-EuroGIGA-OP-003","award":["NN 102029","NK 78439"],"award-info":[{"award-number":["NN 102029","NK 78439"]}]},{"DOI":"10.13039\/501100003825","name":"Hungarian Academy of Sciences","doi-asserted-by":"crossref","award":["J\u00e1nos Bolyai Research Scholarship"],"award-info":[{"award-number":["J\u00e1nos Bolyai Research Scholarship"]}],"id":[{"id":"10.13039\/501100003825","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001655","name":"DAAD","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100001655","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation (IL)","doi-asserted-by":"publisher","award":["892\/13"],"award-info":[{"award-number":["892\/13"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Israeli Centers for Research Excellence (I-CORE) program","award":["center no.\u00a04\/11"],"award-info":[{"award-number":["center no.\u00a04\/11"]}]},{"name":"Hermann Minkowski\u2013MINERVA Center for Geometry at Tel Aviv University"},{"name":"Deutsch Institute"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2018,8]]},"DOI":"10.1007\/s00453-017-0326-0","type":"journal-article","created":{"date-parts":[[2017,6,6]],"date-time":"2017-06-06T13:59:30Z","timestamp":1496757570000},"page":"2400-2421","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Partial-Matching RMS Distance Under Translation: Combinatorics and Algorithms"],"prefix":"10.1007","volume":"80","author":[{"given":"Rinat","family":"Ben-Avraham","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5156-7953","authenticated-orcid":false,"given":"Matthias","family":"Henze","sequence":"additional","affiliation":[]},{"given":"Rafel","family":"Jaume","sequence":"additional","affiliation":[]},{"given":"Bal\u00e1zs","family":"Keszegh","sequence":"additional","affiliation":[]},{"given":"Orit E.","family":"Raz","sequence":"additional","affiliation":[]},{"given":"Micha","family":"Sharir","sequence":"additional","affiliation":[]},{"given":"Igor","family":"Tubis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,6,6]]},"reference":[{"key":"326_CR1","doi-asserted-by":"crossref","first-page":"689","DOI":"10.2307\/2998580","volume":"3","author":"A Abdulkadiro\u011flu","year":"1998","unstructured":"Abdulkadiro\u011flu, A., S\u00f6nmez, T.: Random serial dictatorship and the core from random endowments in house allocation problems. Econometrica 3, 689\u2013701 (1998)","journal-title":"Econometrica"},{"key":"326_CR2","unstructured":"Agarwal, P.K., Phillips, J.M.: On bipartite matching under the RMS distance. In: Proceedings of 18th Canadian Conference on Computational Geometry (CCCG\u201906), pp. 143\u2013146 (2006)"},{"key":"326_CR3","doi-asserted-by":"crossref","unstructured":"Asinowski, A., Keszegh, B., Miltzow, T.: Counting houses of pareto optimal matchings in the house allocation problem. In: Ferro, A., Luccio, F., Widmayer, P. (eds.) Fun with Algorithms. Lecture Notes in Computer Science, vol. 8496, pp. 301\u2013312. Springer, Sicily, Italy (2014)","DOI":"10.1007\/978-3-319-07890-8_26"},{"key":"326_CR4","first-page":"167","volume":"32","author":"J Balogh","year":"2003","unstructured":"Balogh, J., Regev, O., Smyth, C., Steiger, W., Szegedy, M.: Long monotone paths in line arrangements. Discrete Comput. Geom. 32, 167\u2013176 (2003)","journal-title":"Discrete Comput. Geom."},{"key":"326_CR5","doi-asserted-by":"crossref","unstructured":"Ben-Avraham, R., Henze, M., Jaume, R., Keszegh, B., Raz, O.E., Sharir, M., Tubis, I.: Minimum partial matching and Hausdorff RMS-distance under translation: combinatorics and algorithms. In: Proceedings of 22nd European Symposium on Algorithms, pp. 100\u2013111 (2014)","DOI":"10.1007\/978-3-662-44777-2_9"},{"key":"326_CR6","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/BF02187740","volume":"4","author":"KL Clarkson","year":"1989","unstructured":"Clarkson, K.L., Shor, P.W.: Applications of random sampling in computational geometry, II. Discrete Comput. Geom. 4, 387\u2013421 (1989)","journal-title":"Discrete Comput. Geom."},{"key":"326_CR7","doi-asserted-by":"crossref","unstructured":"de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry, Algorithms and Applications. Springer, Berlin (1997); second edition (2000)","DOI":"10.1007\/978-3-662-03427-9"},{"key":"326_CR8","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/978-3-319-00200-2_6","volume-title":"Discrete Geometry and Optimization. Fields Institute Communications","author":"A Dumitrescu","year":"2013","unstructured":"Dumitrescu, A., Rote, G., T\u00f3th, C.D.: Monotone paths in planar convex subdivisions and polytopes. In: Bezdek, K., Deza, A., Ye, Y. (eds.) Discrete Geometry and Optimization. Fields Institute Communications, vol. 69, pp. 79\u2013104. Springer, Berlin (2013)"},{"key":"326_CR9","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1145\/321694.321699","volume":"19","author":"J Edmonds","year":"1972","unstructured":"Edmonds, J., Karp, R.M.: Theoretical improvements in algorithmic efficiency for network flow problems. J. ACM 19, 248\u2013264 (1972)","journal-title":"J. ACM"},{"key":"326_CR10","doi-asserted-by":"crossref","first-page":"596","DOI":"10.1145\/28869.28874","volume":"34","author":"ML Fredman","year":"1987","unstructured":"Fredman, M.L., Tarjan, R.E.: Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM 34, 596\u2013615 (1987)","journal-title":"J. ACM"},{"key":"326_CR11","unstructured":"Henze, M., Jaume, R., Keszegh, B.: On the complexity of the partial least-squares matching Voronoi diagram. In: Proceedings of 29th European Workshop on Computational Geometry (EuroCG\u201913) (2013)"},{"key":"326_CR12","doi-asserted-by":"crossref","unstructured":"Jung, I., Lacroix, S.: A robust interest points matching algorithm. In: Proceedings of ICCV\u201901, vol. 2, pp. 538\u2013543 (2001)","DOI":"10.1109\/ICCV.2001.937672"},{"issue":"1\u20132","key":"326_CR13","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"HW Kuhn","year":"1955","unstructured":"Kuhn, H.W.: The Hungarian method for the assignment problem. Naval Res. Logist. Q. 2(1\u20132), 83\u201397 (1955)","journal-title":"Naval Res. Logist. Q."},{"key":"326_CR14","doi-asserted-by":"crossref","unstructured":"Ramshaw, L., Tarjan, R.E.: A weight-scaling algorithm for min-cost imperfect matchings in bipartite graphs. In: Proceedings of 53rd Annual IEEE Symposium on Foundations of Computer Science, pp. 581\u2013590 (2012)","DOI":"10.1109\/FOCS.2012.9"},{"key":"326_CR15","unstructured":"Rote, G.: Partial least-squares point matching under translations. In: Proceedings of 26th European Workshop on Computational Geometry (EuroCG\u201910), pp. 249\u2013251 (2010)"},{"key":"326_CR16","unstructured":"Rote, G.: Long monotone paths in convex subdivisions. In: Proceedings of 27th European Workshop on Computational Geometry (EuroCG\u201911), pp. 183\u2013184 (2011)"},{"key":"326_CR17","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0304-4068(74)90033-0","volume":"1","author":"LS Shapley","year":"1974","unstructured":"Shapley, L.S., Scarf, H.: On cores and indivisibility. J. Math. Econ. 1, 23\u201337 (1974)","journal-title":"J. Math. Econ."},{"issue":"4","key":"326_CR18","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1109\/34.88573","volume":"13","author":"S Umeyama","year":"1991","unstructured":"Umeyama, S.: Least-squares estimation of transformation parameters between two point patterns. IEEE Trans. Pattern Anal. Mach. Intell. 13(4), 376\u2013380 (1991)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"326_CR19","first-page":"385","volume-title":"Computer Vision and Image Processing","author":"K Zikan","year":"1992","unstructured":"Zikan, K., Silberberg, T.M.: The Frobenius metric in image registration. In: Shapiro, L., Rosenfeld, A. (eds.) Computer Vision and Image Processing, pp. 385\u2013420. Elsevier, Amsterdam (1992)"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-017-0326-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-017-0326-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-017-0326-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:32:16Z","timestamp":1750293136000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-017-0326-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,6]]},"references-count":19,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2018,8]]}},"alternative-id":["326"],"URL":"https:\/\/doi.org\/10.1007\/s00453-017-0326-0","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"type":"print","value":"0178-4617"},{"type":"electronic","value":"1432-0541"}],"subject":[],"published":{"date-parts":[[2017,6,6]]}}}