Bosek, Bartłomiej, H. A. Kierstead, Tomasz Krawczyk, Grzegorz Matecki, and Matthew E. Smith. “An Easy Subexponential Bound for Online Chain Partitioning”. The Electronic Journal of Combinatorics 25, no. 2 (May 25, 2018): #P2.28. Accessed May 28, 2026. https://www.combinatorics.org/ojs/index.php/eljc/article/view/v25i2p28.