Pages that link to "Item:Q2908548"
From MaRDI portal
The following pages link to What’s Next? Future Directions in Parameterized Complexity (Q2908548):
Displayed 10 items.
- Edge bipartization faster than \(2^k\) (Q666655) (← links)
- Parameterized resiliency problems (Q2330129) (← links)
- A tight lower bound for vertex planarization on graphs of bounded treewidth (Q2403808) (← links)
- Tight bounds for parameterized complexity of cluster editing with a small number of clusters (Q2453563) (← links)
- The Birth and Early Years of Parameterized Complexity (Q2908529) (← links)
- A Basic Parameterized Complexity Primer (Q2908536) (← links)
- Known Algorithms for Edge Clique Cover are Probably Optimal (Q3464061) (← links)
- (Q5009480) (← links)
- (Q5009484) (← links)
- Improved Lower Bounds for Graph Embedding Problems (Q5283358) (← links)