The complexity of counting graph homomorphisms (extended abstract)
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
The complexity of choosing an H-colouring (nearly) uniformly at random
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Counting H-colorings of partial k-trees
Theoretical Computer Science
Universal H-colorable graphs without a given configuration
Discrete Mathematics
(H, C, K)-Coloring: Fast, Easy, and Hard Cases
MFCS '01 Proceedings of the 26th 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
Dichotomy for bounded degree H-colouring
Discrete Applied Mathematics
Extension problems with degree bounds
Discrete Applied Mathematics
Complexity of conservative constraint satisfaction problems
ACM Transactions on Computational Logic (TOCL)
Bounded-degree forbidden patterns problems are constraint satisfaction problems
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
Survey: Colouring, constraint satisfaction, and complexity
Computer Science Review
Finding small separators in linear time via treewidth reduction
ACM Transactions on Algorithms (TALG)
Graph partitions with prescribed patterns
European Journal of Combinatorics
Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree
FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory
| Hi-index | 0.05 |