Author:
Bodirsky Manuel,Dalmau Víctor
Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference45 articles.
1. The complexity of G-free colourability;Achlioptas;Discrete Math.,1997
2. A. Atserias, On digraph coloring problems and treewidth duality, in: Proceedings of LICS, 2005, pp. 106–115.
3. A. Atserias, A. Bulatov, V. Dalmau, P.G. Kolaitis, M.Y. Vardi, Consistency, treewidth, and number of first-order variables, in preparation.
4. L. Barto, M. Kozik, Constraint satisfaction problems of bounded width, in: Proceedings of FOCS, 2009, pp. 595–603.
5. Cores of countably categorical structures;Bodirsky;Log. Methods Comput. Sci.,2007
Cited by
25 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献