{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:20:34Z","timestamp":1740122434593,"version":"3.37.3"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,3,1]],"date-time":"2023-03-01T00:00:00Z","timestamp":1677628800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,3,1]],"date-time":"2023-03-01T00:00:00Z","timestamp":1677628800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2023,3]]},"DOI":"10.1007\/s10878-023-01010-z","type":"journal-article","created":{"date-parts":[[2023,3,26]],"date-time":"2023-03-26T23:05:18Z","timestamp":1679871918000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Matching random colored points with rectangles"],"prefix":"10.1007","volume":"45","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3997-7391","authenticated-orcid":false,"given":"Josu\u00e9","family":"Corujo","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5411-3049","authenticated-orcid":false,"given":"David","family":"Flores-Pe\u00f1aloza","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7557-0823","authenticated-orcid":false,"given":"Clemens","family":"Huemer","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8703-8970","authenticated-orcid":false,"given":"Pablo","family":"P\u00e9rez-Lantero","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0095-1725","authenticated-orcid":false,"given":"Carlos","family":"Seara","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,3,14]]},"reference":[{"issue":"1","key":"1010_CR1","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/s00454-008-9099-1","volume":"41","author":"BM \u00c1brego","year":"2009","unstructured":"\u00c1brego BM, Arkin EM, Fern\u00e1ndez-Merchant S, Hurtado F, Kano M, Mitchell JSB, Urrutia J (2009) Matching points with squares. Discrete Comput Geom 41(1):77\u201395","journal-title":"Discrete Comput Geom"},{"issue":"3","key":"1010_CR2","doi-asserted-by":"publisher","first-page":"1866","DOI":"10.1137\/15M1024184","volume":"30","author":"O Arizmendi","year":"2016","unstructured":"Arizmendi O, Salazar G (2016) Large area convex holes in random point sets. SIAM J Discrete Math 30(3):1866\u20131875","journal-title":"SIAM J Discrete Math"},{"key":"1010_CR3","doi-asserted-by":"crossref","unstructured":"Asgeirsson E, Stein C (2006) Using Markov chains to design algorithms for bounded-space on-line bin cover. In: Proceedings of the workshop on algorithm engineering and experiments (ALENEX), pp 75\u201385","DOI":"10.1137\/1.9781611972863.8"},{"key":"1010_CR4","doi-asserted-by":"publisher","unstructured":"Balko M, Scheucher M, Valtr P (2020) Holes and islands in random point sets. https:\/\/doi.org\/10.1002\/rsa.21037. arXiv:2003.00909","DOI":"10.1002\/rsa.21037"},{"issue":"6","key":"1010_CR5","doi-asserted-by":"publisher","first-page":"725","DOI":"10.1016\/j.comgeo.2012.11.004","volume":"46","author":"J Balogh","year":"2013","unstructured":"Balogh J, Gonz\u00e1lez-Aguilar H, Salazar G (2013) Large convex holes in random point sets. Comput Geom 46(6):725\u2013733","journal-title":"Comput Geom"},{"issue":"2","key":"1010_CR6","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.comgeo.2008.05.001","volume":"42","author":"S Bereg","year":"2009","unstructured":"Bereg S, Mutsanas N, Wolff A (2009) Matching points with rectangles and squares. Comput Geom 42(2):93\u2013108","journal-title":"Comput Geom"},{"issue":"2","key":"1010_CR7","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/s10878-015-9971-x","volume":"33","author":"LE Caraballo","year":"2017","unstructured":"Caraballo LE, Ochoa C, P\u00e9rez-Lantero P, Rojas-Ledesma J (2017) Matching colored points with rectangles. J Comb Optim 33(2):403\u2013421","journal-title":"J Comb Optim"},{"issue":"1","key":"1010_CR8","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1002\/rsa.20246","volume":"34","author":"X Chen","year":"2009","unstructured":"Chen X, Pach J, Szegedy M, Tardos G (2009) Delaunay graphs of point sets in the plane with respect to axis-parallel rectangles. Random Struct Algorithms 34(1):11\u201323","journal-title":"Random Struct Algorithms"},{"key":"1010_CR9","doi-asserted-by":"crossref","unstructured":"Coffman Jr EG, Johnson DS, Shor PW, Weber RR (1993) Markov chains, computer proofs, and average-case analysis of best fit bin packing. In: Proceedings of the twenty-fifth annual ACM symposium on theory of computing, pp 412\u2013421","DOI":"10.1145\/167088.167203"},{"key":"1010_CR10","doi-asserted-by":"crossref","unstructured":"Corujo J, Flores-Pe\u00f1aloza D, Huemer C, P\u00e9rez-Lantero P, Seara C (2020) Matching random colored points with rectangles. In: International workshop on algorithms and computation. Springer, pp 261\u2013272","DOI":"10.1007\/978-3-030-39881-1_22"},{"key":"1010_CR11","unstructured":"Devillers O, Duchon P, Glisse M, Goaoc X (2018) On order types of random point sets. arXiv:1812.08525"},{"issue":"1","key":"1010_CR12","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/j.jco.2013.06.001","volume":"30","author":"B Doerr","year":"2014","unstructured":"Doerr B (2014) A lower bound for the discrepancy of a random point set. J Complex 30(1):16\u201320","journal-title":"J Complex"},{"issue":"1","key":"1010_CR13","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/S0925-7721(01)00007-4","volume":"19","author":"A Dumitrescu","year":"2001","unstructured":"Dumitrescu A, Kaye R (2001) Matching colored points in the plane: some new results. Comput Geom 19(1):69\u201385","journal-title":"Comput Geom"},{"issue":"1\u20133","key":"1010_CR14","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/S0012-365X(99)00201-0","volume":"211","author":"A Dumitrescu","year":"2000","unstructured":"Dumitrescu A, Steiger W (2000) On a matching problem in the plane. Discrete Math 211(1\u20133):183\u2013195","journal-title":"Discrete Math"},{"key":"1010_CR15","unstructured":"Fabila-Monroy R, Huemer C (2017) Order types of random point sets can be realized with small integer coordinates. In: XVII Spanish meeting on computational geometry: book of abstracts, Alicante, June 26\u201328, pp 73\u201376"},{"issue":"1","key":"1010_CR16","first-page":"52","volume":"52","author":"R Fabila-Monroy","year":"2015","unstructured":"Fabila-Monroy R, Huemer C, Mitsche D (2015) Empty non-convex and convex four-gons in random point sets. Stud Sci Math Hung 52(1):52\u201364","journal-title":"Stud Sci Math Hung"},{"issue":"2","key":"1010_CR17","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1006\/jagm.1997.0919","volume":"27","author":"C Kenyon","year":"1998","unstructured":"Kenyon C, Rabani Y, Sinclair A (1998) Biased random walks, Lyapunov functions, and stochastic analysis of Best Fit bin packing. J Algorithms 27(2):218\u2013235","journal-title":"J Algorithms"},{"key":"1010_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-5498-0","volume-title":"Problem-Solving Through Problems. Problem Books in Mathematics","author":"LC Larson","year":"1983","unstructured":"Larson LC (1983) Problem-Solving Through Problems. Problem Books in Mathematics. Springer, New York"},{"key":"1010_CR19","unstructured":"Norris JR (1998) Markov chains. In: Cambridge series in statistical and probabilistic mathematics, vol\u00a02. Cambridge University Press, Cambridge. Reprint of 1997 original"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-023-01010-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-023-01010-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-023-01010-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,26]],"date-time":"2023-03-26T23:11:11Z","timestamp":1679872271000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-023-01010-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,3]]}},"alternative-id":["1010"],"URL":"https:\/\/doi.org\/10.1007\/s10878-023-01010-z","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2023,3]]},"assertion":[{"value":"21 February 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 March 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"81"}}