{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T18:07:12Z","timestamp":1758823632117},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,7,13]],"date-time":"2011-07-13T00:00:00Z","timestamp":1310515200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Order"],"published-print":{"date-parts":[[2013,3]]},"DOI":"10.1007\/s11083-011-9222-4","type":"journal-article","created":{"date-parts":[[2011,7,12]],"date-time":"2011-07-12T07:38:52Z","timestamp":1310456332000},"page":"1-12","source":"Crossref","is-referenced-by-count":5,"title":["On-Line Dimension for Posets Excluding Two Long Incomparable Chains"],"prefix":"10.1007","volume":"30","author":[{"given":"Stefan","family":"Felsner","sequence":"first","affiliation":[]},{"given":"Tomasz","family":"Krawczyk","sequence":"additional","affiliation":[]},{"given":"William T.","family":"Trotter","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,7,13]]},"reference":[{"key":"9222_CR1","doi-asserted-by":"crossref","unstructured":"Bosek, B., Krawczyk, T.: The sub-exponential upper bound for on-line chain partitioning. In: IEEE 51st Annual Symposium on Foundations of Computer Science, pp. 347\u2013354 (2010). doi: 10.1109\/FOCS.2010.40","DOI":"10.1109\/FOCS.2010.40"},{"issue":"4","key":"9222_CR2","doi-asserted-by":"crossref","first-page":"1992","DOI":"10.1137\/090753863","volume":"23","author":"B Bosek","year":"2010","unstructured":"Bosek, B., Krawczyk, T., Szczypka, E.: First-fit algorithm for on-line chain partition problem. SIAM J. Discrete Math. 23(4), 1992\u20131999 (2010)","journal-title":"SIAM J. Discrete Math."},{"key":"9222_CR3","author":"B Bosek","year":"2011","unstructured":"Bosek, B., Felsner, S., Kloch, K., Krawczyk, T., Matecki, G., Micek, P.: On-line chain partitions of orders: a survey. Order (2011). doi: 10.1007\/s11083-011-9197-1","journal-title":"Order"},{"key":"9222_CR4","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1051\/ita\/1988220404871","volume":"22","author":"M Chrobak","year":"1988","unstructured":"Chrobak, M., \u015alusarek, M.: On some packing problems related to dynamic storage allocation. RAIRO Inf. Th\u00e9or. Appl. 22, 487\u2013499 (1988)","journal-title":"RAIRO Inf. Th\u00e9or. Appl."},{"key":"9222_CR5","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1016\/0022-2496(70)90062-3","volume":"7","author":"PC Fishburn","year":"1970","unstructured":"Fishburn, P.C.: Intransitive indifference with unequal indifference intervals. J. Math. Psychol. 7, 144\u2013149 (1970)","journal-title":"J. Math. Psychol."},{"key":"9222_CR6","unstructured":"Hopkins, L.: Some Problems Involving Combinatorial Structures Determined by Intersections of Intervals and Arcs. Ph.D. thesis, University of South Carolina (1981)"},{"key":"9222_CR7","doi-asserted-by":"crossref","unstructured":"Joret, G., Milans, K.: First-fit is linear on (r\u2009+\u2009s)-free posets. Order (2011, in press)","DOI":"10.1007\/s11083-010-9184-y"},{"key":"9222_CR8","first-page":"63","volume":"268","author":"H Kierstead","year":"1981","unstructured":"Kierstead, H.: An effective version of Dilworth\u2019s theorem. Trans. Am. Math. Soc. 268, 63\u201377 (1981)","journal-title":"Trans. Am. Math. Soc."},{"key":"9222_CR9","doi-asserted-by":"crossref","first-page":"526","DOI":"10.1137\/0401048","volume":"4","author":"H Kierstead","year":"1988","unstructured":"Kierstead, H.: The linearity of first-fit coloring of interval graphs. SIAM J. Discrete Math. 4, 526\u2013530 (1988)","journal-title":"SIAM J. Discrete Math."},{"key":"9222_CR10","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0012-365X(94)00285-Q","volume":"144","author":"H Kierstead","year":"1995","unstructured":"Kierstead, H., Qin, J.: Coloring interval graphs with first-fit. Discrete Math. 144, 47\u201357 (1995)","journal-title":"Discrete Math."},{"key":"9222_CR11","first-page":"143","volume":"33","author":"H Kierstead","year":"1981","unstructured":"Kierstead, H., Trotter, W.T.: An extremal problem in recursive combinatorics. Congressus Numerantium 33, 143\u2013153 (1981)","journal-title":"Congressus Numerantium"},{"key":"9222_CR12","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/BF00396274","volume":"1","author":"H Kierstead","year":"1984","unstructured":"Kierstead, H., McNulty, G., Trotter, W.T.: A theory of recursive dimension for ordered sets. Order 1, 67\u201382 (1984)","journal-title":"Order"},{"key":"9222_CR13","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/s11083-008-9076-6","volume":"25","author":"N Narayanaswamy","year":"2008","unstructured":"Narayanaswamy, N., Babu, R.: A note on first-fit coloring of interval graphs. Order 25, 49\u201353 (2008)","journal-title":"Order"},{"key":"9222_CR14","unstructured":"Pemmaraju, S., Raman, R., Varadarajan, K.: Buffer minimization using max-coloring. In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp.\u00a0562\u2013571 (2004)"},{"key":"9222_CR15","first-page":"25","volume":"5","author":"M \u015alusarek","year":"1993","unstructured":"\u015alusarek, M.: A lower bound for the first fit coloring of interval graphs. Zeszyty Naukowe Uniwersytetu Jagiello\u0144skiego, Prace Informatyczne z. 5, 25\u201332 (1993)","journal-title":"Zeszyty Naukowe Uniwersytetu Jagiello\u0144skiego, Prace Informatyczne z."},{"key":"9222_CR16","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0012-365X(74)90113-7","volume":"8","author":"WT Trotter","year":"1974","unstructured":"Trotter, W.T.: Dimension of the crown $S^k_n$ . Discrete Math. 8, 85\u2013103 (1974)","journal-title":"Discrete Math."},{"key":"9222_CR17","doi-asserted-by":"crossref","DOI":"10.56021\/9780801844256","volume-title":"Combinatorics and Partially Ordered Sets: Dimension Theory","author":"WT Trotter","year":"1992","unstructured":"Trotter, W.T.: Combinatorics and Partially Ordered Sets: Dimension Theory. The Johns Hopkins University Press, Baltimore (1992)"},{"key":"9222_CR18","first-page":"433","volume-title":"Handbook of Combinatorics","author":"WT Trotter","year":"1995","unstructured":"Trotter, W.T.: Partially ordered sets. In: Graham, R.L., Gr\u00f6tschel, M., Lov\u00e1sz, L. (eds.) Handbook of Combinatorics. Elsevier, Amsterdam, 433\u2013480 (1995)"},{"key":"9222_CR19","unstructured":"Woodall, D.R.: Problem no. 4. In: Proceedings of the British Combinatorial Conference 1973, London Math. Soc., Lecture Note Series 13. Cambridge University Press (1974)"}],"container-title":["Order"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11083-011-9222-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11083-011-9222-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11083-011-9222-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,8]],"date-time":"2023-06-08T02:39:52Z","timestamp":1686191992000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11083-011-9222-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,7,13]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,3]]}},"alternative-id":["9222"],"URL":"https:\/\/doi.org\/10.1007\/s11083-011-9222-4","relation":{},"ISSN":["0167-8094","1572-9273"],"issn-type":[{"value":"0167-8094","type":"print"},{"value":"1572-9273","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,7,13]]}}}