Random cubic graphs are not homomorphic to the cycle of size 7
Journal of Combinatorial Theory Series B
A combinatorial constraint satisfaction problem dichotomy classification conjecture
European Journal of Combinatorics
Survey: Colouring, constraint satisfaction, and complexity
Computer Science Review
Combinatorial proof that subprojective constraint satisfaction problems are NP-complete
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Constraints, MMSNP and expander relational structures
Combinatorica
| Hi-index | 0.05 |