Discrete Applied Mathematics
Minimum sum multicoloring on the edges of trees
Theoretical Computer Science - Approximation and online algorithms
A dichotomy for minimum cost graph homomorphisms
European Journal of Combinatorics
Minimum Cost Homomorphism Dichotomy for Oriented Cycles
AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
Discrete Applied Mathematics
"Rent-or-buy" scheduling and cost coloring problems
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
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
An effective heuristic algorithm for sum coloring of graphs
Computers and Operations Research
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
The maximum saving partition problem
Operations Research Letters
Approximation of minimum cost homomorphisms
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
On the approximation of minimum cost homomorphism to bipartite graphs
Discrete Applied Mathematics
On sum edge-coloring of regular, bipartite and split graphs
Discrete Applied Mathematics
Hi-index | 0.00 |