{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T01:33:45Z","timestamp":1742952825121,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"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_5","type":"book-chapter","created":{"date-parts":[[2016,9,27]],"date-time":"2016-09-27T12:39:25Z","timestamp":1474979965000},"page":"50-61","source":"Crossref","is-referenced-by-count":1,"title":["Saving Colors and Max Coloring: Some Fixed-Parameter Tractability Results"],"prefix":"10.1007","author":[{"given":"Bruno","family":"Escoffier","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,9,28]]},"reference":[{"issue":"4","key":"5_CR1","doi-asserted-by":"crossref","first-page":"2029","DOI":"10.1137\/140954167","volume":"28","author":"J Ara\u00fajo","year":"2014","unstructured":"Ara\u00fajo, J., Nisse, N., P\u00e9rennes, S.: Weighted coloring in trees. SIAM J. Discrete Math. 28(4), 2029\u20132041 (2014)","journal-title":"SIAM J. Discrete Math."},{"issue":"3","key":"5_CR2","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. Discrete Appl. Math. 127(3), 415\u2013429 (2003)","journal-title":"Discrete Appl. Math."},{"key":"5_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/978-3-540-30559-0_22","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"B Chor","year":"2004","unstructured":"Chor, B., Fellows, M., Juedes, D.W.: Linear kernels in linear time, or how to save k colors in O(\n            $$\\text{ n }^2$$\n          ) steps. In: Hromkovi\u010d, J., Nagl, M., Westfechtel, B. (eds.) WG 2004. LNCS, vol. 3353, pp. 257\u2013269. Springer, Heidelberg (2004)"},{"issue":"4","key":"5_CR4","doi-asserted-by":"crossref","first-page":"819","DOI":"10.1016\/j.dam.2008.06.013","volume":"157","author":"D Werra de","year":"2009","unstructured":"de Werra, D., Demange, M., Escoffier, B., Monnot, J., Paschos, V.T.: Weighted coloring on planar, bipartite and split graphs: complexity and approximation. Discrete Appl. Math. 157(4), 819\u2013832 (2009)","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"5_CR5","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/s10951-006-0003-7","volume":"10","author":"M Demange","year":"2007","unstructured":"Demange, M., de Werra, D., Monnot, J., Paschos, V.T.: Time slot scheduling of compatible jobs. J. Sched. 10(2), 111\u2013127 (2007)","journal-title":"J. Sched."},{"issue":"3","key":"5_CR6","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1016\/j.ipl.2005.09.013","volume":"97","author":"B Escoffier","year":"2006","unstructured":"Escoffier, B., Monnot, J., Paschos, V.T.: Weighted coloring: further complexity and approximability results. Inf. Process. Lett. 97(3), 98\u2013103 (2006)","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"5_CR7","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","volume":"1","author":"MR Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S., Stockmeyer, L.J.: Some simplified NP-complete graph problems. Theor. Comput. Sci. 1(3), 237\u2013267 (1976)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"5_CR8","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/S0020-0190(97)00002-1","volume":"61","author":"DJ Guan","year":"1997","unstructured":"Guan, D.J., Zhu, X.: A coloring problem for weighted graphs. Inf. Process. Lett. 61(2), 77\u201381 (1997)","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"5_CR9","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1016\/j.orl.2004.07.007","volume":"33","author":"R Hassin","year":"2005","unstructured":"Hassin, R., Monnot, J.: The maximum saving partition problem. Oper. Res. Lett. 33(3), 242\u2013248 (2005)","journal-title":"Oper. Res. Lett."},{"key":"5_CR10","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":"5_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/978-3-642-22006-7_16","volume-title":"Automata, Languages and Programming","author":"T Nonner","year":"2011","unstructured":"Nonner, T.: Clique clustering yields a PTAS for max-coloring interval graphs. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part I. LNCS, vol. 6755, pp. 183\u2013194. Springer, Heidelberg (2011)"},{"key":"5_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"1064","DOI":"10.1007\/11523468_86","volume-title":"Automata, Languages and Programming","author":"SV Pemmaraju","year":"2005","unstructured":"Pemmaraju, S.V., Raman, R.: Approximation algorithms for the max-coloring problem. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 1064\u20131075. Springer, Heidelberg (2005)"}],"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_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,7]],"date-time":"2017-06-07T05:03:19Z","timestamp":1496811799000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-53536-3_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662535356","9783662535363"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-53536-3_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}