Can you beat treewidth?
暂无分享,去创建一个
[1] Georg Gottlob,et al. Hypertree Decompositions: Structure, Algorithms, and Applications , 2005, WG.
[2] Marc Gyssens,et al. Closure properties of constraints , 1997, JACM.
[3] Ge Xia,et al. Linear FPT reductions and computational lower bounds , 2004, STOC '04.
[4] Thomas Schwentick,et al. When is the evaluation of conjunctive queries tractable? , 2001, STOC '01.
[5] Andrei A. Bulatov,et al. A dichotomy theorem for constraints on a three-element set , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..
[6] Dániel Marx,et al. Closest Substring Problems with Small Distances , 2008, SIAM J. Comput..
[7] Martin Grohe. The Structure of Tractable Constraint Satisfaction Problems , 2006, MFCS.
[8] James R. Lee,et al. Improved approximation algorithms for minimum-weight vertex separators , 2005, STOC '05.
[9] Martin Grohe,et al. The complexity of homomorphism and constraint satisfaction problems seen from the other side , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..
[10] Andrei A. Bulatov,et al. Tractable conservative constraint satisfaction problems , 2003, 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings..
[11] Russell Impagliazzo,et al. Which problems have strongly exponential complexity? , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).
[12] Phokion G. Kolaitis,et al. Constraint Satisfaction, Bounded Treewidth, and Finite-Variable Logics , 2002, CP.
[13] A BulatovAndrei. A dichotomy theorem for constraint satisfaction problems on a 3-element set , 2006 .
[14] B. Mohar,et al. Graph Minors , 2009 .
[15] Georg Gottlob,et al. Fixed-Parameter Algorithms For Artificial Intelligence, Constraint Satisfaction and Database Problems , 2007, Comput. J..
[16] Dániel Marx,et al. On tree width, bramble size, and expansion , 2009, J. Comb. Theory, Ser. B.
[17] Martin Grohe. The complexity of homomorphism and constraint satisfaction problems seen from the other side , 2007, JACM.
[18] Zvi Galil,et al. Explicit Constructions of Linear-Sized Superconcentrators , 1981, J. Comput. Syst. Sci..
[19] Ge Xia,et al. Tight lower bounds for certain parameterized NP-hard problems , 2004, Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004..
[20] Tomás Feder,et al. The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory , 1999, SIAM J. Comput..
[21] Michael R. Fellows,et al. On the parameterized complexity of multiple-interval graph problems , 2009, Theor. Comput. Sci..
[22] Paul D. Seymour,et al. Graph Minors. II. Algorithmic Aspects of Tree-Width , 1986, J. Algorithms.
[23] Dániel Marx. Tractable Structures for Constraint Satisfaction with Truth Tables , 2009, Theory of Computing Systems.
[24] Dániel Marx,et al. Constraint solving via fractional edge covers , 2006, SODA '06.
[25] Georg Gottlob,et al. Uniform Constraint Satisfaction Problems and Database Theory , 2008, Complexity of Constraints.
[26] Jörg Flum,et al. Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series) , 2006 .
[27] Paul D. Seymour,et al. Graph minors. V. Excluding a planar graph , 1986, J. Comb. Theory B.
[28] Iyad A. Kanj,et al. Tight lower bounds for certain parameterized NP-hard problems , 2004, Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004..
[29] Frank Thomson Leighton,et al. Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms , 1999, JACM.
[30] Hans L. Bodlaender,et al. A Partial k-Arboretum of Graphs with Bounded Treewidth , 1998, Theor. Comput. Sci..
[31] Peter Jeavons,et al. The complexity of maximal constraint languages , 2001, STOC '01.
[32] Thomas J. Schaefer,et al. The complexity of satisfiability problems , 1978, STOC.
[33] Michael R. Fellows,et al. Cutting Up is Hard to Do: the Parameterized Complexity of k-Cut and Related Problems , 2003, CATS.
[34] Mam Riess Jones. Color Coding , 1962, Human factors.
[35] Martin Grohe,et al. Parameterized Complexity and Subexponential Time , 2004 .
[36] Jörg Flum,et al. Parameterized Complexity Theory , 2006, Texts in Theoretical Computer Science. An EATCS Series.
[37] Michael R. Fellows,et al. Parameterized Complexity , 1998 .
[38] Eugene C. Freuder. Complexity of K-Tree Structured Constraint Satisfaction Problems , 1990, AAAI.