The following pages link to Mutual exclusion scheduling (Q1365931):
Displayed 22 items.
- Equitable colorings of Kronecker products of graphs (Q602760) (← links)
- Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem (Q653316) (← links)
- Approximation algorithms for time constrained scheduling (Q676776) (← links)
- Equitable defective coloring of sparse planar graphs (Q764883) (← links)
- Equitable colorings of Cartesian products of graphs (Q765364) (← links)
- Equitable colorings of bounded treewidth graphs (Q817768) (← links)
- On equitable \(\Delta\)-coloring of graphs with low average degree (Q817775) (← links)
- Scheduling with conflicts: Online and offline algorithms (Q842559) (← links)
- Models and complexity of multibin packing problems (Q864931) (← links)
- Probabilistic analysis for scheduling with conflicts (Q924143) (← links)
- Partitioning a weighted partial order (Q927191) (← links)
- Equitable list coloring of planar graphs without 4- and 6-cycles (Q998523) (← links)
- Mutual exclusion scheduling with interval graphs or related classes. I (Q1003752) (← links)
- Graph coloring with cardinality constraints on the neighborhoods (Q1040081) (← links)
- The mutual exclusion scheduling problem for permutation and comparability graphs. (Q1401918) (← links)
- Scheduling jobs on identical machines with agreement graph (Q1761988) (← links)
- Heuristics and lower bounds for the bin packing problem with conflicts (Q1765544) (← links)
- Window-based greedy contention management for transactional memory: theory and practice (Q1938368) (← links)
- A competitive analysis for balanced transactional memory workloads (Q2429336) (← links)
- Mutual exclusion scheduling with interval graphs or related classes. II (Q2476265) (← links)
- On partitioning interval graphs into proper interval subgraphs and related problems (Q3174235) (← links)
- Locally bounded<i>k</i>-colorings of trees (Q3621974) (← links)