The following pages link to (Q4722060):
Displaying 15 items.
- A subexponential upper bound for the on-line chain partitioning problem (Q276436) (← links)
- Lower bounds for randomized algorithms for online chain partitioning (Q456079) (← links)
- On-line chain partitions of orders: a survey (Q766153) (← links)
- Colorful induced subgraphs (Q1197025) (← links)
- The online graph bandwidth problem (Q1198951) (← links)
- On-line algorithms for orders (Q1392200) (← links)
- On-line chain partitions of orders (Q1392205) (← links)
- An easy subexponential bound for online chain partitioning (Q1753118) (← links)
- On-line algorithms for ordered sets and comparability graphs (Q1894374) (← links)
- On-line partitioning of width \(w\) posets into \(w^{O(\log\log w)}\) chains (Q2225405) (← links)
- (Q2857340) (← links)
- A Dichotomy Theorem for First-Fit Chain Partitions (Q5218437) (← links)
- Improved lower bound on the on-line chain partitioning of semi-orders with representation (Q6056742) (← links)
- Improved lower bounds on the on-line chain partitioning of posets of bounded dimension (Q6139864) (← links)
- (EXTRA)ORDINARY EQUIVALENCES WITH THE ASCENDING/DESCENDING SEQUENCE PRINCIPLE (Q6203557) (← links)
