Pages that link to "Item:Q4598164"
From MaRDI portal
The following pages link to Double-Exponential and Triple-Exponential Bounds for Choosability Problems Parameterized by Treewidth (Q4598164):
Displaying 5 items.
- On some FPT problems without polynomial Turing compressions (Q2072079) (← links)
- Treewidth-aware reductions of normal \textsc{ASP} to \textsc{SAT} - is normal \textsc{ASP} Harder than \textsc{SAT} after all? (Q2667835) (← links)
- (Q5002765) (← links)
- (Q5111886) (← links)
- Finer Tight Bounds for Coloring on Clique-Width (Q5130905) (← links)
