Pages that link to "Item:Q4636635"
From MaRDI portal
The following pages link to Combining Treewidth and Backdoors for CSP. (Q4636635):
Displaying 13 items.
- Backdoors into heterogeneous classes of SAT and CSP (Q730498) (← links)
- Backdoor treewidth for SAT (Q1680239) (← links)
- Measuring what matters: a hybrid approach to dynamic programming with treewidth (Q2040028) (← links)
- Distance from triviality 2.0: hybrid parameterizations (Q2169932) (← links)
- FPT algorithms to compute the elimination distance to bipartite graphs and more (Q2672425) (← links)
- Solving projected model counting by utilizing treewidth and its limits (Q2680775) (← links)
- Backdoor Sets for CSP. (Q4993598) (← links)
- Utilizing Treewidth for Quantitative Reasoning on Epistemic Logic Programs (Q5019599) (← links)
- A Fixed-Parameter Tractable Algorithm for Elimination Distance to Bounded Degree Graphs (Q5071096) (← links)
- Measuring what Matters: A Hybrid Approach to Dynamic Programming with Treewidth. (Q5092404) (← links)
- On the Parameterized Complexity of Clique Elimination Distance (Q6068235) (← links)
- SAT backdoors: depth beats size (Q6152185) (← links)
- CSP beyond tractable constraint languages (Q6154179) (← links)