{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:25:45Z","timestamp":1759335945712},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,9,10]],"date-time":"2014-09-10T00:00:00Z","timestamp":1410307200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2015,2]]},"DOI":"10.1007\/s00493-014-2908-7","type":"journal-article","created":{"date-parts":[[2014,9,11]],"date-time":"2014-09-11T03:43:56Z","timestamp":1410407036000},"page":"1-38","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A subexponential upper bound for the on-line chain partitioning problem"],"prefix":"10.1007","volume":"35","author":[{"given":"Bart\u0142omiej","family":"Bosek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tomasz","family":"Krawczyk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,9,10]]},"reference":[{"key":"2908_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s11083-006-9050-0","volume":"24","author":"P. Baier","year":"2007","unstructured":"P. Baier, B. Bosek and P. Micek: On-line chain partitioning of up-growing interval orders, Order 24 (2007), 1\u201313.","journal-title":"Order"},{"key":"2908_CR2","volume-title":"Ph.D. thesis","author":"B. Bosek","year":"2008","unstructured":"B. Bosek: On-line chain partitioning approach to scheduling, Ph.D. thesis, Jagiellonian University, 2008."},{"key":"2908_CR3","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/s11083-011-9197-1","volume":"29","author":"B. Bosek","year":"2012","unstructured":"B. Bosek, S. Felsner, K. Kloch, T. Krawczyk, G. Matecki and P. Micek: On-line chain partitions of orders: survey, Order 29 (2012), 49\u201373.","journal-title":"Order"},{"key":"2908_CR4","volume-title":"manuscript","author":"B. Bosek","year":"2013","unstructured":"B. Bosek, H. A. Kierstead, T. Krawczyk, G. Matecki and M. E. Smith: Regular posets and on-line chain partitioning, manuscript, 2013."},{"key":"2908_CR5","volume-title":"unpublished result","author":"B. Bosek","year":"2010","unstructured":"B. Bosek and T. Krawczyk: On-line chain partitioning of 2-dimensional orders, unpublished result, 2010."},{"key":"2908_CR6","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1137\/110854394","volume":"27","author":"B. Bosek","year":"2013","unstructured":"B. Bosek, T. Krawczyk and G. Matecki: First\u2014fit coloring of incomparability graphs, SIAM J. Discrete Math. 27 (2013), 126\u2013140.","journal-title":"SIAM J. Discrete Math"},{"key":"2908_CR7","doi-asserted-by":"crossref","first-page":"1992","DOI":"10.1137\/090753863","volume":"23","author":"B. Bosek","year":"2010","unstructured":"B. Bosek, T. Krawczyk and E. Szczypka: First\u2014fit algorithm for the on-line chain partitioning problem, SIAM J. Discrete Math. 23 (2010), 1992\u20131999.","journal-title":"SIAM J. Discrete Math"},{"key":"2908_CR8","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/j.entcs.2005.06.027","volume":"140","author":"P. Broniek","year":"2005","unstructured":"P. Broniek: On-line chain partitioning as a model for real-time scheduling, in: Proceedings of the Second Workshop on Computational Logic and Applications (CLA 2004) (Amsterdam), Electron. Notes Theor. Comput. Sci. 140, Elsevier, 2005, 15\u201329 (electronic).","journal-title":"Notes Theor. Comput. Sci."},{"key":"2908_CR9","first-page":"487","volume":"22","author":"M. Chrobak","year":"1988","unstructured":"M. Chrobak and M. \u015blusarek: On some packing problem related to dynamic storage allocation, RAIRO Inform. Th\u00e9or. Appl. 22 (1988), 487\u2013499.","journal-title":"Th\u00e9or. Appl."},{"key":"2908_CR10","doi-asserted-by":"crossref","first-page":"1068","DOI":"10.1137\/110855806","volume":"26","author":"V. Dujmovi\u0106","year":"2012","unstructured":"V. Dujmovi\u0106, G. Joret and D. R. Wood: An Improved Bound for First-Fit on Posets Without Two Long Incomparable Chains, SIAM J. Discrete Math. 26 (2012), 1068\u20131075.","journal-title":"SIAM J. Discrete Math"},{"key":"2908_CR11","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1016\/S0304-3975(96)00204-6","volume":"175","author":"S. Felsner","year":"1997","unstructured":"S. Felsner: On-line chain partitions of orders, Theoret. Comput. Sci. 175 (1997), 283\u2013292.","journal-title":"Theoret. Comput. Sci."},{"key":"2908_CR12","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/s11083-011-9228-y","volume":"30","author":"S. Felsner","year":"2013","unstructured":"S. Felsner, K. Kloch, G. Matecki and P. Micek: On-line Chain Partitions of Up-growing Semi-orders, Order 30 (2013), 85\u2013101.","journal-title":"Order"},{"key":"2908_CR13","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1007\/s11083-010-9184-y","volume":"28","author":"G. Joret","year":"2011","unstructured":"G. Joret and K. Milans: First\u2014fit is linear on posets excluding two long incomparable chains, Order 28 (2011), 455\u2013464.","journal-title":"Order"},{"key":"2908_CR14","first-page":"63","volume":"268","author":"H. A. Kierstead","year":"1981","unstructured":"H. A. Kierstead: An e ective version of Dilworth\u2019s theorem, Trans. Amer. Math. Soc. 268 (1981), 63\u201377.","journal-title":"Trans. Amer. Math. Soc."},{"key":"2908_CR15","first-page":"75","volume-title":"Contemp. Math. 57, Amer. Math. Soc.","author":"H. A. Kierstead","year":"1986","unstructured":"H. A. Kierstead: Recursive ordered sets, Combinatorics and ordered sets (Arcata, Calif., 1985), Contemp. Math. 57, Amer. Math. Soc., Providence, RI, 1986, 75\u2013102."},{"key":"2908_CR16","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/BF00396274","volume":"1","author":"H. A. Kierstead","year":"1984","unstructured":"H. A. Kierstead, G. F. McNulty and W. T. Trotter: A theory of recursive dimension for ordered sets, Order 1 (1984), 67\u201382.","journal-title":"Order"},{"key":"2908_CR17","doi-asserted-by":"crossref","first-page":"474","DOI":"10.1016\/j.ejc.2012.07.007","volume":"34","author":"H. A. Kierstead","year":"2013","unstructured":"H. A. Kierstead and M. E. Smith: On First\u2014fit coloring of ladder-free posets, European J. Combin. 34 (2013), 474\u2013489.","journal-title":"European J. Combin"},{"key":"2908_CR18","first-page":"143","volume":"33","author":"H. A. Kierstead","year":"1981","unstructured":"H. A. Kierstead and W. T. Trotter: An extremal problem in recursive combi-natorics, in: Proceedings of the Twelfth Southeastern Conference on Combinatorics, Graph Theory and Computing, Vol. II (Baton Rouge, La., 1981), 33, 1981, 143\u2013153.","journal-title":"Graph Theory and Computing"},{"key":"2908_CR19","volume-title":"Ph.D. thesis, Jagiellonian University","author":"P. Micek","year":"2008","unstructured":"P. Micek: On-line chain partitioning of semi-orders, Ph.D. thesis, Jagiellonian University, 2008."},{"key":"2908_CR20","first-page":"433","volume-title":"Elsevier, Amsterdam","author":"W. T. Trotter","year":"1995","unstructured":"W. T. Trotter: Partially ordered sets, Handbook of combinatorics, 1, Elsevier, Amsterdam, 1995, 433\u2013480."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-014-2908-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-014-2908-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-014-2908-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T01:32:50Z","timestamp":1559093570000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-014-2908-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,9,10]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,2]]}},"alternative-id":["2908"],"URL":"https:\/\/doi.org\/10.1007\/s00493-014-2908-7","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,9,10]]}}}