Pages that link to "Item:Q2005578"
From MaRDI portal
The following pages link to Practical access to dynamic programming on tree decompositions (Q2005578):
Displaying 13 items.
- Dynamic programming and planarity: improved tree-decomposition based algorithms (Q972340) (← links)
- Positive-instance driven dynamic programming for treewidth (Q2424727) (← links)
- Treewidth-aware reductions of normal \textsc{ASP} to \textsc{SAT} - is normal \textsc{ASP} Harder than \textsc{SAT} after all? (Q2667835) (← links)
- Solving projected model counting by utilizing treewidth and its limits (Q2680775) (← links)
- The Fine Details of Fast Dynamic Programming over Tree Decompositions (Q2867071) (← links)
- Implementing Courcelle's Theorem in a declarative framework for dynamic programming (Q3133156) (← links)
- (Q3386630) (← links)
- (Q4784837) (← links)
- (Q5009490) (← links)
- Practical Access to Dynamic Programming on Tree Decompositions (Q5009563) (← links)
- DynASP2.5: Dynamic Programming on Tree Decompositions in Action (Q5111876) (← links)
- Nonserial Dynamic Programming and Tree Decomposition in Discrete Optimization (Q5391754) (← links)
- Exploiting Database Management Systems and Treewidth for Counting (Q6063876) (← links)
