{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T11:01:46Z","timestamp":1725879706607},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319530062"},{"type":"electronic","value":"9783319530079"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-53007-9_25","type":"book-chapter","created":{"date-parts":[[2017,2,2]],"date-time":"2017-02-02T05:13:23Z","timestamp":1486012403000},"page":"281-293","source":"Crossref","is-referenced-by-count":3,"title":["Exact and Parameterized Algorithms for (k,\u00a0i)-Coloring"],"prefix":"10.1007","author":[{"given":"Diptapriyo","family":"Majumdar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rian","family":"Neogi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Venkatesh","family":"Raman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Prafullkumar","family":"Tale","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,1,26]]},"reference":[{"issue":"7","key":"25_CR1","doi-asserted-by":"crossref","first-page":"2373","DOI":"10.1109\/18.887851","volume":"46","author":"E Agrell","year":"2000","unstructured":"Agrell, E., Vardy, A., Zeger, K.: Upper bounds for constant-weight codes. IEEE Trans. Inf. Theory 46(7), 2373\u20132395 (2000)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"25_CR2","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1112\/blms\/5.3.302","volume":"5","author":"A Hilton","year":"1973","unstructured":"Hilton, A., Rado, R., Scott, S.: A $$(< 5)$$ ( < 5 ) color theorem for planar graph. Bull. London Math. Soc. 5, 302\u2013306 (1973)","journal-title":"Bull. London Math. Soc."},{"key":"25_CR3","first-page":"123","volume":"9","author":"C Berge","year":"1960","unstructured":"Berge, C.: Les problemes de coloration en th\u00e9orie des graphes. Publ. Inst. Stat. Univ. Paris 9, 123\u2013160 (1960)","journal-title":"Publ. Inst. Stat. Univ. Paris"},{"issue":"1","key":"25_CR4","doi-asserted-by":"crossref","first-page":"2126","DOI":"10.1016\/0012-365X(79)90148-1","volume":"25","author":"B Bollobas","year":"1979","unstructured":"Bollobas, B., Thomason, A.: Set colourings of graphs. Discret. Math. 25(1), 2126 (1979)","journal-title":"Discret. Math."},{"key":"25_CR5","unstructured":"Bonomo, F., Duran, G., Koch, I., Valencia-Pobon, M.: On the $$(k, i)$$ ( k , i ) -coloring of cacti and complete graphs. Ars Combinatorica (2014)"},{"key":"25_CR6","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1016\/0095-8956(82)90079-X","volume":"32","author":"R Brigham","year":"1982","unstructured":"Brigham, R., Dutton, R.: Generalized k-tuple colorings of cycles and other graphs. J. Comb. Theory Ser. B 32, 90\u201394 (1982)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"3","key":"25_CR7","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1016\/S0166-218X(02)00242-1","volume":"127","author":"L Cai","year":"2003","unstructured":"Cai, L.: Parameterized complexity of vertex colouring. Discret. Appl. Math. 127(3), 415\u2013429 (2003)","journal-title":"Discret. Appl. Math."},{"key":"25_CR8","doi-asserted-by":"crossref","first-page":"51","DOI":"10.4007\/annals.2006.164.51","volume":"164","author":"M Chudnovsky","year":"2006","unstructured":"Chudnovsky, M., Robertson, N., Seymour, P., Thomas, R.: The strong perfect graph theorem. Ann. Math. 164, 51\u2013229 (2006)","journal-title":"Ann. Math."},{"key":"25_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., Fomin, F.V., Kowalik, L., Lokshtanov, D., Marx, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Parameterized Algorithms, vol. 4. Springer, Heidelberg (2015)"},{"key":"25_CR10","unstructured":"D\u00edaz, I.M., Zabala, P.: A generalization of the graph coloring problem. Investigation Operativa (1999)"},{"key":"25_CR11","volume-title":"Parameterized Complexity","author":"RG Downey","year":"2012","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer Science and Business Media, New York (2012)"},{"issue":"23","key":"25_CR12","doi-asserted-by":"crossref","first-page":"2513","DOI":"10.1016\/j.tcs.2010.10.043","volume":"412","author":"J Fiala","year":"2011","unstructured":"Fiala, J., Golovach, P.A., Kratochv\u00edl, J.: Parameterized complexity of coloring problems: treewidth versus vertex cover. Theor. Comput. Sci. 412(23), 2513\u20132523 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"25_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-16533-7","volume-title":"Exact Exponential Algorithms: Texts in Theoretical Computer Science. An EATCS Series","author":"FV Fomin","year":"2010","unstructured":"Fomin, F.V., Kratsch, D.: Exact Exponential Algorithms: Texts in Theoretical Computer Science. An EATCS Series. Springer, Heidelberg (2010)"},{"issue":"1","key":"25_CR14","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0166-218X(83)90020-3","volume":"5","author":"RW Irving","year":"1983","unstructured":"Irving, R.W.: NP-completeness of a family of graph-colouring problems. Discret. Appl. Math. 5(1), 111\u2013117 (1983)","journal-title":"Discret. Appl. Math."},{"key":"25_CR15","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1016\/j.ic.2013.08.005","volume":"231","author":"BMP Jansen","year":"2013","unstructured":"Jansen, B.M.P., Kratsch, S.: Data reduction for graph coloring problems. Inf. Comput. 231, 70\u201388 (2013)","journal-title":"Inf. Comput."},{"key":"25_CR16","doi-asserted-by":"crossref","unstructured":"Koivisto, M.: An $$\\cal{O}^*(2^{n})$$ O \u2217 ( 2 n ) algorithm for graph coloring and other partitioning problems via inclusion-exclusion. In: FOCS, pp. 583\u2013590. IEEE (2006)","DOI":"10.1109\/FOCS.2006.11"},{"key":"25_CR17","volume-title":"Combinatorial Optimization: Algorithms and Complexity","author":"CH Papadimitriou","year":"1982","unstructured":"Papadimitriou, C.H., Steiglitz, K.: Combinatorial Optimization: Algorithms and Complexity. Courier Corporation, Mineola (1982)"},{"key":"25_CR18","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0095-8956(76)90010-1","volume":"20","author":"S Stahl","year":"1976","unstructured":"Stahl, S.: n-tuple colorings and associated graphs. J. Comb. Theory Ser. B 20, 185\u2013203 (1976)","journal-title":"J. Comb. Theory Ser. B"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Discrete Applied Mathematics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-53007-9_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,18]],"date-time":"2019-09-18T01:39:12Z","timestamp":1568770752000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-53007-9_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319530062","9783319530079"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-53007-9_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}