Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Bartlomiej Bosek, Hal A. Kierstead, Tomasz Krawczyk, Grzegorz Matecki, Matthew E. Smith. An Easy Subexponential Bound for Online Chain Partitioning. Electr. J. Comb., 25(2):2, 2018. [doi]
Possibly Related PublicationsThe following publications are possibly variants of this publication: A subexponential upper bound for the on-line chain partitioning problemBartlomiej Bosek, Tomasz Krawczyk. combinatorica, 35(1):1-38, 2015. [doi] The Sub-exponential Upper Bound for On-Line Chain PartitioningBartlomiej Bosek, Tomasz Krawczyk. focs 2010: 347-354 [doi] Variants of Online Chain Partition Problem of PosetsBartlomiej Bosek, Piotr Micek. ENTCS, 140:3-13, 2005. [doi]
The following publications are possibly variants of this publication: