1. Some complexity bounds for subtype inequalities;Benke;Theoret. Comput. Sci.,1999
2. V. Dalmau, J. Pearson, Set functions and width 1 problems, in: Proceedings of the 5th International Conference on Constraint Programming, CP’99, Lecture Notes in Computer Science, vol. 1713, Springer, Berlin, 1999, pp. 159–173.
3. A structure theory for ordered sets;Duffus;Discrete Math.,1981
4. The computational structure of monotone monadic SNP and constraint satisfaction: a study through datalog and group theory;Feder;SIAM J. Comput.,1998
5. On the complexity of H-coloring;Hell;J. Combin. Theory, Ser. B,1990