Uniquely colorable mixed hypergraphs
Discrete Mathematics
ASIAN '02 Proceedings of the7th Asian Computing Science Conference on Advances in Computing Science: Internet Computing and Modeling, Grid Computing, Peer-to-Peer Computing, and Cluster
A Grötzsch-Type Theorem for List Colourings with Impropriety One
Combinatorics, Probability and Computing
List Improper Colourings of Planar Graphs
Combinatorics, Probability and Computing
Weighted coloring: further complexity and approximability results
Information Processing Letters
Hard coloring problems in low degree planar bipartite graphs
Discrete Applied Mathematics
Extension problems with degree bounds
Discrete Applied Mathematics
Weighted Coloring: further complexity and approximability results
Information Processing Letters
Scheduling research grant proposal evaluation meetings and the range colouring problem
PATAT'06 Proceedings of the 6th international conference on Practice and theory of automated timetabling VI
Incremental routing and scheduling in wireless grids
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
3-Choosability of Triangle-Free Planar Graphs with Constraints on 4-Cycles
SIAM Journal on Discrete Mathematics
Complexity of conservative constraint satisfaction problems
ACM Transactions on Computational Logic (TOCL)
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
3-choosability of planar graphs with (≤4)-cycles far apart
Journal of Combinatorial Theory Series B
List coloring in the absence of two subgraphs
Discrete Applied Mathematics
Hi-index | 0.05 |