Pages that link to "Item:Q766153"
From MaRDI portal
The following pages link to On-line chain partitions of orders: a survey (Q766153):
Displaying 19 items.
- A subexponential upper bound for the on-line chain partitioning problem (Q276436) (← links)
- First-Fit is linear on posets excluding two long incomparable chains (Q651432) (← links)
- On-line algorithms for orders (Q1392200) (← links)
- On-line chain partitions of orders (Q1392205) (← links)
- Deferred on-line bipartite matching (Q1753111) (← links)
- An easy subexponential bound for online chain partitioning (Q1753118) (← links)
- On-line dimension for posets excluding two long incomparable chains (Q1943697) (← links)
- On-line chain partitions of up-growing semi-orders (Q1943698) (← links)
- On-line partitioning of width \(w\) posets into \(w^{O(\log\log w)}\) chains (Q2225405) (← links)
- Online coloring a token graph (Q2303438) (← links)
- On-line dimension of semi-orders (Q2376894) (← links)
- On-line chain partitioning of up-growing interval orders (Q2385526) (← links)
- A linear-time parameterized algorithm for computing the width of a DAG (Q2672441) (← links)
- Variants of online chain partition problem of posets (Q2851094) (← links)
- On-line chain partitioning as a model for real-time scheduling (Q2851690) (← links)
- Forbidden structures for efficient first-fit chain partitioning (extended abstract) (Q2857340) (← links)
- (Q3575997) (← 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)
