Homomorphisms to powers of digraphs
Discrete Mathematics - Algebraic and topological methods in graph theory
Constraint Satisfaction, Bounded Treewidth, and Finite-Variable Logics
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Connected and Loosely Connected List Homomorphisms
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Dichotomies for classes of homomorphism problems involving unary functions
Theoretical Computer Science
Conjunctive queries over trees
Journal of the ACM (JACM)
Processing queries on tree-structured data efficiently
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Minimum cost and list homomorphisms to semicomplete digraphs
Discrete Applied Mathematics
Digraph matrix partitions and trigraph homomorphisms
Discrete Applied Mathematics
On digraph coloring problems and treewidth duality
European Journal of Combinatorics
A dichotomy for minimum cost graph homomorphisms
European Journal of Combinatorics
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
Communication: Minimum cost and list homomorphisms to semicomplete digraphs
Discrete Applied Mathematics
Efficient enumeration for conjunctive queries over x-underbar structures
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
Note: The Ck-extended graft construction
Discrete Applied Mathematics
The dichotomy of list homomorphisms for digraphs
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Interval graphs, adjusted interval digraphs, and reflexive list homomorphisms
Discrete Applied Mathematics
Proceedings of the 15th International Conference on Database Theory
Survey: Colouring, constraint satisfaction, and complexity
Computer Science Review
An efficient algorithm for a class of constraint satisfaction problems
Operations Research Letters
Weak near-unanimity functions and digraph homomorphism problems
Theoretical Computer Science
ACM Transactions on Database Systems (TODS) - Invited papers issue
| Hi-index | 0.05 |