Felsner, Stefan, Kloch, Kamil, Matecki, Grzegorz, Micek, Piotr
We analyze special cases of the on-line chain partition problem of up-growing orders. One result is a lower bound for 2-dimensional orders. Together with the old upper bound this yields the precise...