Parameterized complexity of constraint satisfaction problems

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn 19, Issue , 2004, Pages 139-149

  Marx, Dániel ^a  

^a BUDAPEST UNIVERSITY OF TECHNOLOGY AND ECONOMICS   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOOLEAN ALGEBRA; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; POLYNOMIALS; SET THEORY; THEOREM PROVING; TREES (MATHEMATICS);

BOOLEAN CONSTRAINT; FIXED-PARAMETER TRACTABLE (FPT); OUTPLANAR GRAPHS;

CONSTRAINT THEORY;

EID: 4944244976     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. J. Alber, H. Fernau, and R. Niedermeier. Parameterized complexity: Exponential speed-up for planar graph problems. In ICALP 2001, volume 2076 of Lecture. Notes in Comput. Sci, pages 261-272. Springer, Berlin, 2001.
2. N. Alon, R. Yuster, and U. Zwick. Finding and counting given length cycles. Algorithmic, 17(3):209-223, 1997.
3. B. S. Baker. Approximation algorithms for NP-complete problems on planar graphs. J. Assoc. Comput. Mach., 41(1):153-180, 1994.
4. H. L. Bodlaender. A partial k-arboretum of graphs with bounded treewidth. Theoret. Comput. Sci., 209(1-2):1-45, 1998.
5. A. A. Bulatov. A dichotomy theorem for constraints on a three-element set. In Proc. 43th Symp. Foundations of Computer Science, pages 649-658. IEEE, November 2002.
6. N. Creignou. A dichotomy theorem for maximum generalized satisfiability problems. J. Comput. System Sci., 51(3):511-522, 1995, 24th Annual ACM Symposium on the Theory of Computing (Victoria, BC, 1992).
7. R. G. Downey and M. R. Fellows. Parameterized complexity. Monographs in Computer Science. Springer-Verlag, New York, 1999.
8. P. Erdos and R. Rado. Intersection theorems for systems of sets. J. London Math. Soc., 35:85-90, 1960.
9. T. Feder and M. Y. Vardi. The computational structure of monotone monadic SNP and constraint satisfaction: a study through Datalog and group theory. SIAM J. Comput., 28(1):57-104, 1999.
10. J. Hopcroft and R. Tarjan. Efficient planarity testing. J. Assoc. Comput. Mach., 21:549-568, 1974.
11. S. Khanna, M. Sudan, L. Trevisan, and D. P. Williamson. The approximability of constraint satisfaction problems. SIAM J. Comput., 30(6):1863-1920, 2001.
12. T. Kloks. Treewidth, volume 842 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1994. Computations and approximations.
13. D. Lichtenstein. Planar formulae and their uses. SIAM J. Comput., 11(2):329-343, 1982.
14. T. J. Schaefer. The complexity of satisfiability problems. In Proceedings of the tenth annual ACM symposium on Theory of computing, pages 216-226. 1978.