Pages that link to "Item:Q2672940"
From MaRDI portal
The following pages link to On the parameterized complexity of grid contraction (Q2672940):
Displaying 4 items.
- On the parameterized complexity of maximum degree contraction problem (Q832521) (← links)
- An FPT algorithm for contraction to cactus (Q1790990) (← links)
- The hardness of the grid problemGi Under the Routine Resolution Method (Q3721813) (← links)
- Dimension Bound for Badly Approximable Grids (Q5206102) (← links)