Weighted coloring: further complexity and approximability results
Information Processing Letters
Minimum cost and list homomorphisms to semicomplete digraphs
Discrete Applied Mathematics
Batch Coloring Flat Graphs and Thin
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
Weighted coloring on planar, bipartite and split graphs: Complexity and approximation
Discrete Applied Mathematics
Max-Coloring Paths: Tight Bounds and Extensions
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Communication: Minimum cost and list homomorphisms to semicomplete digraphs
Discrete Applied Mathematics
Weighted Coloring: further complexity and approximability results
Information Processing Letters
WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms
Max-coloring and online coloring with bandwidths on interval graphs
ACM Transactions on Algorithms (TALG)
Clique clustering yields a PTAS for max-coloring interval graphs
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Weighted coloring: further complexity and approximability results
ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
Approximation algorithms for the max-coloring problem
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Weighted coloring on planar, bipartite and split graphs: complexity and improved approximation
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Max-coloring paths: tight bounds and extensions
Journal of Combinatorial Optimization
Optimising multi-rate link scheduling for wireless mesh networks
Computer Communications
On the Grundy number of graphs with few P4's
Discrete Applied Mathematics
Theoretical Computer Science
| Hi-index | 0.89 |