The following pages link to (Q4200070):
Displaying 30 items.
- NP-completeness properties about linear extensions (Q581427) (← links)
- Minimizing the sum cost in linear extensions of a poset (Q630194) (← links)
- Jump number of dags having Dilworth number 2 (Q791537) (← links)
- Minimizing completion time for a class of scheduling problems (Q794156) (← links)
- On the greedy dimension of a partial order (Q802583) (← links)
- Jump number problem: The role of matroids (Q1057289) (← links)
- Minimizing the jump number for partially ordered sets: A graph-theoretic approach (Q1057887) (← links)
- Greedy linear extensions to minimize jumps (Q1061150) (← links)
- A setup heuristic for interval orders (Q1064975) (← links)
- An algorithm for minimizing setups in precedence constrained scheduling (Q1069848) (← links)
- Interval orders without odd crowns are defect optimal (Q1079584) (← links)
- On some complexity properties of N-free posets and posets with bounded decomposition diameter (Q1086264) (← links)
- Constructing greedy linear extensions by interchanging chains (Q1087566) (← links)
- NP-completeness results concerning greedy and super greedy linear extensions (Q1087567) (← links)
- A linear time algorithm to find the jump number of 2-dimensional bipartite partial orders (Q1090688) (← links)
- On finding the jump number of a partial order by substitution decomposition (Q1092072) (← links)
- N-free posets as generalizations of series-parallel posets (Q1097286) (← links)
- Greedy posets for the bump-minimizing problem (Q1097902) (← links)
- Substitution and atomic extension on greedy posets (Q1104347) (← links)
- On minimizing jumps for ordered sets (Q1177708) (← links)
- The jump number of Z-free ordered sets (Q1183946) (← links)
- The setup polyhedron of series-parallel posets (Q1372744) (← links)
- Greedy linear extensions with constraints (Q1821122) (← links)
- A linear algorithm to decompose inheritance graphs into modules (Q1892582) (← links)
- The arboreal jump number of an order (Q1943701) (← links)
- Greedy balanced pairs in \(N\)-free ordered sets (Q2217505) (← links)
- Crossing-Optimal Acyclic Hamiltonian Path Completion and Its Application to Upward Topological Book Embeddings (Q3605502) (← links)
- Minimizing Setups for Ordered Sets: A Linear Algebraic Approach (Q3665161) (← links)
- Optimal Linear Extensions by Interchanging Chains (Q3674720) (← links)
- Minimizing Setups for Cycle-Free Ordered Sets (Q3960747) (← links)
