Pages that link to "Item:Q5363089"
From MaRDI portal
The following pages link to Solving <i>d-</i>SAT via Backdoors to Small Treewidth (Q5363089):
Displaying 11 items.
- Backdoors into heterogeneous classes of SAT and CSP (Q730498) (← links)
- Backdoor treewidth for SAT (Q1680239) (← links)
- Generalized Pseudoforest Deletion: Algorithms and Uniform Kernel (Q2946421) (← links)
- Decomposing SAT Instances with Pseudo Backbones (Q3304190) (← links)
- Bidimensionality and Kernels (Q3387764) (← links)
- Generalized Pseudoforest Deletion: Algorithms and Uniform Kernel (Q4637327) (← links)
- Backdoor Sets for CSP. (Q4993598) (← links)
- A Retrospective on (Meta) Kernelization (Q5042460) (← links)
- A Linear-Time Parameterized Algorithm for Node Unique Label Cover (Q5111746) (← links)
- On the Parameterized Complexity of Clique Elimination Distance (Q6068235) (← links)
- (Q6168493) (← links)