The following pages link to Backdoors to planning (Q2321271):
Displaying 8 items.
- Backdoors for linear temporal logic (Q1725638) (← links)
- On structural parameterizations of the bounded-degree vertex deletion problem (Q2223699) (← links)
- A multiparametric view on answer set programming (Q2317973) (← links)
- Cost-optimal Planning, Delete Relaxation, Approximability, and Heuristics (Q5145837) (← links)
- Computational Short Cuts in Infinite Domain Constraint Satisfaction (Q5870497) (← links)
- Parameterised complexity of model checking and satisfiability in propositional dependence logic (Q5918486) (← links)
- An algorithmic framework for locally constrained homomorphisms (Q6499010) (← links)
- Backdoor DNFs (Q6564620) (← links)
