The Complexity of Tree Multicolorings
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Algorithm for the Cost Edge-Coloring of Trees
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Minimizing Average Completion of Dedicated Tasks and Interval Graphs
APPROX '01/RANDOM '01 Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation Techniques in Computer Science: Approximation, Randomization and Combinatorial Optimization
Information and Computation
Minimum sum multicoloring on the edges of trees
Theoretical Computer Science - Approximation and online algorithms
Hard coloring problems in low degree planar bipartite graphs
Discrete Applied Mathematics
Complexity results for minimum sum edge coloring
Discrete Applied Mathematics
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Consensus models: Computational complexity aspects in modern approaches to the list coloring problem
Theoretical Computer Science
Improved bounds for sum multicoloring and scheduling dependent jobs with minsum criteria
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
Constraint satisfaction problems: convexity makes all different constraints tractable
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Constraint satisfaction problems: Convexity makes AllDifferent constraints tractable
Theoretical Computer Science
On sum edge-coloring of regular, bipartite and split graphs
Discrete Applied Mathematics
Hi-index | 0.00 |