{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:41:28Z","timestamp":1740109288034,"version":"3.37.3"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2017,10,23]],"date-time":"2017-10-23T00:00:00Z","timestamp":1508716800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100008394","name":"Natur og Univers, Det Frie Forskningsr\u00e5d","doi-asserted-by":"publisher","award":["DFF-1323-00247"],"award-info":[{"award-number":["DFF-1323-00247"]}],"id":[{"id":"10.13039\/100008394","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100008398","name":"Villum Fonden","doi-asserted-by":"publisher","award":["VKR023219"],"award-info":[{"award-number":["VKR023219"]}],"id":[{"id":"10.13039\/100008398","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2018,11]]},"DOI":"10.1007\/s00453-017-0386-1","type":"journal-article","created":{"date-parts":[[2017,10,24]],"date-time":"2017-10-24T00:07:29Z","timestamp":1508803649000},"page":"3293-3315","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Batch Coloring of Graphs"],"prefix":"10.1007","volume":"80","author":[{"given":"Joan","family":"Boyar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leah","family":"Epstein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lene M.","family":"Favrholdt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0560-3794","authenticated-orcid":false,"given":"Kim S.","family":"Larsen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Asaf","family":"Levin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,10,23]]},"reference":[{"key":"386_CR1","unstructured":"Albers, S., Schraink, S.: Tight bounds for online coloring of basic graph classes. In: 25th Annual European Symposium on Algorithms (ESA). LIPIcs, vol. 87, pp. 7:1\u20137:14. Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik, Germany (2017)"},{"key":"386_CR2","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/j.disopt.2016.04.007","volume":"21","author":"J Balogh","year":"2016","unstructured":"Balogh, J., B\u00e9k\u00e9si, J., D\u00f3sa, G., Galambos, G., Tan, Z.: Lower bound for 3-batched bin packing. Discrete Optim. 21, 14\u201324 (2016)","journal-title":"Discrete Optim."},{"issue":"1\u20132","key":"386_CR3","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/s00607-008-0023-6","volume":"84","author":"J Balogh","year":"2009","unstructured":"Balogh, J., B\u00e9k\u00e9si, J., Galambos, G., Mark\u00f3t, M.C.: Improved lower bounds for semi-online bin packing problems. Computing 84(1\u20132), 139\u2013148 (2009)","journal-title":"Computing"},{"key":"386_CR4","unstructured":"Bar-Noy, A., Bellare, M., Halld\u00f3rsson, M., Shachnai, H., Tamir, T.: On chromatic sums and distributed resource allocation. Inf. Comput. 140, 183\u2013202 (1998)"},{"issue":"1\u20133","key":"386_CR5","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0012-365X(92)90646-W","volume":"100","author":"M Bir\u00f3","year":"1992","unstructured":"Bir\u00f3, M.: Precoloring extension. I. Interval graphs. Discrete Math. 100(1\u20133), 267\u2013279 (1992)","journal-title":"Discrete Math."},{"key":"386_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.tcs.2011.11.010","volume":"418","author":"A Borodin","year":"2012","unstructured":"Borodin, A., Ivan, I., Ye, Y., Zimny, B.: On sum coloring and sum multi-coloring for restricted families of graphs. Theor. Comput. Sci. 418, 1\u201313 (2012)","journal-title":"Theor. Comput. Sci."},{"key":"386_CR7","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/s10951-015-0431-3","volume":"20","author":"G D\u00f3sa","year":"2015","unstructured":"D\u00f3sa, G.: Batched bin packing revisited. J. Sched. 20, 199\u2013209 (2015)","journal-title":"J. Sched."},{"key":"386_CR8","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/j.orl.2016.02.006","volume":"44","author":"L Epstein","year":"2016","unstructured":"Epstein, L.: More on batched bin packing. Oper. Res. Lett. 44, 273\u2013277 (2016)","journal-title":"Oper. Res. Lett."},{"key":"386_CR9","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"MC Golumbic","year":"1980","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Academic Press, Cambridge (1980)"},{"issue":"2","key":"386_CR10","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF02579273","volume":"1","author":"M Gr\u00f6tschel","year":"1981","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1(2), 169\u2013197 (1981)","journal-title":"Combinatorica"},{"key":"386_CR11","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/j.disopt.2004.11.001","volume":"2","author":"G Gutin","year":"2005","unstructured":"Gutin, G., Jensen, T., Yeo, A.: Batched bin packing. Discrete Optim. 2, 71\u201382 (2005)","journal-title":"Discrete Optim."},{"key":"386_CR12","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1002\/jgt.3190120212","volume":"12","author":"A Gy\u00e1rf\u00e1s","year":"1988","unstructured":"Gy\u00e1rf\u00e1s, A., Lehel, J.: On-line and First-Fit colorings of graphs. J. Graph Theory 12, 217\u2013227 (1988)","journal-title":"J. Graph Theory"},{"issue":"C","key":"386_CR13","first-page":"168","volume":"29","author":"A Gy\u00e1rf\u00e1s","year":"1990","unstructured":"Gy\u00e1rf\u00e1s, A., Lehel, J.: First fit and on-line chromatic number of families of graphs. ARS Comb. 29(C), 168\u2013176 (1990)","journal-title":"ARS Comb."},{"key":"386_CR14","doi-asserted-by":"crossref","unstructured":"Halld\u00f3rsson, M.M.: Online coloring known graphs. Electron. J. Comb. 7, R7 (2000)","DOI":"10.37236\/1485"},{"issue":"1","key":"386_CR15","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0304-3975(94)90157-0","volume":"130","author":"MM Halld\u00f3rsson","year":"1994","unstructured":"Halld\u00f3rsson, M.M., Szegedy, M.: Lower bounds for on-line graph coloring. Theor. Comput. Sci. 130(1), 163\u2013174 (1994)","journal-title":"Theor. Comput. Sci."},{"key":"386_CR16","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1016\/j.ejc.2015.05.015","volume":"51","author":"HA Kierstead","year":"2016","unstructured":"Kierstead, H.A., Smith, D.A., Trotter, W.T.: First-fit coloring on interval graphs has performance ratio at least 5. Eur. J. Comb. 51, 236\u2013254 (2016)","journal-title":"Eur. J. Comb."},{"key":"386_CR17","first-page":"143","volume":"33","author":"HA Kierstead","year":"1981","unstructured":"Kierstead, H.A., Trotter, W.T.: An extremal problem in recursive combinatorics. Congr. Numerantium 33, 143\u2013153 (1981)","journal-title":"Congr. Numerantium"},{"issue":"30","key":"386_CR18","doi-asserted-by":"crossref","first-page":"1563","DOI":"10.1155\/S0161171204306216","volume":"2004","author":"E Kubicka","year":"2004","unstructured":"Kubicka, E.: The chromatic sum of a graph: History and recent developments. Int. J. Math. Math. Sci. 2004(30), 1563\u20131573 (2004)","journal-title":"Int. J. Math. Math. Sci."},{"key":"386_CR19","doi-asserted-by":"crossref","unstructured":"Kubicka, E., Schwenk, A.J.: An introduction to chromatic sums. In: 17th ACM Computer Science Conference. ACM Press, pp. 39\u201345 (1989)","DOI":"10.1145\/75427.75430"},{"key":"386_CR20","doi-asserted-by":"crossref","unstructured":"Narayanaswamy, N.S., Babu, R.S.: A note on First-Fit coloring of interval graphs. Order 25(1), 49\u201353 (2008)","DOI":"10.1007\/s11083-008-9076-6"},{"issue":"2","key":"386_CR21","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/PL00009252","volume":"23","author":"S Nicolosoi","year":"1999","unstructured":"Nicolosoi, S., Sarrafzadeh, M., Song, X.: On the sum coloring problem on interval graphs. Algorithmica 23(2), 109\u2013126 (1999)","journal-title":"Algorithmica"},{"issue":"1","key":"386_CR22","doi-asserted-by":"crossref","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 J. Comput. 29(1), 274\u2013287 (1999)","journal-title":"SIAM J. Comput."},{"key":"386_CR23","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/s11518-006-0121-y","volume":"12","author":"G Zhang","year":"2003","unstructured":"Zhang, G., Cai, X., Wong, C.K.: Scheduling two groups of jobs with incomplete information. J. Syst. Sci. Syst. Eng. 12, 73\u201381 (2003)","journal-title":"J. Syst. Sci. Syst. Eng."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-017-0386-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-017-0386-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-017-0386-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,20]],"date-time":"2020-10-20T09:43:32Z","timestamp":1603187012000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-017-0386-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10,23]]},"references-count":23,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2018,11]]}},"alternative-id":["386"],"URL":"https:\/\/doi.org\/10.1007\/s00453-017-0386-1","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"type":"print","value":"0178-4617"},{"type":"electronic","value":"1432-0541"}],"subject":[],"published":{"date-parts":[[2017,10,23]]}}}