The Optimal Cost Chromatic Partition problem for trees and interval graphs

This publication has 20 references indexed in Scilit:

• Algorithms for preemptive scheduling of different classes of processors to do jobs with fixed times
  European Journal of Operational Research, 1993
• Approximation Algorithms for Fixed Job Schedule Problems
  Operations Research, 1992
• Fixed Job Scheduling with Two Types of Processors
  Operations Research, 1992
• On the computational complexity of (maximum) class scheduling
  European Journal of Operational Research, 1991
• The Fixed Job Schedule Problem with Working-Time Constraints
  Operations Research, 1989
• Geometric Algorithms and Combinatorial Optimization
  Published by Springer Nature ,1988
• The Fixed Job Schedule Problem with Spread-Time Constraints
  Operations Research, 1987
• Scheduling jobs with fixed start and end times
  Discrete Applied Mathematics, 1987
• The Complexity of Coloring Circular Arcs and Chords
  SIAM Journal on Algebraic Discrete Methods, 1980
• On certain polytopes associated with graphs
  Journal of Combinatorial Theory, Series B, 1975