Algorithm for the Cost Edge-Coloring of Trees
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Discrete Applied Mathematics
A dichotomy for minimum cost graph homomorphisms
European Journal of Combinatorics
Discrete Applied Mathematics
Bounded tree-width and CSP-related problems
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Minimum cost homomorphisms to reflexive digraphs
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Minimum cost homomorphisms to oriented cycles with some loops
CATS '09 Proceedings of the Fifteenth Australasian Symposium on Computing: The Australasian Theory - Volume 94
Consensus models: Computational complexity aspects in modern approaches to the list coloring problem
Theoretical Computer Science
An effective heuristic algorithm for sum coloring of graphs
Computers and Operations Research
A New Ant Colony Optimization Algorithm for the Lower Bound of Sum Coloring Problem
Journal of Mathematical Modelling and Algorithms
Constraint optimization problems and bounded tree-width revisited
CPAIOR'12 Proceedings of the 9th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Approximation of minimum cost homomorphisms
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
| Hi-index | 0.00 |