{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:30:02Z","timestamp":1725564602481},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540212362"},{"type":"electronic","value":"9783540247494"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24749-4_7","type":"book-chapter","created":{"date-parts":[[2010,9,8]],"date-time":"2010-09-08T19:01:54Z","timestamp":1283972514000},"page":"68-80","source":"Crossref","is-referenced-by-count":2,"title":["Sum-Multicoloring on Paths"],"prefix":"10.1007","author":[{"given":"Annam\u00e1ria","family":"Kov\u00e1cs","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1006\/jagm.1998.0938","volume":"28","author":"A. Bar-Noy","year":"1998","unstructured":"Bar-Noy, A., Kortsarz, G.: The minimum color-sum of bipartite graphs. Journal of Algorithms\u00a028, 339\u2013365 (1998)","journal-title":"Journal of Algorithms"},{"issue":"2","key":"7_CR2","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1006\/jagm.2001.1210","volume":"42","author":"M.M. Halld\u00f3rsson","year":"2002","unstructured":"Halld\u00f3rsson, M.M., Kortsarz, G.: Tools for multicoloring with applications to planar graphs and partial k-trees. Journal of Algorithms\u00a042(2), 334\u2013366 (2002)","journal-title":"Journal of Algorithms"},{"key":"7_CR3","unstructured":"Kov\u00e1cs, A.: Sum-multicoloring on paths. Research Report MPI-I-2003-1-015, Max- Planck-Institut f\u00fcr Informatik (July 2003)"},{"key":"7_CR4","unstructured":"Kubicka, E.: The Chromatic Sum of a Graph. PhD thesis, Western Michigan University (1989)"},{"key":"7_CR5","series-title":"Lecture Notes in Computer Science","volume-title":"Proc. 27th Intl. Symp. Math. Found. Comput. Sci. (MFCS)","author":"D. Marx","year":"2002","unstructured":"Marx, D.: The complexity of tree multicolorings. In: Proc. 27th Intl. Symp. Math. Found. Comput. Sci (MFCS). LNCS, Springer, Heidelberg (2002)"},{"key":"7_CR6","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1006\/inco.1997.2677","volume":"140","author":"A. Bar-Noy","year":"1998","unstructured":"Bar-Noy, A., Bellare, M., Halld\u00f3rsson, M.M., Shachnai, H., Tamir, T.: On chromatic sums and distributed resource allocation. Inf. and Comput.\u00a0140, 183\u2013202 (1998)","journal-title":"Inf. and Comput."},{"key":"7_CR7","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1006\/jagm.2000.1106","volume":"37","author":"A. Bar-Noy","year":"2000","unstructured":"Bar-Noy, A., Halld\u00f3rsson, M.M., Kortsarz, G., Shachnai, H., Salman, R.: Sum multicoloring of graphs. Journal of Algorithms\u00a037, 422\u2013450 (2000)","journal-title":"Journal of Algorithms"},{"issue":"2","key":"7_CR8","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/S0890-5401(02)00032-9","volume":"180","author":"M.M. Halld\u00f3rsson","year":"2002","unstructured":"Halld\u00f3rsson, M.M., Kortsarz, G., Proskurowski, A., Salman, R., Shachnai, H., Telle, J.A.: Multi-coloring trees. Information and Computation\u00a0180(2), 113\u2013129 (2002)","journal-title":"Information and Computation"},{"issue":"1","key":"7_CR9","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1137\/S0097539796303123","volume":"29","author":"T. Szkaliczki","year":"1999","unstructured":"Szkaliczki, T.: Routing with minimum wire length in the dogleg-free Manhattan model is NP-complete. SIAM Journal on Computing\u00a029(1), 274\u2013287 (1999)","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","STACS 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24749-4_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T05:19:13Z","timestamp":1553059153000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24749-4_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540212362","9783540247494"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24749-4_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}