Bosek, B., Kierstead, H. A., Krawczyk, T., Matecki, G., & Smith, M. E. (2018). An Easy Subexponential Bound for Online Chain Partitioning. The Electronic Journal of Combinatorics, 25(2), P2.28. https://doi.org/10.37236/7231