乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,5]],"date-time":"2024-07-05T17:44:40Z","timestamp":1720201480509},"reference-count":23,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2023,6,7]],"date-time":"2023-06-07T00:00:00Z","timestamp":1686096000000},"content-version":"vor","delay-in-days":1467,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"},{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2019,6]]},"DOI":"10.1016\/j.tcs.2018.12.011","type":"journal-article","created":{"date-parts":[[2018,12,11]],"date-time":"2018-12-11T17:21:45Z","timestamp":1544548905000},"page":"132-142","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Harmonious coloring: Parameterized algorithms and upper bounds"],"prefix":"10.1016","volume":"772","author":[{"given":"Sudeshna","family":"Kolay","sequence":"first","affiliation":[]},{"given":"Ragukumar","family":"Pandurangan","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0001-6213-8687","authenticated-orcid":false,"given":"Fahad","family":"Panolan","sequence":"additional","affiliation":[]},{"given":"Venkatesh","family":"Raman","sequence":"additional","affiliation":[]},{"given":"Prafullkumar","family":"Tale","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2018.12.011_br0010","series-title":"Reducibility Among Combinatorial Problems","author":"Karp","year":"1972"},{"issue":"3","key":"10.1016\/j.tcs.2018.12.011_br0020","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":"Inform. Process. Lett."},{"issue":"2","key":"10.1016\/j.tcs.2018.12.011_br0030","doi-asserted-by":"crossref","first-page":"546","DOI":"10.1137\/070683933","article-title":"Set partitioning via inclusion\u2013exclusion","volume":"39","author":"Bj\u00f6rklund","year":"2009","journal-title":"SIAM J. Comput."},{"issue":"3","key":"10.1016\/j.tcs.2018.12.011_br0040","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/0012-365X(76)90099-6","article-title":"Graph with given achromatic number","volume":"16","author":"Hell","year":"1976","journal-title":"Discrete Math."},{"issue":"8\u201310","key":"10.1016\/j.tcs.2018.12.011_br0050","doi-asserted-by":"crossref","first-page":"818","DOI":"10.1016\/j.tcs.2008.11.010","article-title":"On the pseudo-achromatic number problem","volume":"410","author":"Chen","year":"2009","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"10.1016\/j.tcs.2018.12.011_br0060","first-page":"429","article-title":"Every planar map is four colorable. Part I: discharging","volume":"21","author":"Appel","year":"1977","journal-title":"Illinois J. Math."},{"key":"10.1016\/j.tcs.2018.12.011_br0070","series-title":"10th International Symposium on Parameterized and Exact Computation","first-page":"389","article-title":"B-chromatic number: beyond NP-hardness","author":"Panolan","year":"2015"},{"issue":"3","key":"10.1016\/j.tcs.2018.12.011_br0080","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1137\/0604032","article-title":"On the harmonious coloring of graphs","volume":"4","author":"Hopcroft","year":"1983","journal-title":"SIAM J. Algebr. Discrete Methods"},{"issue":"2","key":"10.1016\/j.tcs.2018.12.011_br0090","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0166-218X(94)00100-R","article-title":"The complexity of harmonious colouring for trees","volume":"57","author":"Edwards","year":"1995","journal-title":"Discrete Appl. Math."},{"issue":"17","key":"10.1016\/j.tcs.2018.12.011_br0100","doi-asserted-by":"crossref","first-page":"2377","DOI":"10.1016\/j.dam.2007.07.005","article-title":"The harmonious coloring problem is NP-complete for interval and permutation graphs","volume":"155","author":"Asdre","year":"2007","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"10.1016\/j.tcs.2018.12.011_br0110","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0020-0190(89)90221-4","article-title":"Achromatic number is NP-complete for cographs and interval graphs","volume":"31","author":"Bodlaender","year":"1989","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/j.tcs.2018.12.011_br0120","first-page":"13","article-title":"The harmonious chromatic number and the achromatic number","volume":"16","author":"Edwards","year":"1997","journal-title":"Surv. Comb."},{"key":"10.1016\/j.tcs.2018.12.011_br0130","series-title":"WALCOM: Algorithms and Computation","first-page":"136","article-title":"Harmonious coloring on subclasses of colinear graphs","author":"Ioannidou","year":"2010"},{"issue":"1","key":"10.1016\/j.tcs.2018.12.011_br0140","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1016\/j.tcs.2007.05.012","article-title":"NP-completeness results for some problems on subclasses of bipartite and chordal graphs","volume":"381","author":"Asdre","year":"2007","journal-title":"Theoret. Comput. Sci."},{"issue":"2\u20133","key":"10.1016\/j.tcs.2018.12.011_br0150","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/0012-365X(91)90257-3","article-title":"The harmonious coloring number of a graph","volume":"93","author":"Miller","year":"1991","journal-title":"Discrete Math."},{"issue":"01","key":"10.1016\/j.tcs.2018.12.011_br0160","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1017\/S0963548300001802","article-title":"The harmonious chromatic number of bounded degree trees","volume":"5","author":"Edwards","year":"1996","journal-title":"Combin. Probab. Comput."},{"key":"10.1016\/j.tcs.2018.12.011_br0170","article-title":"Graph Theory","volume":"vol. 101","author":"Diestel","year":"2005"},{"issue":"3","key":"10.1016\/j.tcs.2018.12.011_br0180","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1287\/moor.12.3.415","article-title":"Minkowski's convex body theorem and integer programming","volume":"12","author":"Kannan","year":"1987","journal-title":"Math. Oper. Res."},{"issue":"4","key":"10.1016\/j.tcs.2018.12.011_br0190","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1287\/moor.8.4.538","article-title":"Integer programming with a fixed number of variables","volume":"8","author":"Lenstra","year":"1983","journal-title":"Math. Oper. Res."},{"key":"10.1016\/j.tcs.2018.12.011_br0200","series-title":"Parameterized Complexity","author":"Downey","year":"1999"},{"key":"10.1016\/j.tcs.2018.12.011_br0210","series-title":"Parameterized Algorithms, vol. 4","author":"Cygan","year":"2015"},{"issue":"1","key":"10.1016\/j.tcs.2018.12.011_br0220","doi-asserted-by":"crossref","first-page":"P3","DOI":"10.37236\/9","article-title":"On harmonious colouring of trees","volume":"19","author":"Aflaki","year":"2012","journal-title":"Electron. J. Combin."},{"key":"10.1016\/j.tcs.2018.12.011_br0230","series-title":"Combinatorial Optimization: Algorithms and Complexity","author":"Papadimitriou","year":"1982"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397518307321?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397518307321?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,4,6]],"date-time":"2024-04-06T16:33:25Z","timestamp":1712421205000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397518307321"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6]]},"references-count":23,"alternative-id":["S0304397518307321"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2018.12.011","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2019,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Harmonious coloring: Parameterized algorithms and upper bounds","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2018.12.011","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"}]}}