{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,18]],"date-time":"2024-06-18T02:53:20Z","timestamp":1718679200016},"reference-count":9,"publisher":"Elsevier BV","issue":"8","content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[2014,8]]},"DOI":"10.1016\/j.ipl.2014.03.008","type":"journal-article","created":{"date-parts":[[2014,3,24]],"date-time":"2014-03-24T14:59:15Z","timestamp":1395673155000},"page":"446-449","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":9,"title":["Parameterized algorithms for load coloring problem"],"prefix":"10.1016","volume":"114","author":[{"given":"Gregory","family":"Gutin","sequence":"first","affiliation":[]},{"given":"Mark","family":"Jones","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/j.ipl.2014.03.008_br0010","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1016\/j.jda.2006.09.001","article-title":"On the minimum load coloring problem","volume":"5","author":"Ahuja","year":"2007","journal-title":"J. Discrete Algorithms"},{"issue":"8","key":"10.1016\/j.ipl.2014.03.008_br0020","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1016\/j.jcss.2009.04.001","article-title":"On problems without polynomial kernels","volume":"75","author":"Bodlaender","year":"2009","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/j.ipl.2014.03.008_br0030","series-title":"STACS 2011","first-page":"165","article-title":"Cross-composition: a new technique for kernelization lower bounds","volume":"vol. 9","author":"Bodlaender","year":"2011"},{"key":"10.1016\/j.ipl.2014.03.008_br0040","series-title":"ESA 2009","first-page":"635","article-title":"Kernel bounds for disjoint cycles and disjoint paths","volume":"vol. 5757","author":"Bodlaender","year":"2009"},{"key":"10.1016\/j.ipl.2014.03.008_br0050","series-title":"Parameterized Complexity","author":"Downey","year":"1999"},{"key":"10.1016\/j.ipl.2014.03.008_br0060","series-title":"Parameterized Complexity Theory","author":"Flum","year":"2006"},{"key":"10.1016\/j.ipl.2014.03.008_br0070","article-title":"Treewidth: Computations and Approximations","volume":"vol. 842","author":"Kloks","year":"1994"},{"key":"10.1016\/j.ipl.2014.03.008_br0080","series-title":"Invitation to Fixed-Parameter Algorithms","author":"Niedermeier","year":"2006"},{"key":"10.1016\/j.ipl.2014.03.008_br0090","series-title":"WDM Optical Networks, Concepts, Design, and Algorithms","author":"Siva","year":"2001"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019014000519?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019014000519?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,10,5]],"date-time":"2018-10-05T18:50:31Z","timestamp":1538765431000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019014000519"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,8]]},"references-count":9,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2014,8]]}},"alternative-id":["S0020019014000519"],"URL":"https:\/\/doi.org\/10.1016\/j.ipl.2014.03.008","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2014,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Parameterized algorithms for load coloring problem","name":"articletitle","label":"Article Title"},{"value":"Information Processing Letters","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ipl.2014.03.008","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2014 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}