The following pages link to (Q5111890):
Displaying 18 items.
- Practical access to dynamic programming on tree decompositions (Q2005578) (← links)
- Proof complexity of symbolic QBF reasoning (Q2118330) (← links)
- An analysis of the parameterized complexity of periodic timetabling (Q2142676) (← links)
- Finding optimal triangulations parameterized by edge clique cover (Q2161006) (← links)
- The tree-width of C (Q2174562) (← 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)
- Computing partial hypergraphs of bounded width (Q2686128) (← links)
- (Q5009490) (← links)
- Practical Access to Dynamic Programming on Tree Decompositions (Q5009563) (← links)
- (Q5009587) (← links)
- (Q5091271) (← links)
- DynASP2.5: Dynamic Programming on Tree Decompositions in Action (Q5111876) (← links)
- (Q5140722) (← links)
- Exploiting Database Management Systems and Treewidth for Counting (Q6063876) (← links)
- Parameterized algorithms and data reduction for the short secluded <i>s</i>‐<i>t</i>‐path problem (Q6068532) (← links)
- (Q6089669) (← links)
- The PACE 2020 Parameterized Algorithms and Computational Experiments Challenge: Treedepth. (Q6089686) (← links)
