{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T18:30:53Z","timestamp":1768588253441,"version":"3.49.0"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032067050","type":"print"},{"value":"9783032067067","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:00:00Z","timestamp":1759276800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:00:00Z","timestamp":1759276800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-06706-7_11","type":"book-chapter","created":{"date-parts":[[2025,9,30]],"date-time":"2025-09-30T23:59:59Z","timestamp":1759276799000},"page":"157-171","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the\u00a0FirstFit Algorithm for\u00a0Online Unit-Interval Coloring"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0000-5517-6095","authenticated-orcid":false,"given":"Bob","family":"Krekelberg","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0194-9360","authenticated-orcid":false,"given":"Alison Hsiang-Hsuan","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,10,1]]},"reference":[{"issue":"4","key":"11_CR1","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1051\/ITA\/1988220404871","volume":"22","author":"M Chrobak","year":"1988","unstructured":"Chrobak, M., \u015alusarek, M.: On some packing problem related to dynamic storage allocation. RAIRO Theor. Informatics Appl. 22(4), 487\u2013499 (1988). https:\/\/doi.org\/10.1051\/ITA\/1988220404871","journal-title":"RAIRO Theor. Informatics Appl."},{"key":"11_CR2","doi-asserted-by":"publisher","unstructured":"Chybowska-Sok\u00f3\u0142, J., Gutowski, G., Junosza-Szaniawski, K., Mikos, P., Polak, A.: Online coloring of short intervals. Eur. J. Comb. 118, 103919 (2024). https:\/\/doi.org\/10.1016\/J.EJC.2024.103919","DOI":"10.1016\/J.EJC.2024.103919"},{"key":"11_CR3","doi-asserted-by":"publisher","unstructured":"Curbelo, I.R.: The on-line width of various classes of posets. Ph. D. thesis, University of Louisville (2022). https:\/\/doi.org\/10.18297\/etd\/3974","DOI":"10.18297\/etd\/3974"},{"key":"11_CR4","unstructured":"Curbelo, I.R.: Online coloring of short interval graphs and two-count interval graphs. arXiv:2412.17193 (2024)"},{"key":"11_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"602","DOI":"10.1007\/11523468_49","volume-title":"Automata, languages and programming","author":"L Epstein","year":"2005","unstructured":"Epstein, L., Levy, M.: Online Interval Coloring and Variants. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 602\u2013613. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11523468_49"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Elsevier (2004)","DOI":"10.1016\/S0167-5060(04)80051-7"},{"issue":"4","key":"11_CR7","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1137\/0401048","volume":"1","author":"HA Kierstead","year":"1988","unstructured":"Kierstead, H.A.: The linearity of first-fit coloring of interval graphs. SIAM J. Discret. Math. 1(4), 526\u2013530 (1988). https:\/\/doi.org\/10.1137\/0401048","journal-title":"SIAM J. Discret. Math."},{"issue":"1\u20133","key":"11_CR8","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0012-365X(94)00285-Q","volume":"144","author":"HA Kierstead","year":"1995","unstructured":"Kierstead, H.A., Qin, J.: Coloring interval graphs with first-fit. Discret. Math. 144(1\u20133), 47\u201357 (1995). https:\/\/doi.org\/10.1016\/0012-365X(94)00285-Q","journal-title":"Discret. Math."},{"key":"11_CR9","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1016\/J.EJC.2015.05.015","DOI":"10.1016\/J.EJC.2015.05.015"},{"key":"11_CR10","first-page":"143","volume":"33","author":"HA Kierstead","year":"1981","unstructured":"Kierstead, H.A., Trotter, W.T.: An extremal problem in recursive combinatorics. Congr. Numer. 33, 143\u2013153 (1981)","journal-title":"Congr. Numer."},{"issue":"1","key":"11_CR11","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1007\/S11083-008-9076-6","journal-title":"Order"},{"key":"11_CR12","doi-asserted-by":"publisher","unstructured":"Pemmaraju, S.V., Raman, R., Varadarajan, K.R.: Max-coloring and online coloring with bandwidths on interval graphs. ACM Trans. Algorithms 7(3), 35:1\u201335:21 (2011). https:\/\/doi.org\/10.1145\/1978782.1978790","DOI":"10.1145\/1978782.1978790"},{"key":"11_CR13","doi-asserted-by":"publisher","unstructured":"\u015alusarek, M.: A coloring algorithm for interval graphs. In: Kreczmar, A., Mirkowska, G. (eds.) MFCS 1989. LNCS, vol. 379, pp. 471\u2013480. Springer, Heidelberg (1989). https:\/\/doi.org\/10.1007\/3-540-51486-4_93","DOI":"10.1007\/3-540-51486-4_93"},{"issue":"2","key":"11_CR14","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1016\/0097-3165(76)90066-2","volume":"21","author":"HS Witsenhausen","year":"1976","unstructured":"Witsenhausen, H.S.: On woodall\u2019s interval problem. J. Comb. Theory A 21(2), 222\u2013229 (1976). https:\/\/doi.org\/10.1016\/0097-3165(76)90066-2","journal-title":"J. Comb. Theory A"}],"container-title":["Lecture Notes in Computer Science","Approximation and Online Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-06706-7_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T07:07:26Z","timestamp":1768547246000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-06706-7_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,1]]},"ISBN":["9783032067050","9783032067067"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-06706-7_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10,1]]},"assertion":[{"value":"1 October 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"WAOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Approximation and Online Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Warsaw","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 September 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"waoa2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/algo-conference.org\/2025\/waoa\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}