The following pages link to (Q3681937):
Displaying 16 items.
- Fixed-parameter algorithms for cochromatic number and disjoint rectangle stabbing via iterative localization (Q393084) (← links)
- Partitioning extended \(P_4\)-laden graphs into cliques and stable sets (Q456142) (← links)
- A linear time approximation algorithm for permutation flow shop scheduling (Q764320) (← links)
- Partitioning permutations into monotone subsequences (Q820846) (← links)
- A tutorial on the use of graph coloring for some problems in robotics (Q948648) (← links)
- On minimum \(k\)-modal partitions of permutations (Q1018088) (← links)
- An unfeasible matching problem (Q1182611) (← links)
- On cocolourings and cochromatic numbers of graphs (Q1315460) (← links)
- The mutual exclusion scheduling problem for permutation and comparability graphs. (Q1401918) (← links)
- Approximating minimum cocolorings. (Q1853153) (← links)
- Partitioning permutations into increasing and decreasing subsequences (Q1906146) (← links)
- The mixed page number of graphs (Q2167907) (← links)
- Fixed-parameter algorithms for the cocoloring problem (Q2440099) (← links)
- Partitioning cographs into cliques and stable sets (Q2568333) (← links)
- Complete edge-colored permutation graphs (Q2672966) (← links)
- Sorting shuffled monotone sequences (Q5056102) (← links)