Weighted Node Coloring: When Stable Sets Are Expensive
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Parameterized complexity of vertex colouring
Discrete Applied Mathematics
Scheduling with conflicts on bipartite and interval graphs
Journal of Scheduling - Special issue: On-line scheduling
A hypocoloring model for batch scheduling
Discrete Applied Mathematics
The complexity of chromatic strength and chromatic edge strength
Computational Complexity
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
On the probabilistic minimum coloring and minimum k-coloring
Discrete Applied Mathematics
Hard coloring problems in low degree planar bipartite graphs
Discrete Applied Mathematics
Probabilistic analysis for scheduling with conflicts
Theoretical Computer Science
Weighted coloring on planar, bipartite and split graphs: Complexity and approximation
Discrete Applied Mathematics
Scheduling with conflicts: online and offline algorithms
Journal of Scheduling
A hypocoloring model for batch scheduling
Discrete Applied Mathematics
On the probabilistic minimum coloring and minimum k-coloring
Discrete Applied Mathematics
Data reduction for graph coloring problems
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
Weighted coloring on planar, bipartite and split graphs: complexity and improved approximation
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
The hypocoloring problem: complexity and approximability results when the chromatic number is small
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Approximating the multi-level bottleneck assignment problem
WALCOM'12 Proceedings of the 6th international conference on Algorithms and computation
The maximum saving partition problem
Operations Research Letters
Incremental list coloring of graphs, parameterized by conservation
Theoretical Computer Science
Data reduction for graph coloring problems
Information and Computation
| Hi-index | 0.05 |