Pages that link to "Item:Q391650"
From MaRDI portal
The following pages link to Beyond bidimensionality: parameterized subexponential algorithms on directed graphs (Q391650):
Displayed 6 items.
- A \(2^{O(k)}n\) algorithm for \(k\)-cycle in minor-closed graph families (Q2006778) (← links)
- Linear kernels for outbranching problems in sparse digraphs (Q2408200) (← links)
- (Q4972036) (← links)
- Four Shorts Stories on Surprising Algorithmic Uses of Treewidth (Q5042454) (← links)
- Adapting the Directed Grid Theorem into an FPT Algorithm (Q5099098) (← links)
- Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering (Q5885586) (← links)