Improved lower bound on the on-line chain partitioning of semi-orders with representation (Q6056742): Difference between revisions

@@ Property / cites work @@
+Approximation and Online Algorithms
@@ Property / cites work: Approximation and Online Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+On-line chain partitions of orders: a survey
@@ Property / cites work: On-line chain partitions of orders: a survey / rank @@
+Normal rank
@@ Property / cites work @@
+An easy subexponential bound for online chain partitioning
+Normal rank
@@ Property / cites work @@
+A subexponential upper bound for the on-line chain partitioning problem
+Normal rank
@@ Property / cites work @@
+On-line partitioning of width \(w\) posets into \(w^{O(\log\log w)}\) chains
+Normal rank
@@ Property / cites work @@
+On some packing problem related to dynamic storage allocation
+Normal rank
@@ Property / cites work @@
+Automata, Languages and Programming
@@ Property / cites work: Automata, Languages and Programming / rank @@
+Normal rank
@@ Property / cites work @@
+An Effective Version of Dilworth's Theorem
@@ Property / cites work: An Effective Version of Dilworth's Theorem / rank @@
+Normal rank
@@ Property / cites work @@
+Q4722060
@@ Property / cites work: Q4722060 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3950561
@@ Property / cites work: Q3950561 / rank @@
+Normal rank
@@ Property / cites work @@
+A new lower bound for the on-line coloring of intervals with bandwidth
+Normal rank