{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,15]],"date-time":"2024-07-15T06:39:31Z","timestamp":1721025571226},"reference-count":12,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2018,9,1]],"date-time":"2018-09-01T00:00:00Z","timestamp":1535760000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2022,9,10]],"date-time":"2022-09-10T00:00:00Z","timestamp":1662768000000},"content-version":"vor","delay-in-days":1470,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["497\/14"],"id":[{"id":"10.13039\/501100003977","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":[[2018,9]]},"DOI":"10.1016\/j.dam.2017.01.008","type":"journal-article","created":{"date-parts":[[2017,2,16]],"date-time":"2017-02-16T23:15:53Z","timestamp":1487286953000},"page":"2-11","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":2,"special_numbering":"C","title":["1.5-approximation algorithm for the 2<\/mml:mn><\/mml:math>-Convex Recoloring problem"],"prefix":"10.1016","volume":"246","author":[{"given":"Reuven","family":"Bar-Yehuda","sequence":"first","affiliation":[]},{"given":"Gilad","family":"Kutiel","sequence":"additional","affiliation":[]},{"given":"Dror","family":"Rawitz","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.dam.2017.01.008_b1","series-title":"Convex Recoloring of Leaf-Colored Trees, Technical Report UU-CS-2006-010","author":"Bachoore","year":"2006"},{"issue":"1","key":"10.1016\/j.dam.2017.01.008_b2","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s00224-007-9069-7","article-title":"Improved approximation algorithm for convex recoloring of trees","volume":"43","author":"Bar-Yehuda","year":"2008","journal-title":"Theory Comput. Syst."},{"issue":"2","key":"10.1016\/j.dam.2017.01.008_b3","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1007\/s00453-010-9404-2","article-title":"Quadratic kernelization for convex recoloring of trees","volume":"61","author":"Bodlaender","year":"2011","journal-title":"Algorithmica"},{"key":"10.1016\/j.dam.2017.01.008_b4","series-title":"International Computing and Combinatorics Conference","first-page":"614","article-title":"On the complexity of solving or approximating convex recoloring problems","author":"Camp\u00ealo","year":"2013"},{"issue":"6","key":"10.1016\/j.dam.2017.01.008_b5","doi-asserted-by":"crossref","first-page":"810","DOI":"10.1016\/j.dam.2011.09.022","article-title":"The complexity of minimum convex coloring","volume":"160","author":"Kammer","year":"2012","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2017.01.008_b6","series-title":"15th COCOON","first-page":"388","article-title":"Convex recoloring revisited: Complexity and exact algorithms","volume":"vol. 5609","author":"Kanj","year":"2009"},{"key":"10.1016\/j.dam.2017.01.008_b7","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1002\/net.1975.5.1.45","article-title":"On the computational complexity of combinatorial problems","volume":"5","author":"Karp","year":"1975","journal-title":"Networks"},{"key":"10.1016\/j.dam.2017.01.008_b8","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1016\/j.dam.2013.02.034","article-title":"Convex recoloring of paths","volume":"164","author":"Lima","year":"2014","journal-title":"Discrete Appl. Math."},{"issue":"7","key":"10.1016\/j.dam.2017.01.008_b9","doi-asserted-by":"crossref","first-page":"1078","DOI":"10.1016\/j.jcss.2007.03.006","article-title":"Efficient approximation of convex recolorings","volume":"73","author":"Moran","year":"2007","journal-title":"J. Comput. System Sci."},{"issue":"5","key":"10.1016\/j.dam.2017.01.008_b10","doi-asserted-by":"crossref","first-page":"850","DOI":"10.1016\/j.jcss.2007.10.003","article-title":"Convex recolorings of strings and trees: Definitions, hardness results and algorithms","volume":"74","author":"Moran","year":"2008","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/j.dam.2017.01.008_b11","series-title":"5th TAMC","first-page":"490","article-title":"Speeding up dynamic programming for some NP-hard graph recoloring problems","volume":"vol. 4978","author":"Ponta","year":"2008"},{"issue":"2","key":"10.1016\/j.dam.2017.01.008_b12","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/j.ipl.2007.05.007","article-title":"A 2O(k)poly(n) algorithm for the parameterized convex recoloring problem","volume":"104","author":"Razgon","year":"2007","journal-title":"Inform. Process. Lett."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X17300410?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X17300410?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2022,9,10]],"date-time":"2022-09-10T08:28:09Z","timestamp":1662798489000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X17300410"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9]]},"references-count":12,"alternative-id":["S0166218X17300410"],"URL":"https:\/\/doi.org\/10.1016\/j.dam.2017.01.008","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2018,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"1.5-approximation algorithm for the -Convex Recoloring problem","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.dam.2017.01.008","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2017 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}
