The following pages link to (Q4875172):
Displaying 19 items.
- The equitable vertex arboricity of complete tripartite graphs (Q495689) (← links)
- A branch-and-cut algorithm for the equitable coloring problem using a formulation by representatives (Q496694) (← 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 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)
- Transactional contention management as a Non-clairvoyant scheduling problem (Q848634) (← links)
- Models and complexity of multibin packing problems (Q864931) (← links)
- Probabilistic analysis for scheduling with conflicts (Q924143) (← links)
- On chromatic sums and distributed resource allocation (Q1383159) (← links)
- The mutual exclusion scheduling problem for permutation and comparability graphs. (Q1401918) (← links)
- \((N, p)\)-equitable \(b\)-coloring of graphs (Q1682874) (← links)
- Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts (Q1761944) (← links)
- Window-based greedy contention management for transactional memory: theory and practice (Q1938368) (← links)
- An approximation scheme for bin packing with conflicts (Q5054839) (← links)
- Structural parameterizations for equitable coloring: complexity, FPT algorithms, and kernelization (Q6107887) (← links)
