{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:59:57Z","timestamp":1725559197845},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540241317"},{"type":"electronic","value":"9783540305514"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30551-4_76","type":"book-chapter","created":{"date-parts":[[2010,7,13]],"date-time":"2010-07-13T18:15:37Z","timestamp":1279044937000},"page":"896-907","source":"Crossref","is-referenced-by-count":8,"title":["Weighted Coloring on Planar, Bipartite and Split Graphs: Complexity and Improved Approximation"],"prefix":"10.1007","author":[{"given":"Dominique","family":"de Werra","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mare","family":"Demange","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bruno","family":"Escoffier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jerome","family":"Monnot","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vangelis Th.","family":"Paschos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"76_CR1","volume-title":"Graphs and hypergraphs","author":"C. Berge","year":"1973","unstructured":"Berge, C.: Graphs and hypergraphs. North Holland, Amsterdam (1973)"},{"key":"76_CR2","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/0166-218X(94)90009-4","volume":"55","author":"H.L. Bodlaender","year":"1990","unstructured":"Bodlaender, H.L., Jansen, K., Woeginger, G.J.: Scheduling with incompatible jobs. Discrete Appl. Math.\u00a055, 219\u2013232 (1990)","journal-title":"Discrete Appl. Math."},{"key":"76_CR3","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/0012-365X(90)90144-7","volume":"81","author":"F.R.K. Chung","year":"1990","unstructured":"Chung, F.R.K., Gy\u00e1rf\u00e1s, A., Tuza, Z., Trotter, W.T.: The maximum number of edges in 2K2-free graphs of bounded degree. Discrete Mathematics\u00a081, 129\u2013135 (1990)","journal-title":"Discrete Mathematics"},{"key":"76_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/3-540-36379-3_11","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"M. Demange","year":"2002","unstructured":"Demange, M., de Werra, D., Monnot, J., Paschos, V.T.: Weighted node coloring: When stable sets are expensive. In: Ku\u010dera, L. (ed.) WG 2002. LNCS, vol.\u00a02573, pp. 114\u2013125. Springer, Heidelberg (2002)"},{"key":"76_CR5","volume-title":"Computers and intractability. a guide to the theory of NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and intractability. a guide to the theory of NP-completeness. Freeman, New York (1979)"},{"key":"76_CR6","first-page":"109","volume-title":"Math. Naturwiss Reihe","author":"H. Grotzsch","year":"1959","unstructured":"Grotzsch, H.: Ein dreifarbensatz fur dreikreisfreie netze auf der Kugel. In: Math. Naturwiss Reihe, vol.\u00a08, pp. 109\u2013120. Wiss. Z. Martin Luther Univ, Halle-Wittenberg (1959)"},{"issue":"2","key":"76_CR7","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/S0020-0190(97)00002-1","volume":"61","author":"D.J. Guan","year":"1997","unstructured":"Guan, D.J., Zhu, X.: A Coloring Problem for Weighted Graphs. Inf. Process. Lett.\u00a061(2), 77\u201381 (1997)","journal-title":"Inf. Process. Lett."},{"key":"76_CR8","doi-asserted-by":"crossref","unstructured":"Hassin, R., Monnot, J.: The maximum saving partition problem. Op. Res. Lett (2004)(to appear)","DOI":"10.1016\/j.orl.2004.07.007"},{"key":"76_CR9","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/0166-218X(90)90092-Q","volume":"28","author":"P.L. Hammer","year":"1990","unstructured":"Hammer, P.L., Peled, U.N., Sun, X.: Difference graphs. Discrete Applied Mathematics\u00a028, 35\u201344 (1990)","journal-title":"Discrete Applied Mathematics"},{"key":"76_CR10","unstructured":"Hujter, M., Tuza, Z.: Precoloring extension. II. Graphs classes related to bipartite graphs. Acta Math. Univ. Comeniane LXII,1\u201311 (1993)"},{"key":"76_CR11","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1017\/S0963548300001826","volume":"5","author":"M. Hujter","year":"1996","unstructured":"Hujter, M., Tuza, Z.: Precoloring extension. III. Classes of perfect graphs. Combin. Probab. Comput.\u00a05, 35\u201356 (1996)","journal-title":"Combin. Probab. Comput."},{"key":"76_CR12","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/BF01456961","volume":"77","author":"D. K\u00f6nig","year":"1916","unstructured":"K\u00f6nig, D.: \u00dcber graphen und iher anwendung auf determinantentheorie und mengenlehre. Math. Ann.\u00a077, 453\u2013465 (1916)","journal-title":"Math. Ann."},{"key":"76_CR13","first-page":"139","volume":"62","author":"J. Kratochvil","year":"1993","unstructured":"Kratochvil, J.: Precoloring extension with fixed color bound. Acta Math. Univ. Comen.\u00a062, 139\u2013153 (1993)","journal-title":"Acta Math. Univ. Comen."},{"issue":"2","key":"76_CR14","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1137\/0211025","volume":"11","author":"D. Lichtenstein","year":"1982","unstructured":"Lichtenstein, D.: Planar formulae and their uses. SIAM J. Comput.\u00a011(2), 329\u2013343 (1982)","journal-title":"SIAM J. Comput."},{"key":"76_CR15","doi-asserted-by":"crossref","unstructured":"Marx, D.: NP-completeness of list coloring and precoloring extension on the edges of planar graphs. In: Technical report available to (2004), http:\/\/www.cs.bme.hu\/~dmarx\/publications.html","DOI":"10.1002\/jgt.20085"},{"key":"76_CR16","volume-title":"Computational Complexity","author":"C.H. Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison Wesley, Reading (1994)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30551-4_76","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,31]],"date-time":"2021-10-31T10:14:03Z","timestamp":1635675243000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30551-4_76"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540241317","9783540305514"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30551-4_76","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}