{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:42:21Z","timestamp":1777596141899,"version":"3.51.4"},"reference-count":17,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2017,3,1]],"date-time":"2017-03-01T00:00:00Z","timestamp":1488326400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2021,3,1]],"date-time":"2021-03-01T00:00:00Z","timestamp":1614556800000},"content-version":"vor","delay-in-days":1461,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100000781","name":"ERC","doi-asserted-by":"publisher","award":["267959"],"award-info":[{"award-number":["267959"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000781","name":"ERC","doi-asserted-by":"publisher","award":["306992"],"award-info":[{"award-number":["306992"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[2017,3]]},"DOI":"10.1016\/j.jcss.2016.09.012","type":"journal-article","created":{"date-parts":[[2016,10,15]],"date-time":"2016-10-15T16:30:33Z","timestamp":1476549033000},"page":"120-131","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":3,"special_numbering":"C","title":["On the parameterized complexity of b-chromatic number"],"prefix":"10.1016","volume":"84","author":[{"given":"Fahad","family":"Panolan","sequence":"first","affiliation":[]},{"given":"Geevarghese","family":"Philip","sequence":"additional","affiliation":[]},{"given":"Saket","family":"Saurabh","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.jcss.2016.09.012_br0010","series-title":"10th International Symposium on Parameterized and Exact Computation, IPEC 2015","first-page":"389","article-title":"B-chromatic number: beyond np-hardness","author":"Panolan","year":"2015"},{"issue":"4","key":"10.1016\/j.jcss.2016.09.012_br0020","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1038\/scientificamerican1077-108","article-title":"The solution of the four-color-map problem","volume":"237","author":"Appel","year":"1977","journal-title":"Sci. Am."},{"key":"10.1016\/j.jcss.2016.09.012_br0030","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"issue":"3","key":"10.1016\/j.jcss.2016.09.012_br0040","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1016\/0020-0190(76)90065-X","article-title":"A note on the complexity of the chromatic number problem","volume":"5","author":"Lawler","year":"1976","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"10.1016\/j.jcss.2016.09.012_br0050","doi-asserted-by":"crossref","first-page":"546","DOI":"10.1137\/070683933","article-title":"Set partitioning via inclusion-exclusion","volume":"39","author":"Bj\u00f6rklund","year":"2009","journal-title":"SIAM J. Comput."},{"issue":"1\u20133","key":"10.1016\/j.jcss.2016.09.012_br0060","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/S0166-218X(98)00146-2","article-title":"The b-chromatic number of a graph","volume":"91","author":"Irving","year":"1999","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.jcss.2016.09.012_br0070","series-title":"Graph-Theoretic Concepts in Computer Science, 28th International Workshop, WG 2002","first-page":"310","article-title":"On the b-chromatic number of graphs","author":"Kratochv\u00edl","year":"2002"},{"issue":"18","key":"10.1016\/j.jcss.2016.09.012_br0080","doi-asserted-by":"crossref","first-page":"2709","DOI":"10.1016\/j.dam.2011.10.017","article-title":"b-coloring of tight graphs","volume":"160","author":"Havet","year":"2012","journal-title":"Discrete Appl. Math."},{"issue":"7\u20138","key":"10.1016\/j.jcss.2016.09.012_br0090","doi-asserted-by":"crossref","first-page":"1137","DOI":"10.1016\/j.dam.2012.11.008","article-title":"A note on approximating the b-chromatic number","volume":"161","author":"Galc\u00edk","year":"2013","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.jcss.2016.09.012_br0100","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4471-5559-1","article-title":"Fundamentals of Parameterized Complexity","author":"Downey","year":"2013"},{"key":"10.1016\/j.jcss.2016.09.012_br0110","series-title":"Parameterized Algorithms","author":"Cygan","year":"2015"},{"issue":"4","key":"10.1016\/j.jcss.2016.09.012_br0120","doi-asserted-by":"crossref","first-page":"885","DOI":"10.1007\/s00453-011-9604-4","article-title":"On the grundy and b-chromatic numbers of a graph","volume":"65","author":"Havet","year":"2013","journal-title":"Algorithmica"},{"key":"10.1016\/j.jcss.2016.09.012_br0130","author":"Effantin"},{"issue":"3\u20134","key":"10.1016\/j.jcss.2016.09.012_br0140","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/BF02242355","article-title":"Schnelle multiplikation gro\u00dfer zahlen","volume":"7","author":"Sch\u00f6nhage","year":"1971","journal-title":"Computing"},{"issue":"40\u201342","key":"10.1016\/j.jcss.2016.09.012_br0150","doi-asserted-by":"crossref","first-page":"3701","DOI":"10.1016\/j.tcs.2010.06.018","article-title":"Exact and approximate bandwidth","volume":"411","author":"Cygan","year":"2010","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.jcss.2016.09.012_br0160","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.tcs.2014.10.035","article-title":"On the parameterized complexity of vertex cover and edge cover with connectivity constraints","volume":"565","author":"Fernau","year":"2015","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.jcss.2016.09.012_br0170","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-16533-7","article-title":"Exact Exponential Algorithms","author":"Fomin","year":"2010"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000016300927?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000016300927?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,3,1]],"date-time":"2021-03-01T02:57:10Z","timestamp":1614567430000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000016300927"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,3]]},"references-count":17,"alternative-id":["S0022000016300927"],"URL":"https:\/\/doi.org\/10.1016\/j.jcss.2016.09.012","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[2017,3]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"On the parameterized complexity of b-chromatic number","name":"articletitle","label":"Article Title"},{"value":"Journal of Computer and System Sciences","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.jcss.2016.09.012","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2016 Elsevier Inc.","name":"copyright","label":"Copyright"}]}}