Pages that link to "Item:Q5111748"
From MaRDI portal
The following pages link to Subexponential parameterized algorithms for graphs of polynomial growth (Q5111748):
Displaying 8 items.
- Subexponential parameterized algorithms (Q458457) (← links)
- On the existence of subexponential parameterized algorithms (Q1877709) (← links)
- Sublinear-time algorithms for approximating graph parameters (Q2075766) (← links)
- Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs (Q3452835) (← links)
- Parameterized Approximation Algorithms for Bidirected Steiner Network Problems (Q5009577) (← links)
- Surprising Applications of Treewidth Bounds for Planar Graphs (Q5042457) (← links)
- Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering (Q5885586) (← links)
- Algorithms and Turing kernels for detecting and counting small patterns in unit disk graphs (Q6655672) (← links)