The following pages link to (Q4694722):
Displayed 15 items.
- Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem (Q653316) (← links)
- Equitable colorings of bounded treewidth graphs (Q817768) (← links)
- Scheduling with conflicts: Online and offline algorithms (Q842559) (← links)
- Mutual exclusion scheduling with interval graphs or related classes. I (Q1003752) (← links)
- Treelike comparability graphs (Q1026130) (← links)
- Mutual exclusion scheduling (Q1365931) (← links)
- The mutual exclusion scheduling problem for permutation and comparability graphs. (Q1401918) (← links)
- Clique and anticlique partitions of graphs (Q1584251) (← links)
- Scheduling jobs on identical machines with agreement graph (Q1761988) (← links)
- Scheduling with complete multipartite incompatibility graph on parallel machines: complexity and algorithms (Q2152489) (← links)
- Clique partitioning with value-monotone submodular cost (Q2339847) (← links)
- On the thinness and proper thinness of a graph (Q2414456) (← links)
- Mutual exclusion scheduling with interval graphs or related classes. II (Q2476265) (← links)
- An approximation scheme for bin packing with conflicts (Q5054839) (← links)
- Chain partitions of ordered sets (Q5917347) (← links)