A sufficient condition for backtrack-bounded search
Journal of the ACM (JACM)
Tree clustering for constraint networks (research note)
Artificial Intelligence
Finding approximate separators and computing tree width quickly
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Efficient and constructive algorithms for the pathwidth and treewidth of graphs
Journal of Algorithms
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
SIAM Journal on Computing
A partial k-arboretum of graphs with bounded treewidth
Theoretical Computer Science
On the complexity of database queries
Journal of Computer and System Sciences
Conjunctive-query containment and constraint satisfaction
Journal of Computer and System Sciences - Special issue on the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on principles of database systems
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Which problems have strongly exponential complexity?
Journal of Computer and System Sciences
Fixed-parameter complexity in AI and nonmonotonic reasoning
Artificial Intelligence
Constraint solving via fractional edge covers
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Algorithms for acyclic database schemes
VLDB '81 Proceedings of the seventh international conference on Very Large Data Bases - Volume 7
A unified theory of structural tractability for constraint satisfaction and spread cut decomposition
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Algorithms for propositional model counting
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
Constraint satisfaction with bounded treewidth revisited
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Hypertree decompositions: structure, algorithms, and applications
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Parameterized Complexity
Algorithms for propositional model counting
Journal of Discrete Algorithms
On the power of structural decompositions of graph-based representations of constraint problems
Artificial Intelligence
Does treewidth help in modal satisfiability?
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
On the complexity of some colorful problems parameterized by treewidth
Information and Computation
Constraint satisfaction problems: convexity makes all different constraints tractable
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
RCC8 is polynomial on networks of bounded treewidth
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Constraint optimization problems and bounded tree-width revisited
CPAIOR'12 Proceedings of the 9th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Constraint satisfaction problems: Convexity makes AllDifferent constraints tractable
Theoretical Computer Science
Does Treewidth Help in Modal Satisfiability?
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.00 |
We consider the constraint satisfaction problem (CSP) parameterized by the treewidth of primal, dual, and incidence graphs, combined with several other basic parameters such as domain size and arity. We determine all combinations of the considered parameters that admit fixed-parameter tractability.