{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T19:20:13Z","timestamp":1743016813408,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662535356"},{"type":"electronic","value":"9783662535363"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-662-53536-3_21","type":"book-chapter","created":{"date-parts":[[2016,9,27]],"date-time":"2016-09-27T16:39:25Z","timestamp":1474994365000},"page":"245-256","source":"Crossref","is-referenced-by-count":0,"title":["Harmonious Coloring: Parameterized Algorithms and Upper Bounds"],"prefix":"10.1007","author":[{"given":"Sudeshna","family":"Kolay","sequence":"first","affiliation":[]},{"given":"Ragukumar","family":"Pandurangan","sequence":"additional","affiliation":[]},{"given":"Fahad","family":"Panolan","sequence":"additional","affiliation":[]},{"given":"Venkatesh","family":"Raman","sequence":"additional","affiliation":[]},{"given":"Prafullkumar","family":"Tale","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,9,28]]},"reference":[{"issue":"1","key":"21_CR1","doi-asserted-by":"crossref","first-page":"P3","DOI":"10.37236\/9","volume":"19","author":"A Aflaki","year":"2012","unstructured":"Aflaki, A., Akbari, S., Edwards, K., Eskandani, D., Jamaali, M., Ravanbod, H.: On harmonious colouring of trees. Electron. J. Comb. 19(1), P3 (2012)","journal-title":"Electron. J. Comb."},{"issue":"3","key":"21_CR2","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1215\/ijm\/1256049011","volume":"21","author":"K Appel","year":"1977","unstructured":"Appel, K., Haken, W.: Every planar map is four colorable. part i: discharging. Ill. J. Math. 21(3), 429\u2013490 (1977)","journal-title":"Ill. J. Math."},{"issue":"17","key":"21_CR3","doi-asserted-by":"crossref","first-page":"2377","DOI":"10.1016\/j.dam.2007.07.005","volume":"155","author":"K Asdre","year":"2007","unstructured":"Asdre, K., Ioannidou, K., Nikolopoulos, S.D.: The harmonious coloring problem is NP-complete for interval and permutation graphs. Discrete Appl. Math. 155(17), 2377\u20132382 (2007)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"21_CR4","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1016\/j.tcs.2007.05.012","volume":"381","author":"K Asdre","year":"2007","unstructured":"Asdre, K., Nikolopoulos, S.D.: NP-completeness results for some problems on subclasses of bipartite and chordal graphs. Theor. Comput. Sci. 381(1), 248\u2013259 (2007)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"21_CR5","doi-asserted-by":"crossref","first-page":"546","DOI":"10.1137\/070683933","volume":"39","author":"A Bj\u00f6rklund","year":"2009","unstructured":"Bj\u00f6rklund, A., Husfeldt, T., Koivisto, M.: Set partitioning via inclusion-exclusion. SIAM J. Comput. 39(2), 546\u2013563 (2009)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"21_CR6","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0020-0190(89)90221-4","volume":"31","author":"HL Bodlaender","year":"1989","unstructured":"Bodlaender, H.L.: Achromatic number is NP-complete for cographs and interval graphs. Inf. Proc. Lett. 31(3), 135\u2013138 (1989)","journal-title":"Inf. Proc. Lett."},{"issue":"810","key":"21_CR7","doi-asserted-by":"crossref","first-page":"818","DOI":"10.1016\/j.tcs.2008.11.010","volume":"410","author":"J Chen","year":"2009","unstructured":"Chen, J., Kanj, I.A., Meng, J., Xia, G., Zhang, F.: On the pseudo-achromatic number problem. Theor. Comput. Sci. 410(810), 818\u2013829 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"21_CR8","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, \u0141., Lokshtanov, D., Marx, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Parameterized Algorithms, vol. 4. Springer, Switzerland (2015)"},{"key":"21_CR9","doi-asserted-by":"crossref","unstructured":"Diestel, R.: Graph Theory. Graduate Texts in Mathematics, vol. 101 (2005)","DOI":"10.1007\/978-3-642-14279-6_7"},{"key":"21_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"RG Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, New York (1999)"},{"issue":"01","key":"21_CR11","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1017\/S0963548300001802","volume":"5","author":"K Edwards","year":"1996","unstructured":"Edwards, K.: The harmonious chromatic number of bounded degree trees. Comb. Probab. Comput. 5(01), 15\u201328 (1996)","journal-title":"Comb. Probab. Comput."},{"key":"21_CR12","first-page":"13","volume":"16","author":"K Edwards","year":"1997","unstructured":"Edwards, K.: The harmonious chromatic number and the achromatic number. Surv. Comb. 16, 13 (1997)","journal-title":"Surv. Comb."},{"issue":"2","key":"21_CR13","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0166-218X(94)00100-R","volume":"57","author":"K Edwards","year":"1995","unstructured":"Edwards, K., McDiarmid, C.: The complexity of harmonious colouring for trees. Discrete Appl. Math. 57(2), 133\u2013144 (1995)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"21_CR14","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/0012-365X(76)90099-6","volume":"16","author":"P Hell","year":"1976","unstructured":"Hell, P., Miller, D.J.: Graph with given achromatic number. Discrete Math. 16(3), 195\u2013207 (1976)","journal-title":"Discrete Math."},{"issue":"3","key":"21_CR15","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1137\/0604032","volume":"4","author":"JE Hopcroft","year":"1983","unstructured":"Hopcroft, J.E., Krishnamoorthy, M.S.: On the harmonious coloring of graphs. SIAM J. Algebraic Discrete Meth. 4(3), 306\u2013311 (1983)","journal-title":"SIAM J. Algebraic Discrete Meth."},{"key":"21_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1007\/978-3-642-11440-3_13","volume-title":"WALCOM: Algorithms and Computation","author":"K Ioannidou","year":"2010","unstructured":"Ioannidou, K., Nikolopoulos, S.D.: Harmonious coloring on subclasses of colinear graphs. In: Rahman, M.S., Fujita, S. (eds.) WALCOM 2010. LNCS, vol. 5942, pp. 136\u2013148. Springer, Heidelberg (2010)"},{"issue":"3","key":"21_CR17","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1287\/moor.12.3.415","volume":"12","author":"R Kannan","year":"1987","unstructured":"Kannan, R.: Minkowski\u2019s convex body theorem and integer programming. Math. Oper. Res. 12(3), 415\u2013440 (1987)","journal-title":"Math. Oper. Res."},{"key":"21_CR18","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"RM Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W., Bohlinger, J.D. (eds.) Complexity of Computer Computations, pp. 85\u2013103. Springer, New York (1972)"},{"issue":"3","key":"21_CR19","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1016\/0020-0190(76)90065-X","volume":"5","author":"EL Lawler","year":"1976","unstructured":"Lawler, E.L.: A note on the complexity of the chromatic number problem. Inf. Proc. Lett. 5(3), 66\u201367 (1976)","journal-title":"Inf. Proc. Lett."},{"issue":"4","key":"21_CR20","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1287\/moor.8.4.538","volume":"8","author":"HW Lenstra Jr","year":"1983","unstructured":"Lenstra Jr., H.W.: Integer programming with a fixed number of variables. Math. Oper. Res. 8(4), 538\u2013548 (1983)","journal-title":"Math. Oper. Res."},{"issue":"2\u20133","key":"21_CR21","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/0012-365X(91)90257-3","volume":"93","author":"Z Miller","year":"1991","unstructured":"Miller, Z., Pritikin, D.: The harmonious coloring number of a graph. Discrete Math. 93(2\u20133), 211\u2013228 (1991)","journal-title":"Discrete Math."},{"key":"21_CR22","unstructured":"Panolan, F., Philip, G., Saurabh, S.: B-chromatic number: Beyond np-hardness. In: 10th International Symposium on Parameterized and Exact Computation, IPEC 2015, 16\u201318 September 2015, Patras, Greece, pp. 389\u2013401 (2015)"},{"key":"21_CR23","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, New York (1982)"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-53536-3_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,26]],"date-time":"2020-09-26T08:32:41Z","timestamp":1601109161000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-53536-3_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662535356","9783662535363"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-53536-3_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}