Recommendations
Cites work
- scientific article; zbMATH DE number 3769624 (Why is no real title available?)
- scientific article; zbMATH DE number 53952 (Why is no real title available?)
- scientific article; zbMATH DE number 3993569 (Why is no real title available?)
- scientific article; zbMATH DE number 863477 (Why is no real title available?)
- scientific article; zbMATH DE number 6157240 (Why is no real title available?)
- scientific article; zbMATH DE number 3307330 (Why is no real title available?)
- A note on first-fit coloring of interval graphs
- A theory of recursive dimension of ordered sets
- An Effective Version of Dilworth's Theorem
- Automata, Languages and Programming
- Coloring interval graphs with First-Fit
- Efficient dependency tracking for relevant events in concurrent systems
- First-Fit Algorithm for the On-Line Chain Partitioning Problem
- Foundational aspects of theories of measurement
- Intransitive indifference with unequal indifference intervals
- On some packing problem related to dynamic storage allocation
- On-Line Coloring and Recursive Graph Theory
- On-line and first fit colorings of graphs
- On-line chain partitioning as a model for real-time scheduling
- On-line chain partitioning of up-growing interval orders
- On-line chain partitions of orders
- On-line chain partitions of up-growing semi-orders
- Optimal on-line coloring of circular arc graphs
- Partially Ordered Sets
- The Linearity of First-Fit Coloring of Interval Graphs
Cited in
(18)- On-line dimension for posets excluding two long incomparable chains
- scientific article; zbMATH DE number 5762570 (Why is no real title available?)
- A subexponential upper bound for the on-line chain partitioning problem
- First-Fit is linear on posets excluding two long incomparable chains
- Improved lower bounds on the on-line chain partitioning of posets of bounded dimension
- Improved lower bound on the on-line chain partitioning of semi-orders with representation
- An easy subexponential bound for online chain partitioning
- On-line chain partitions of up-growing semi-orders
- On-line dimension of semi-orders
- On-line partitioning of width \(w\) posets into \(w^{O(\log\log w)}\) chains
- On-line chain partitioning of up-growing interval orders
- Online dimension of partially ordered sets
- A linear-time parameterized algorithm for computing the width of a DAG
- Variants of online chain partition problem of posets
- On-line chain partitioning as a model for real-time scheduling
- Deferred on-line bipartite matching
- Online coloring a token graph
- Forbidden structures for efficient first-fit chain partitioning (extended abstract)
This page was built for publication: On-line chain partitions of orders: a survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q766153)
