Author:
Kierstead H.A.,Smith Matt Earl
Subject
Discrete Mathematics and Combinatorics
Reference31 articles.
1. On-line chain partitioning of up-growing interval orders;Baier;Order,2007
2. B. Bosek, On-line chain partitioning approach to scheduling, Ph.D. Thesis, Jagiellonian University, 2008.
3. On-line chain partitions of orders: a survey;Bosek;Order,2011
4. B. Bosek, T. Krawczyk, A sub-exponential upper bound for on-line chain partitioning, in: Foundations of Computer Science, Annual IEEE Symposiumon, 2010, pp. 347–354.
5. B. Bosek, T. Krawczyk, G. Matecki, Forbidden structures for efficient First-Fit chain partitioning, Extended Abstract in Proceedings Eurocomb’11, 2011.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献