{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:26:12Z","timestamp":1759335972584},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,2,12]],"date-time":"2011-02-12T00:00:00Z","timestamp":1297468800000},"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":[[2012,3]]},"DOI":"10.1007\/s11083-011-9197-1","type":"journal-article","created":{"date-parts":[[2011,2,11]],"date-time":"2011-02-11T08:00:50Z","timestamp":1297411250000},"page":"49-73","source":"Crossref","is-referenced-by-count":11,"title":["On-Line Chain Partitions of Orders: A Survey"],"prefix":"10.1007","volume":"29","author":[{"given":"Bart\u0142omiej","family":"Bosek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Felsner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kamil","family":"Kloch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tomasz","family":"Krawczyk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Grzegorz","family":"Matecki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Piotr","family":"Micek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,2,12]]},"reference":[{"issue":"3","key":"9197_CR1","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/s00446-006-0004-y","volume":"19","author":"A Agarwal","year":"2007","unstructured":"Agarwal, A., Garg, V.K.: Efficient dependency tracking for relevant events in concurrent systems. Distrib. Comput. 19(3), 163\u2013183 (2007)","journal-title":"Distrib. Comput."},{"issue":"1","key":"9197_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s11083-006-9050-0","volume":"24","author":"B Baier","year":"2007","unstructured":"Baier, B., Bosek, B., Micek, P.: On-line chain partitioning of up-growing interval orders. Order 24(1), 1\u201313 (2007)","journal-title":"Order"},{"key":"9197_CR3","unstructured":"Bosek, B.: On-Line Chain Partitioning Approach to Scheduling. PhD thesis, Jagiellonian University (2008)"},{"key":"9197_CR4","doi-asserted-by":"crossref","unstructured":"Bosek, B., Krawczyk, T.: The subexponential upper bound for an on-line chain partitioning problem. In: Proceedings of the 51th Symposium on Foundations of Computer Science, FOCS10, pp. 347\u2013354 (2010)","DOI":"10.1109\/FOCS.2010.40"},{"key":"9197_CR5","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 partitioning problem. SIAM J. Discrete Math. 23, 1992\u20131999 (2010)","journal-title":"SIAM J. Discrete Math."},{"key":"9197_CR6","series-title":"Electron. Notes Theor. Comput. Sci","first-page":"15","volume-title":"Proceedings of the Second Workshop on Computational Logic and Applications (CLA 2004)","author":"P Broniek","year":"2005","unstructured":"Broniek, P.: On-line chain partitioning as a model for real-time scheduling. In: Proceedings of the Second Workshop on Computational Logic and Applications (CLA 2004). Electron. Notes Theor. Comput. Sci., vol. 140, pp. 15\u201329 (electronic). Elsevier, Amsterdam (2005)"},{"issue":"4","key":"9197_CR7","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 problem related to dynamic storage allocation. RAIRO Inform. Th\u00e9or. Appl. 22(4), 487\u2013499 (1988)","journal-title":"RAIRO Inform. Th\u00e9or. Appl."},{"key":"9197_CR8","doi-asserted-by":"crossref","first-page":"600","DOI":"10.2307\/2371374","volume":"63","author":"B Dushnik","year":"1941","unstructured":"Dushnik, B., Miller, E.W.: Partially ordered sets. Am. J. Math. 63, 600\u2013610 (1941)","journal-title":"Am. J. Math."},{"issue":"2","key":"9197_CR9","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1016\/S0304-3975(96)00204-6","volume":"175","author":"S Felsner","year":"1997","unstructured":"Felsner, S.: On-line chain partitions of orders. Theor. Comput. Sci. 175(2), 283\u2013292 (1997)","journal-title":"Theor. Comput. Sci."},{"key":"9197_CR10","unstructured":"Felsner, S., Kloch, K., Matecki, G., Micek, P.: On-Line Chain Partitions of Up-Growing Semi-Orders (submitted)"},{"key":"9197_CR11","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."},{"issue":"2","key":"9197_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(2), 217\u2013227 (1988)","journal-title":"J. Graph Theory"},{"issue":"1","key":"9197_CR13","first-page":"63","volume":"268","author":"HA Kierstead","year":"1981","unstructured":"Kierstead, H.A.: An effective version of Dilworth\u2019s theorem. Trans. Am. Math. Soc. 268(1), 63\u201377 (1981)","journal-title":"Trans. Am. Math. Soc."},{"key":"9197_CR14","doi-asserted-by":"crossref","unstructured":"Kierstead, H.A.: Recursive ordered sets. In: Combinatorics and Ordered Sets. Contemp. Math., vol. 57, pp. 75\u2013102. Amer. Math. Soc., Providence (1986)","DOI":"10.1090\/conm\/057\/856233"},{"issue":"4","key":"9197_CR15","doi-asserted-by":"crossref","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. Discrete Math. 1(4), 526\u2013530 (1988)","journal-title":"SIAM J. Discrete Math."},{"key":"9197_CR16","series-title":"Lecture Notes in Comput. Sci.","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/BFb0029574","volume-title":"Online Algorithms","author":"HA Kierstead","year":"1998","unstructured":"Kierstead, H.A.: Coloring graphs on-line. In: Online Algorithms. Lecture Notes in Comput. Sci., vol. 1442, pP. 281\u2013305. Springer, Berlin (1998)"},{"issue":"1","key":"9197_CR17","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/BF00396274","volume":"1","author":"HA Kierstead","year":"1984","unstructured":"Kierstead, H.A., McNulty, G.F., Trotter, W.T.: A theory of recursive dimension for ordered sets. Order 1(1), 67\u201382 (1984)","journal-title":"Order"},{"issue":"1","key":"9197_CR18","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1137\/S0895480192224737","volume":"7","author":"HA Kierstead","year":"1994","unstructured":"Kierstead, H.A., Penrice, S.G., Trotter, W.T.: On-line coloring and recursive graph theory. SIAM J. Discrete Math. 7(1), 72\u201389 (1994)","journal-title":"SIAM J. Discrete Math."},{"issue":"1\u20133","key":"9197_CR19","doi-asserted-by":"crossref","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. Discrete Math. 144(1\u20133), 47\u201357 (1995)","journal-title":"Discrete Math."},{"key":"9197_CR20","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."},{"key":"9197_CR21","series-title":"NATO ASI Series C","volume-title":"Algorithms and Order","author":"RH M\u00f6hring","year":"1989","unstructured":"M\u00f6hring, R.H.: Computationally tractable classes of ordered sets. In: Rival, I. (ed.) Algorithms and Order. NATO ASI Series C, vol. 255. Kluwer, Norwell (1989)"},{"issue":"1","key":"9197_CR22","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., Subhash Babu, R.: A note on first-fit coloring of interval graphs. Order 25(1), 49\u201353 (2008)","journal-title":"Order"},{"key":"9197_CR23","series-title":"Lecture Notes in Comput. Sci","doi-asserted-by":"crossref","first-page":"1064","DOI":"10.1007\/11523468_86","volume-title":"Automata, Languages and Programming","author":"SV Pemmaraju","year":"2005","unstructured":"Pemmaraju, S.V., Raman, R.: Approximation algorithms for the max-coloring problem. In: Automata, Languages and Programming. Lecture Notes in Comput. Sci., vol. 3580, pp. 1064\u20131075. Springer, Berlin (2005)"},{"key":"9197_CR24","first-page":"139","volume-title":"Proof Techniques in Graph Theory","author":"FS Roberts","year":"1969","unstructured":"Roberts, F.S.: Indifference graphs. In: Proof Techniques in Graph Theory, pp. 139\u2013146. Academic, New York (1969)"},{"key":"9197_CR25","doi-asserted-by":"crossref","first-page":"113","DOI":"10.2307\/2964389","volume":"23","author":"D Scott","year":"1958","unstructured":"Scott, D., Suppes, P.: Foundational aspects of theories of measurement. J. Symb. Logic 23, 113\u2013128 (1958)","journal-title":"J. Symb. Logic"},{"issue":"5","key":"9197_CR26","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1051\/ita\/1995290504231","volume":"29","author":"M \u015alusarek","year":"1995","unstructured":"\u015alusarek, M.: Optimal on-line coloring of circular arc graphs. RAIRO Inform. Th\u00e9or. Appl. 29(5), 423\u2013429 (1995)","journal-title":"RAIRO Inform. Th\u00e9or. Appl."},{"key":"9197_CR27","series-title":"Johns Hopkins Series in the Mathematical Sciences","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. Johns Hopkins Series in the Mathematical Sciences. Johns Hopkins University Press, Baltimore (1992)"},{"key":"9197_CR28","first-page":"433","volume-title":"Handbook of combinatorics, vol. 1","author":"WT Trotter","year":"1995","unstructured":"Trotter, W.T.: Partially ordered sets. In: Handbook of combinatorics, vol. 1, pp. 433\u2013480. Elsevier, Amsterdam (1995)"}],"container-title":["Order"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11083-011-9197-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11083-011-9197-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11083-011-9197-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,5]],"date-time":"2023-06-05T05:56:41Z","timestamp":1685944601000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11083-011-9197-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,2,12]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,3]]}},"alternative-id":["9197"],"URL":"https:\/\/doi.org\/10.1007\/s11083-011-9197-1","relation":{},"ISSN":["0167-8094","1572-9273"],"issn-type":[{"value":"0167-8094","type":"print"},{"value":"1572-9273","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,2,12]]}}}