{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:23:22Z","timestamp":1759335802306,"version":"3.41.2"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>Bosek and Krawczyk exhibited an online algorithm for partitioning an online poset of width $w$ into $w^{14\\lg w}$ chains.\u00a0We improve this to $w^{6.5 \\lg w + 7}$ with a simpler and shorter proof by combining the work of\u00a0Bosek &amp; Krawczyk with work of Kierstead &amp; Smith on First-Fit chain partitioning of ladder-free posets.\u00a0We also provide examples illustrating the limits of our approach.<\/jats:p>","DOI":"10.37236\/7231","type":"journal-article","created":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T15:24:42Z","timestamp":1578669882000},"source":"Crossref","is-referenced-by-count":3,"title":["An Easy Subexponential Bound for Online Chain Partitioning"],"prefix":"10.37236","volume":"25","author":[{"given":"Bart\u0142omiej","family":"Bosek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H. A.","family":"Kierstead","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":"Matthew E.","family":"Smith","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"23455","published-online":{"date-parts":[[2018,5,25]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v25i2p28\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v25i2p28\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T04:33:32Z","timestamp":1579235612000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v25i2p28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,25]]},"references-count":0,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2018,4,13]]}},"URL":"https:\/\/doi.org\/10.37236\/7231","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2018,5,25]]},"article-number":"P2.28"}}