Pages that link to "Item:Q1753118"
From MaRDI portal
The following pages link to An easy subexponential bound for online chain partitioning (Q1753118):
Displaying 5 items.
- On-line partitioning of width \(w\) posets into \(w^{O(\log\log w)}\) chains (Q2225405) (← links)
- On-line chain partitioning of up-growing interval orders (Q2385526) (← links)
- First-Fit Algorithm for the On-Line Chain Partitioning Problem (Q3058541) (← 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)