Author:
Felsner Stefan,Kloch Kamil,Matecki Grzegorz,Micek Piotr
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Geometry and Topology,Algebra and Number Theory
Reference7 articles.
1. Baier, P., Bosek, B., Micek, P.: On-line chain partitioning of up-growing interval orders. Order 24(1), 1–13 (2007)
2. Bosek, B., Felsner, S., Kloch, K., Krawczyk, T., Matecki, G., Micek, P.: On-line chain partitions of orders: a survey. Order (2011). doi: 10.1007/ s11083-011-9197-1
3. Felsner, S.: On-line chain partitions of orders. Theor. Comput. Sci. 175(2), 283–292 (1997)
4. Kierstead, H.A.: An effective version of Dilworth’s theorem. Trans. Am. Math. Soc. 268(1), 63–77 (1981)
5. Kierstead, H.A.: Recursive ordered sets. In: Combinatorics and Ordered Sets, Arcata, Calif., 1985. Contemp. Math., vol. 57, pp. 75–102. Amer. Math. Soc., Providence, RI (1986)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献