On the complexity of the maximum cut problem
Nordic Journal of Computing
The Complexity of Tree Multicolorings
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Counting H-Colorings of Partial k-Trees
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
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
Signal Processing - From signal processing theory to implementation
On algorithms for (P5,gem)-free graphs
Theoretical Computer Science - Graph colorings
Weighted coloring: further complexity and approximability results
Information Processing Letters
Hard coloring problems in low degree planar bipartite graphs
Discrete Applied Mathematics
Sufficient Condition and Algorithm for List Total Colorings of Series-Parallel Graphs
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Weighted Coloring: further complexity and approximability results
Information Processing Letters
List total colorings of series-parallel graphs
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
On the complexity of some colorful problems parameterized by treewidth
COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
Using local search to speed up filtering algorithms for some NP-hard constraints
CPAIOR'08 Proceedings of the 5th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
On the complexity of some colorful problems parameterized by treewidth
Information and Computation
Consensus models: Computational complexity aspects in modern approaches to the list coloring problem
Theoretical Computer Science
Weighted coloring: further complexity and approximability results
ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
List coloring in the absence of a linear forest
WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
On the parameterized complexity of coloring graphs in the absence of a linear forest
Journal of Discrete Algorithms
Algorithms for bandwidth consecutive multicolorings of graphs
FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management
Incremental list coloring of graphs, parameterized by conservation
Theoretical Computer Science
Data reduction for graph coloring problems
Information and Computation
List coloring in the absence of two subgraphs
Discrete Applied Mathematics
Coloring graphs without short cycles and long induced paths
Discrete Applied Mathematics
Hi-index | 0.05 |