The following pages link to Mutual exclusion scheduling (Q1365931):
Displaying 49 items.
- Equitable colorings of Cartesian products of square of cycles and paths with complete bipartite graphs (Q326469) (← links)
- The equitable vertex arboricity of complete tripartite graphs (Q495689) (← links)
- 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 coloring of Kronecker products of complete multipartite graphs and complete graphs (Q741756) (← 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)
- Branch-and-cut for linear programs with overlapping SOS1 constraints (Q1646682) (← links)
- Flow shop scheduling problem with conflict graphs (Q1708533) (← links)
- Restricted assignment scheduling with resource constraints (Q1713408) (← 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)
- Path cover with minimum nontrivial paths and its application in two-machine flow-shop scheduling with a conflict graph (Q2125230) (← links)
- Approximation algorithms for two parallel dedicated machine scheduling with conflict constraints (Q2149860) (← links)
- Scheduling with complete multipartite incompatibility graph on parallel machines: complexity and algorithms (Q2152489) (← links)
- Scheduling identical jobs on uniform machines with a conflict graph (Q2273690) (← links)
- Inductive \(k\)-independent graphs and \(c\)-colorable subgraphs in scheduling: a review (Q2327955) (← links)
- Two-machine open shop problem with agreement graph (Q2333794) (← links)
- Clique partitioning with value-monotone submodular cost (Q2339847) (← links)
- Open shop scheduling problems with conflict graphs (Q2357137) (← links)
- New results in two identical machines scheduling with agreement graphs (Q2420580) (← links)
- Weighted and locally bounded list-colorings in split graphs, cographs, and partial \(k\)-trees (Q2420639) (← links)
- A competitive analysis for balanced transactional memory workloads (Q2429336) (← links)
- Bounded max-colorings of graphs (Q2447538) (← links)
- Mutual exclusion scheduling with interval graphs or related classes. II (Q2476265) (← links)
- Scheduling: agreement graph vs resource constraints (Q2629638) (← links)
- Complexity and approximation algorithms for two parallel dedicated machine scheduling with conflict constraints (Q2680859) (← links)
- On the equitable vertex arboricity of complete tripartite graphs (Q2788734) (← links)
- Asynchronous Coordination Under Preferences and Constraints (Q2835020) (← links)
- On partitioning interval graphs into proper interval subgraphs and related problems (Q3174235) (← links)
- Locally bounded<i>k</i>-colorings of trees (Q3621974) (← links)
- An approximation scheme for bin packing with conflicts (Q5054839) (← links)
- On the equitable vertex arboricity of graphs (Q5739585) (← links)
- Structural parameterizations of budgeted graph coloring (Q5918737) (← links)
- Structural parameterizations of budgeted graph coloring (Q5925707) (← links)
- Structural parameterizations for equitable coloring: complexity, FPT algorithms, and kernelization (Q6107887) (← links)
- Scheduling on uniform machines with a conflict graph: complexity and resolution (Q6187242) (← links)
