Author:
Feder Tomás,Hell Pavol,Schell David G.,Stacho Juraj
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference23 articles.
1. A.A. Bulatov, Complexity of conservative constraint satisfaction problems, ACM Transactions on Computational Logic (2011) (in press).
2. The complexity of the list partition problem for graphs;Cameron;SIAM Journal on Discrete Mathematics,2007
3. M. Cygan, M. Pilipczuk, M. Pilipczuk, J.O. Wojtaszczyk, The stubborn problem is stubborn no more (a polynomial algorithm for 3-compatible colouring and the stubborn list partition problem), in: Proceedings of the Twenty Second Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, 2011, pp. 1666–1674.
4. Finding skew partitions efficiently;de Figueiredo;Journal of Algorithms,2000
5. Full constraint satisfaction problems;Feder;SIAM Journal on Computing,2006
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献