Parameterized complexity of constraint satisfaction problems

Computational Complexity

Volumn 14, Issue 2, 2005, Pages 153-183

  Marx, Dániel ^a  

^a BUDAPEST UNIVERSITY OF TECHNOLOGY AND ECONOMICS   (Hungary)

Author keywords

Costraint satisfaction; Parameterized complexity; Weak Separability; Weighted satisfiability

Indexed keywords

EID: 21244494337     PISSN: 10163328     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00037-005-0195-9     Document Type: Conference Paper

References (16)

1. J. ALBER, H. FERNAU & R. NIEDERMEIER (2004). Parameterized complexity: exponential speed-up for planar graph problems. J. Algorithms 52, 26-56.
2. N. ALON, R. YUSTER & U. ZWICK (1997). Finding and counting given length cycles. Algorithmica 17, 209-223.
3. B. S. BAKER (1994). Approximation algorithms for NP-complete problems on planar graphs. J. ACM 41, 153-180.
4. H. L. BODLAENDER (1996). A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput. 25, 1305-1317.
5. H. L. BODLAENDER (1998). A partial k-arboretum of graphs with bounded treewidth. Theoret. Comput. Sci. 209, 1-45.
6. A. A. BULATOV (2002). A dichotomy theorem for constraints on a three-element set. In Proc. 43th Symp. Foundations of Computer Science, IEEE, 649-658.
7. N. CREIGNOU (1995). A dichotomy theorem for maximum generalized satisfiability problems. J. Comput. System Sci. 51, 511-522.
8. R. G. DOWNEY & M. R. FELLOWS (1999). Parameterized Complexity. Monogr. Comput. Sci., Springer, New York.
9. P. ERDOS & R. RADO (1960). Intersection theorems for systems of sets. J. London Math. Soc. 35, 85-90.
10. T. FEDER & M. Y. VARDI (1999). The computational structure of monotone monadic SNP and constraint satisfaction: a study through Datalog and group theory. SIAM J. Comput. 28, 57-104.
11. J. HOPCROFT & R. TARJAN (1974). Efficient planarity testing. J. ACM 21, 549-568.
12. S. KHANNA & R. MOTWANI (1996). Towards a syntactic characterization of PTAS. In Proc. 28th Annual ACM Symposium on the Theory of Computing (Philadelphia, PA, 1996), ACM, New York, 329-337.
13. S. KHANNA, M. SUDAN, L. TREVISAN & D. P. WILLIAMSON (2001). The approximability of constraint satisfaction problems. SIAM J. Comput. 30, 1863-1920.
14. T. KLOKS (1994). Treewidth. Lecture Notes in Comput. Sci. 842, Springer, Berlin.
15. D. LICHTENSTEIN (1982). Planar formulae and their uses. SIAM J. Comput. 11, 329-343.
16. T. J. SCHAEFER (1978). The complexity of satisfiability problems. In Conference Record of the 10th Annual ACM Symposium on Theory of Computing (San Diego, Calif., 1978), ACM, New York, 216-226.