Bosek, B., H. A. Kierstead, T. Krawczyk, G. Matecki, and M. E. Smith. “An Easy Subexponential Bound for Online Chain Partitioning”. The Electronic Journal of Combinatorics, Vol. 25, no. 2, May 2018, p. P2.28, doi:10.37236/7231.