Pages that link to "Item:Q1022343"
From MaRDI portal
The following pages link to On two techniques of combining branching and treewidth (Q1022343):
Displaying 4 items.
- Parameterized complexity of geometric covering problems having conflicts (Q5919304) (← links)
- Faster graph coloring in polynomial space (Q5925619) (← links)
- The Asymmetric Travelling Salesman Problem In Sparse Digraphs. (Q6089670) (← links)
- Maximum Weighted Independent Set: Effective Reductions and Fast Algorithms on Sparse Graphs (Q6492080) (← links)