Pages that link to "Item:Q949776"
From MaRDI portal
The following pages link to Linearity of grid minors in treewidth with applications through bidimensionality (Q949776):
Displaying 12 items.
- Searching for a Visible, Lazy Fugitive (Q5302068) (← links)
- Large-treewidth graph decompositions and applications (Q5495799) (← links)
- (Q5743379) (← links)
- (Q5743499) (← links)
- Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering (Q5885586) (← links)
- Optimality program in segment and string graphs (Q5920196) (← links)
- Parameterized algorithms and data reduction for the short secluded <i>s</i>‐<i>t</i>‐path problem (Q6068532) (← links)
- Computing connected-\(k\)-subgraph cover with connectivity requirement (Q6111948) (← links)
- Graphs of linear growth have bounded treewidth (Q6115513) (← links)
- FPT approximation and subexponential algorithms for covering few or many edges (Q6195348) (← links)
- A more accurate view of the flat wall theorem (Q6606321) (← links)
- Approximation algorithm and FPT algorithm for connected-\(k\)-subgraph cover on minor-free graphs (Q6620013) (← links)