The following pages link to (Q3676161):
Displaying 14 items.
- Minimizing setups in ordered sets of fixed width (Q762183) (← links)
- On some complexity properties of N-free posets and posets with bounded decomposition diameter (Q1086264) (← links)
- Greedy posets for the bump-minimizing problem (Q1097902) (← links)
- Minimizing the jump number for partially-ordered sets: A graph-theoretic approach. II (Q1104949) (← links)
- An algorithm for solving the jump number problem (Q1113927) (← links)
- Alternating cycle-free matchings (Q1325959) (← links)
- Computing the jump number on semi-orders is polynomial (Q1329825) (← links)
- Parallel \(N\)-free order recognition (Q1392213) (← links)
- Height counting of unlabeled interval and \(N\)-free posets. (Q1420594) (← links)
- Review of properties of different precedence graphs for scheduling problems (Q1847252) (← links)
- The jump number problem on interval orders: A 3/2 approximation algorithm (Q1898347) (← links)
- The arboreal jump number of an order (Q1943701) (← links)
- Generating linear extensions of posets by transpositions (Q2368024) (← links)
- Examples of Jump-Critical Ordered Sets (Q3691788) (← links)
