{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T01:05:18Z","timestamp":1777597518415,"version":"3.51.4"},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,3,21]],"date-time":"2015-03-21T00:00:00Z","timestamp":1426896000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2016,1]]},"DOI":"10.1007\/s00373-015-1562-1","type":"journal-article","created":{"date-parts":[[2015,3,20]],"date-time":"2015-03-20T08:15:06Z","timestamp":1426839306000},"page":"191-198","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Max-Coloring of Vertex-Weighted Graphs"],"prefix":"10.1007","volume":"32","author":[{"given":"Hsiang-Chun","family":"Hsu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gerard Jennhwa","family":"Chang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,3,21]]},"reference":[{"key":"1562_CR1","doi-asserted-by":"crossref","first-page":"469","DOI":"10.2307\/2272247","volume":"41","author":"D Bean","year":"1976","unstructured":"Bean, D.: Effective coloration. J. Symb. Log. 41, 469\u2013480 (1976)","journal-title":"J. Symb. Log."},{"key":"1562_CR2","doi-asserted-by":"crossref","unstructured":"Demange, M., de Werra, D., Monnot, J., Paschos, V.Th.: Weighted node coloring: when stable sets are expensive. Lect. Notes Comput. Sci. 2573, 114\u2013125 (2002)","DOI":"10.1007\/3-540-36379-3_11"},{"key":"1562_CR3","doi-asserted-by":"crossref","unstructured":"Escoffier, B., Monnot, J., Paschos, V.Th.: Weighted coloring: further complexity and approximability results. Inf. Proc. Lett. 97, 98\u2013103 (2006)","DOI":"10.1016\/j.ipl.2005.09.013"},{"key":"1562_CR4","doi-asserted-by":"crossref","unstructured":"Govindarajan, R., Rengarajan, S.: Buffer allocation in regular dataflow networks: an approach based on coloring circular-arc graphs. In: Proceedings of Second International Conference on High Performance Computing, pp. 419\u2013424 (1996)","DOI":"10.1109\/HIPC.1996.565857"},{"key":"1562_CR5","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. Proc. Lett. 61, 77\u201381 (1997)","journal-title":"Inf. Proc. Lett."},{"issue":"1","key":"1562_CR6","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/s11083-008-9076-6","volume":"25","author":"NS Narayanaswamy","year":"2008","unstructured":"Narayanaswamy, N.S., Babu, R.S.: A note on first-fit coloring of interval graphs. Order 25(1), 49\u201353 (2008)","journal-title":"Order"},{"key":"1562_CR7","doi-asserted-by":"crossref","first-page":"1064","DOI":"10.1007\/11523468_86","volume":"3580","author":"SV Pemmaraju","year":"2005","unstructured":"Pemmaraju, S.V., Raman, R.: Approximation algorithms for the max-coloring problem. Lect. Notes Comput. Sci. 3580, 1064\u20131075 (2005)","journal-title":"Lect. Notes Comput. Sci."},{"key":"1562_CR8","unstructured":"Pemmaraju, S.V., Raman, R., Varadarajan, K.: Buffer minimization using max-coloring. In: Proceedings of Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 562\u2013571 (2004)"},{"key":"1562_CR9","doi-asserted-by":"crossref","unstructured":"de Werra, D., Demange, M., Escoffier, B., Monnot, J., Paschos, V.Th.: Weighted coloring on planar, bipartite and split graphs: complexity and approximation. Discret. Appl. Math. 157, 819\u2013832 (2009)","DOI":"10.1016\/j.dam.2008.06.013"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-015-1562-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-015-1562-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-015-1562-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T14:59:40Z","timestamp":1559055580000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-015-1562-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,3,21]]},"references-count":9,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,1]]}},"alternative-id":["1562"],"URL":"https:\/\/doi.org\/10.1007\/s00373-015-1562-1","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,3,21]]}}}