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
Algorithm for the Cost Edge-Coloring of Trees
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
A 27/26-Approximation Algorithm for the Chromatic Sum Coloring of Bipartite Graphs
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
The complexity of chromatic strength and chromatic edge strength
Computational Complexity
Minimum sum multicoloring on the edges of trees
Theoretical Computer Science - Approximation and online algorithms
Complexity results for minimum sum edge coloring
Discrete Applied Mathematics
Minimum sum edge colorings of multicycles
Discrete Applied Mathematics
Minimum cost edge-colorings of trees can be reduced to matchings
FAW'10 Proceedings of the 4th international conference on Frontiers in algorithmics
Minimum sum set coloring of trees and line graphs of trees
Discrete Applied Mathematics
PPAM'05 Proceedings of the 6th international conference on Parallel Processing and Applied Mathematics
On sum edge-coloring of regular, bipartite and split graphs
Discrete Applied Mathematics
| Hi-index | 0.89 |