Monotone monadic SNP and constraint satisfaction
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Homomorphisms to powers of digraphs
Discrete Mathematics - Algebraic and topological methods in graph theory
Testing subgraphs in directed graphs
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Testing subgraphs in directed graphs
Journal of Computer and System Sciences - Special issue: STOC 2003
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: Minimum cost homomorphisms to semicomplete multipartite digraphs
Discrete Applied Mathematics
Note: The Ck-extended graft construction
Discrete Applied Mathematics
Survey: Colouring, constraint satisfaction, and complexity
Computer Science Review
Weak near-unanimity functions and digraph homomorphism problems
Theoretical Computer Science
Graph partitions with prescribed patterns
European Journal of Combinatorics
Hi-index | 0.05 |