{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T18:41:47Z","timestamp":1726512107460},"reference-count":19,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2013,11,1]],"date-time":"2013-11-01T00:00:00Z","timestamp":1383264000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2017,11,4]],"date-time":"2017-11-04T00:00:00Z","timestamp":1509753600000},"content-version":"vor","delay-in-days":1464,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2013,11]]},"DOI":"10.1016\/j.tcs.2013.01.012","type":"journal-article","created":{"date-parts":[[2013,1,24]],"date-time":"2013-01-24T20:33:12Z","timestamp":1359059592000},"page":"42-53","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["Parameterized maximum path coloring"],"prefix":"10.1016","volume":"511","author":[{"given":"Michael","family":"Lampis","sequence":"first","affiliation":[]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/j.tcs.2013.01.012_br000005","doi-asserted-by":"crossref","first-page":"844","DOI":"10.1145\/210332.210337","article-title":"Color-coding","volume":"42","author":"Alon","year":"1995","journal-title":"Journal of the ACM (JACM)"},{"issue":"4","key":"10.1016\/j.tcs.2013.01.012_br000010","doi-asserted-by":"crossref","first-page":"707","DOI":"10.1016\/S0022-0000(03)00076-X","article-title":"Call control with k rejections","volume":"67","author":"Anand","year":"2003","journal-title":"Journal of Computer and System Sciences"},{"issue":"3","key":"10.1016\/j.tcs.2013.01.012_br000015","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1093\/comjnl\/bxm037","article-title":"Combinatorial optimization on graphs of bounded treewidth","volume":"51","author":"Bodlaender","year":"2008","journal-title":"Computer Journal"},{"key":"10.1016\/j.tcs.2013.01.012_br000020","series-title":"STOC","first-page":"212","article-title":"Linear FPT reductions and computational lower bounds","author":"Chen","year":"2004"},{"year":"1999","series-title":"Parameterized Complexity","author":"Downey","key":"10.1016\/j.tcs.2013.01.012_br000025"},{"key":"10.1016\/j.tcs.2013.01.012_br000030","series-title":"ISAAC","first-page":"179","article-title":"Maximizing the number of connections in optical tree networks","volume":"vol. 1533","author":"Erlebach","year":"1998"},{"issue":"1\u20132","key":"10.1016\/j.tcs.2013.01.012_br000035","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/S0304-3975(99)00152-8","article-title":"The complexity of path coloring and call scheduling","volume":"255","author":"Erlebach","year":"2001","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"10.1016\/j.tcs.2013.01.012_br000040","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1137\/S0895480199361259","article-title":"The maximum edge-disjoint paths problem in bidirected trees","volume":"14","author":"Erlebach","year":"2001","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"1\u20132","key":"10.1016\/j.tcs.2013.01.012_br000045","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/S0304-3975(99)00029-8","article-title":"Optimal wavelength routing on directed fiber trees","volume":"221","author":"Erlebach","year":"1999","journal-title":"Theoretical Computer Science"},{"year":"2006","series-title":"Parameterized Complexity Theory","author":"Flum","key":"10.1016\/j.tcs.2013.01.012_br000050"},{"key":"10.1016\/j.tcs.2013.01.012_br000055","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1137\/0601025","article-title":"The complexity of coloring circular arcs and chords","volume":"1","author":"Garey","year":"1980","journal-title":"SIAM Journal on Algebraic and Discrete Methods"},{"issue":"1","key":"10.1016\/j.tcs.2013.01.012_br000060","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/BF02523685","article-title":"Primal-dual approximation algorithms for integral flow and multicut in trees","volume":"18","author":"Garg","year":"1997","journal-title":"Algorithmica"},{"issue":"2","key":"10.1016\/j.tcs.2013.01.012_br000065","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/0012-365X(85)90043-3","article-title":"Edge and vertex intersection of paths in a tree","volume":"55","author":"Golumbic","year":"1985","journal-title":"Discrete Mathematics"},{"issue":"2","key":"10.1016\/j.tcs.2013.01.012_br000070","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1006\/jcss.2000.1727","article-title":"On the complexity of k-sat","volume":"62","author":"Impagliazzo","year":"2001","journal-title":"Journal of Computer and System Sciences"},{"key":"10.1016\/j.tcs.2013.01.012_br000075","first-page":"47","article-title":"On computing maximum k-independent sets","author":"Kong","year":"1993","journal-title":"Congressus Numerantium"},{"issue":"6","key":"10.1016\/j.tcs.2013.01.012_br000080","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/S0020-0190(97)00077-X","article-title":"A note on optical routing on trees","volume":"62","author":"Kumar","year":"1997","journal-title":"Information Processing Letters"},{"key":"10.1016\/j.tcs.2013.01.012_br000085","series-title":"ESA (1)","first-page":"549","article-title":"Algorithmic meta-theorems for restrictions of treewidth","volume":"vol. 6346","author":"Lampis","year":"2010"},{"year":"2006","series-title":"Invitation to Fixed-Parameter Algorithms","author":"Niedermeier","key":"10.1016\/j.tcs.2013.01.012_br000090"},{"key":"10.1016\/j.tcs.2013.01.012_br000095","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1090\/dimacs\/046\/02","article-title":"Maximal throughput in wavelength-routed optical networks","volume":"46","author":"Wan","year":"1998","journal-title":"Multichannel Optical Networks: Theory and Practice"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397513000625?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397513000625?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,10,19]],"date-time":"2018-10-19T06:52:45Z","timestamp":1539931965000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397513000625"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,11]]},"references-count":19,"alternative-id":["S0304397513000625"],"URL":"http:\/\/dx.doi.org\/10.1016\/j.tcs.2013.01.012","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[2013,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Parameterized maximum path coloring","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2013.01.012","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2013 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}
