{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T14:53:22Z","timestamp":1776437602970,"version":"3.51.2"},"reference-count":28,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/100014440","name":"Spain Ministry of Science Innovation and Universities","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100014440","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2026,7]]},"DOI":"10.1016\/j.dam.2026.02.049","type":"journal-article","created":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T10:50:45Z","timestamp":1773831045000},"page":"260-271","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Crossing-free monochromatic trees for bicolored point sets"],"prefix":"10.1016","volume":"387","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5349-4348","authenticated-orcid":false,"given":"Jos\u00e9","family":"Fern\u00e1ndez Goycoolea","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7338-7611","authenticated-orcid":false,"given":"Luis H.","family":"Herrera","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8703-8970","authenticated-orcid":false,"given":"Pablo","family":"P\u00e9rez-Lantero","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0095-1725","authenticated-orcid":false,"given":"Carlos","family":"Seara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"Combinatorics","key":"10.1016\/j.dam.2026.02.049_b1","doi-asserted-by":"crossref","DOI":"10.23638\/DMTCS-21-3-6","article-title":"K{1,3}-Covering red and blue points in the plane","volume":"21","author":"\u00c1brego","year":"2019","journal-title":"Discrete Math. Theor. Comput. Sci."},{"issue":"3","key":"10.1016\/j.dam.2026.02.049_b2","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/j.dam.2006.06.010","article-title":"Connecting colored point sets","volume":"155","author":"Aichholzer","year":"2007","journal-title":"Discret. Appl. Math."},{"issue":"4","key":"10.1016\/j.dam.2026.02.049_b3","doi-asserted-by":"crossref","first-page":"1003","DOI":"10.1007\/s10898-022-01238-9","article-title":"Separating bichromatic point sets in the plane by restricted orientation convex hulls","volume":"85","author":"Alegr\u00eda","year":"2022","journal-title":"J. Global Optim."},{"key":"10.1016\/j.dam.2026.02.049_b4","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1007\/s00454-012-9467-8","article-title":"Functions, measures, and equipartitioning convex k-fans","volume":"49","author":"B\u00e1r\u00e1ny","year":"2013","journal-title":"Discrete Comput. Geom."},{"issue":"3","key":"10.1016\/j.dam.2026.02.049_b5","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1007\/s00454-001-0003-5","article-title":"Simultaneous partitions of measures by k-fans","volume":"25","author":"B\u00e1r\u00e1ny","year":"2001","journal-title":"Discrete Comput. Geom."},{"issue":"4","key":"10.1016\/j.dam.2026.02.049_b6","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/j.comgeo.2008.09.004","article-title":"Orthogonal equipartitions","volume":"42","author":"Bereg","year":"2009","journal-title":"Comput. Geom."},{"key":"10.1016\/j.dam.2026.02.049_b7","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/s10898-022-01199-z","article-title":"On maximum-sum matchings of points","volume":"85","author":"Bereg","year":"2023","journal-title":"J. Global Optim."},{"issue":"1","key":"10.1016\/j.dam.2026.02.049_b8","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/j.comgeo.2012.04.003","article-title":"On the coarseness of bicolored point sets","volume":"46","author":"Bereg","year":"2013","journal-title":"Comput. Geom."},{"key":"10.1016\/j.dam.2026.02.049_b9","doi-asserted-by":"crossref","unstructured":"S. Bespamyatnikh, D. Kirkpatrick, J. Snoeyink, Generalizing ham sandwich cuts to equitable subdivisions, in: Proceedings of the Fifteenth Annual Symposium on Computational Geometry, 1999, pp. 49\u201358.","DOI":"10.1145\/304893.304909"},{"key":"10.1016\/j.dam.2026.02.049_b10","series-title":"Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science","first-page":"617","article-title":"Dynamic planar convex hull","author":"Brodal","year":"2002"},{"key":"10.1016\/j.dam.2026.02.049_b11","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1016\/j.comgeo.2017.05.009","article-title":"On Hamiltonian alternating cycles and paths","volume":"68","author":"Claverol","year":"2018","journal-title":"Comput. Geom."},{"key":"10.1016\/j.dam.2026.02.049_b12","series-title":"Computational Geometry: Algorithms and Applications","author":"de Berg","year":"2000"},{"key":"10.1016\/j.dam.2026.02.049_b13","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/j.dam.2017.02.022","article-title":"Computing the coarseness with strips or boxes","volume":"224","author":"D\u00edaz-B\u00e1\u00f1ez","year":"2017","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"10.1016\/j.dam.2026.02.049_b14","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/S0925-7721(01)00007-4","article-title":"Matching colored points in the plane: some new results","volume":"19","author":"Dumitrescu","year":"2001","journal-title":"Comput. Geom."},{"key":"10.1016\/j.dam.2026.02.049_b15","article-title":"Computing the coarseness measure of a bicolored point set over guillotine partitions","volume":"24","author":"Fern\u00e1ndez\u00a0Goycoolea","year":"2024","journal-title":"Results Appl. Math."},{"issue":"4","key":"10.1016\/j.dam.2026.02.049_b16","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1016\/0196-6774(83)90013-5","article-title":"Finding the convex hull of a simple polygon","volume":"4","author":"Graham","year":"1983","journal-title":"J. Algorithms"},{"issue":"1\u20132","key":"10.1016\/j.dam.2026.02.049_b17","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/S0166-218X(00)00230-4","article-title":"Separating objects in the plane by wedges and strips","volume":"109","author":"Hurtado","year":"2001","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2026.02.049_b18","series-title":"Discrete and Computational Geometry: Japanese Conference, JCDCG\u201998 Tokyo, Japan, December 9-12, 1998. Revised Papers","first-page":"129","article-title":"2-dimension ham sandwich theorem for partitioning into three convex pieces","author":"Ito","year":"2000"},{"key":"10.1016\/j.dam.2026.02.049_b19","series-title":"Japanese Conference on Discrete and Computational Geometry","first-page":"166","article-title":"On the maximum degree of bipartite embeddings of trees in the plane","author":"Kaneko","year":"1998"},{"key":"10.1016\/j.dam.2026.02.049_b20","series-title":"Discrete and Computational Geometry: Japanese Conference, JCDCG 2000 Tokyo, Japan, November 22\u201325, 2000 Revised Papers","first-page":"176","article-title":"Generalized balanced partitions of two sets of points in the plane","author":"Kaneko","year":"2001"},{"issue":"01","key":"10.1016\/j.dam.2026.02.049_b21","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1142\/S021819590000005X","article-title":"Alternating Hamiltonian cycles with minimum number of crossings in the plane","volume":"10","author":"Kaneko","year":"2000","journal-title":"Internat. J. Comput. Geom. Appl."},{"key":"10.1016\/j.dam.2026.02.049_b22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00373-020-02210-8","article-title":"Discrete geometry on red and blue points in the plane\u2014A survey","volume":"37","author":"Kano","year":"2021","journal-title":"Graphs Combin."},{"issue":"19","key":"10.1016\/j.dam.2026.02.049_b23","doi-asserted-by":"crossref","first-page":"4315","DOI":"10.1016\/j.disc.2007.08.013","article-title":"Long alternating paths in bicolored point sets","volume":"308","author":"Kyn\u010dl","year":"2008","journal-title":"Discrete Math."},{"issue":"3","key":"10.1016\/j.dam.2026.02.049_b24","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1007\/s00373-004-0606-8","article-title":"On the intersection number of matchings and minimum weight perfect matchings of multicolored point sets","volume":"21","author":"Merino","year":"2005","journal-title":"Graphs Combin."},{"issue":"15","key":"10.1016\/j.dam.2026.02.049_b25","doi-asserted-by":"crossref","first-page":"1791","DOI":"10.1016\/j.disc.2006.03.035","article-title":"On the length of longest alternating paths for multicoloured point sets in convex position","volume":"306","author":"Merino","year":"2006","journal-title":"Discrete Math."},{"issue":"1","key":"10.1016\/j.dam.2026.02.049_b26","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/s003730200011","article-title":"Balanced convex partitions of measures in R2","volume":"18","author":"Sakai","year":"2002","journal-title":"Graphs Combin."},{"issue":"6","key":"10.1016\/j.dam.2026.02.049_b27","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/0020-0190(96)00124-X","article-title":"Intersection number of two connected geometric graphs","volume":"59","author":"Tokunaga","year":"1996","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/j.dam.2026.02.049_b28","series-title":"Introduction to Graph Theory","author":"Wilson","year":"2010"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X26001277?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X26001277?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T14:06:50Z","timestamp":1776434810000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X26001277"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7]]},"references-count":28,"alternative-id":["S0166218X26001277"],"URL":"https:\/\/doi.org\/10.1016\/j.dam.2026.02.049","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2026,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Crossing-free monochromatic trees for bicolored point sets","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.dam.2026.02.049","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}]}}