Towards a dichotomy theorem for the counting constraint satisfaction problem
Information and Computation
Graphs, polymorphisms and the complexity of homomorphism problems
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Communication: On the restricted homomorphism problem
Discrete Applied Mathematics
Survey: Colouring, constraint satisfaction, and complexity
Computer Science Review
Graph partitions with prescribed patterns
European Journal of Combinatorics
Hi-index | 0.00 |