Pages that link to "Item:Q3455547"

The following pages link to Query evaluation via tree-decompositions (Q3455547):

Displaying 50 items.

• Structural tractability of counting of solutions to conjunctive queries (Q269342) (← links)
• Tractable counting of the answers to conjunctive queries (Q389242) (← links)
• The complexity of weighted counting for acyclic conjunctive queries (Q395018) (← links)
• Courcelle's theorem -- a game-theoretic approach (Q408375) (← links)
• Practical algorithms for MSO model-checking on tree-decomposable graphs (Q473216) (← links)
• List H-coloring a graph by removing few vertices (Q527415) (← links)
• Enumeration complexity of conjunctive queries with functional dependencies (Q778529) (← links)
• On the expressive power of monadic least fixed point logic (Q817849) (← links)
• Conjunctive query evaluation by search-tree revisited (Q870265) (← links)
• Weighted hypertree decompositions and optimal query plans (Q878759) (← links)
• Tree decomposition-based indexing for efficient shortest path and nearest neighbors query answering on graphs (Q891679) (← links)
• Conjunctive query containment over trees using schema information (Q1702301) (← links)
• Tree projections and constraint optimization problems: fixed-parameter tractability and parallel algorithms (Q1745716) (← links)
• Static analysis and query answering for incomplete data trees with constraints (Q1799308) (← links)
• Tree pattern query minimization (Q1811333) (← links)
• An existential locality theorem (Q1887659) (← links)
• Computing crossing numbers in quadratic time (Q1887712) (← links)
• Constraint satisfaction with succinctly specified relations (Q1959431) (← links)
• Compact representation for answer sets of \(n\)-ary regular queries (Q1959656) (← links)
• Some aspects of the database resilience (Q2119956) (← links)
• Bounded treewidth as a key to tractability of knowledge representation and reasoning (Q2269134) (← links)
• Evaluating Datalog via tree automata and cycluits (Q2322722) (← links)
• Answering conjunctive queries with inequalities (Q2402612) (← links)
• Bounded fixed-parameter tractability and \(\log^{2}n\) nondeterministic bits (Q2581756) (← links)
• Flexible Querying Using Criterion Trees: A Bipolar Approach (Q2940788) (← links)
• (Q3044419) (← links)
• Marshals, monotone marshals, and hypertree-width (Q3159383) (← links)
• Semantic Acyclicity on Graph Databases (Q3187172) (← links)
• Connecting Width and Structure in Knowledge Compilation (Extended Version) (Q3305349) (← links)
• Provenance Circuits for Trees and Treelike Instances (Q3449465) (← links)
• Obtaining a Planar Graph by Vertex Deletion (Q3508576) (← links)
• Interpreting Tree-to-Tree Queries (Q3591449) (← links)
• Compact Representation for Answer Sets of n-ary Regular Queries (Q3637346) (← links)
• Tree-Width for First Order Formulae (Q3644741) (← links)
• HyperConsistency Width for Constraint Satisfaction: Algorithms and Complexity Results (Q3655143) (← links)
• Recognizable languages of arrows and cospans (Q4585008) (← links)
• SOME MODEL THEORY OF GUARDED NEGATION (Q4647097) (← links)
• (Q5028434) (← links)
• (Q5028484) (← links)
• Computing Tree Decompositions (Q5042458) (← links)
• An Experimental Study of the Treewidth of Real-World Graph Data (Q5091123) (← links)
• A Practical Approach to Courcelle's Theorem (Q5170276) (← links)
• The Power of Local Consistency in Conjunctive Queries and Constraint Satisfaction Problems (Q5283239) (← links)
• On the complexity of existential positive queries (Q5410336) (← links)
• Uniform Constraint Satisfaction Problems and Database Theory (Q5504703) (← links)
• Decomposing Quantified Conjunctive (or Disjunctive) Formulas (Q5506695) (← links)
• First-Order Model-Checking in Random Graphs and Complex Networks (Q5874510) (← links)
• Guarded negation (Q5890544) (← links)
• (Q6068932) (← links)
• Parameterised counting in logspace (Q6093373) (← links)