The complexity of scheduling independent two-processor tasks on dedicated processors

Dedicated Scheduling of Biprocessor Tasks to Minimize Mean Flow Time

PPAM '01 Proceedings of the th International Conference on Parallel Processing and Applied Mathematics-Revised Papers

On the Approximability of Multiprocessor Task Scheduling Problems

ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation

An approximation result for the interval coloring problem on claw-free chordal graphs

Discrete Applied Mathematics - Sixth Twente Workshop on Graphs and Combinatorial Optimization

Complexity and approximation results for scheduling multiprocessor tasks on a ring

Discrete Applied Mathematics - International symposium on combinatorial optimisation

On the Complexity of Adjacent Resource Scheduling

Journal of Scheduling

Consecutive edge-coloring of the generalized θ-graph

Discrete Applied Mathematics

A graph coloring approach to scheduling of multiprocessor tasks on dedicated machines with availability constraints

Discrete Applied Mathematics

Chromatic scheduling of 1- and 2-processor UET tasks on dedicated machines with availability constraints

PPAM'05 Proceedings of the 6th international conference on Parallel Processing and Applied Mathematics

Consecutive edge-colorings of generalized θ-graphs

CGGA'10 Proceedings of the 9th international conference on Computational Geometry, Graphs and Applications