{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:16:36Z","timestamp":1761621396769,"version":"build-2065373602"},"reference-count":20,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T00:00:00Z","timestamp":1567296000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T00:00:00Z","timestamp":1567296000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2023,10,7]],"date-time":"2023-10-07T00:00:00Z","timestamp":1696636800000},"content-version":"vor","delay-in-days":1497,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"},{"start":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T00:00:00Z","timestamp":1567296000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T00:00:00Z","timestamp":1567296000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T00:00:00Z","timestamp":1567296000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T00:00:00Z","timestamp":1567296000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T00:00:00Z","timestamp":1567296000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61628207"],"award-info":[{"award-number":["61628207"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2019,9]]},"DOI":"10.1016\/j.tcs.2018.08.008","type":"journal-article","created":{"date-parts":[[2018,8,10]],"date-time":"2018-08-10T12:26:04Z","timestamp":1533903964000},"page":"26-31","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":5,"special_numbering":"C","title":["On some matching problems under the color-spanning model"],"prefix":"10.1016","volume":"786","author":[{"given":"Sergey","family":"Bereg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Feifei","family":"Ma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wencheng","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jian","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Binhai","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2018.08.008_br0010","series-title":"Proc. 9th European Symp. on Algorithms","first-page":"278","article-title":"Smallest color-spanning objects","author":"Abellanas","year":"2001"},{"key":"10.1016\/j.tcs.2018.08.008_br0020","series-title":"Proc. 11th Intl. Frontiers in Algorithmics Workshop","first-page":"17","article-title":"On the fixed-parameter tractability of some matching problems under the color-spanning model","author":"Bereg","year":"2017"},{"key":"10.1016\/j.tcs.2018.08.008_br0030","series-title":"Proc. 12th International Conference on Extending Database Technology","first-page":"1148","article-title":"MarcoPolo: a community system for sharing and integrating travel information on maps","author":"Chen","year":"2009"},{"issue":"1\u20133","key":"10.1016\/j.tcs.2018.08.008_br0040","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0012-365X(90)90358-O","article-title":"Unit disk graphs","volume":"86","author":"Clark","year":"1990","journal-title":"Discrete Math."},{"year":"1999","series-title":"Parameterized Complexity","author":"Downey","key":"10.1016\/j.tcs.2018.08.008_br0050"},{"issue":"5","key":"10.1016\/j.tcs.2018.08.008_br0060","doi-asserted-by":"crossref","first-page":"879","DOI":"10.1007\/s11390-014-1475-0","article-title":"On some proximity problems of colored sets","volume":"29","author":"Fan","year":"2014","journal-title":"J. Comput. Sci. Tech."},{"issue":"1","key":"10.1016\/j.tcs.2018.08.008_br0070","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/j.tcs.2008.09.065","article-title":"On the parameterized complexity of multiple-interval graph problems","volume":"410","author":"Fellows","year":"2009","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.tcs.2018.08.008_br0080","series-title":"Proc. 4th Intl. Frontiers of Algorithmics Workshop","first-page":"285","article-title":"Computing minimum diameter color-spanning sets","author":"Fleischer","year":"2010"},{"issue":"21\u201322","key":"10.1016\/j.tcs.2018.08.008_br0090","doi-asserted-by":"crossref","first-page":"1054","DOI":"10.1016\/j.ipl.2011.07.015","article-title":"Computing minimum diameter color-spanning sets is hard","volume":"111","author":"Fleischer","year":"2011","journal-title":"Inform. Process. Lett."},{"year":"2006","series-title":"Parameterized Complexity Theory","author":"Flum","key":"10.1016\/j.tcs.2018.08.008_br0100"},{"year":"1974","series-title":"Implementation of Algorithms for Maximum Matching on Nonbipartite Graphs","author":"Gabow","key":"10.1016\/j.tcs.2018.08.008_br0110"},{"issue":"3","key":"10.1016\/j.tcs.2018.08.008_br0120","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1016\/0196-6774(88)90031-4","article-title":"Algorithms for two bottleneck optimization problems","volume":"9","author":"Gabow","year":"1988","journal-title":"J. Algorithms"},{"issue":"2","key":"10.1016\/j.tcs.2018.08.008_br0130","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1007\/s10878-012-9458-y","article-title":"On some geometric problems of color-spanning sets","volume":"26","author":"Ju","year":"2013","journal-title":"J. Comb. Optim."},{"year":"1976","series-title":"Combinatorial Optimization: Networks and Matroids","author":"Lawler","key":"10.1016\/j.tcs.2018.08.008_br0140"},{"key":"10.1016\/j.tcs.2018.08.008_br0150","series-title":"Proc. 22nd Intl. Conf. on Principles and Practice of Constraint Programming","first-page":"650","article-title":"Optimizing shortwave radio broadcast resource allocation via pseudo-Boolean constraint solving and local search","author":"Ma","year":"2016"},{"key":"10.1016\/j.tcs.2018.08.008_br0160","series-title":"Proc. 13th European Symposium on Algorithms","first-page":"448","article-title":"Efficient approximation schemes for geometric problems?","author":"Marx","year":"2005"},{"issue":"4","key":"10.1016\/j.tcs.2018.08.008_br0170","doi-asserted-by":"crossref","first-page":"715","DOI":"10.1016\/j.dam.2008.07.011","article-title":"The parameterized complexity of the induced matching problem","volume":"157","author":"Moser","year":"2009","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"10.1016\/j.tcs.2018.08.008_br0180","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/j.jda.2008.09.005","article-title":"Parameterized complexity of finding regular induced subgraphs","volume":"7","author":"Moser","year":"2009","journal-title":"J. Discrete Algorithms"},{"year":"1985","series-title":"Computational Geometry: An Introduction","author":"Preparata","key":"10.1016\/j.tcs.2018.08.008_br0190"},{"key":"10.1016\/j.tcs.2018.08.008_br0200","series-title":"Proc. 25th IEEE International Conference on Data Engineering","first-page":"688","article-title":"Keyword search in spatial databases: towards searching by document","author":"Zhang","year":"2009"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397518305243?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397518305243?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T00:59:04Z","timestamp":1759625944000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397518305243"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9]]},"references-count":20,"alternative-id":["S0304397518305243"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2018.08.008","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[2019,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"On some matching problems under the color-spanning model","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2018.08.008","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2018 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}