Pages that link to "Item:Q3113754"
From MaRDI portal
The following pages link to Beyond bidimensionality: parameterized subexponential algorithms on directed graphs (Q3113754):
Displaying 8 items.
- Parameterized algorithms for non-separating trees and branchings in digraphs (Q334949) (← links)
- Beyond bidimensionality: parameterized subexponential algorithms on directed graphs (Q391650) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- Faster parameterized algorithms for minor containment (Q650942) (← links)
- Faster approximation schemes and parameterized algorithms on (odd-)\(H\)-minor-free graphs (Q764332) (← links)
- What’s Next? Future Directions in Parameterized Complexity (Q2908548) (← links)
- Subexponential parameterized algorithms for graphs of polynomial growth (Q5111748) (← links)
- (Q5743379) (← links)