Pages that link to "Item:Q5111869"
From MaRDI portal
The following pages link to How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs (Q5111869):
Displaying 4 items.
- Optimal data reduction for graph coloring using low-degree polynomials (Q2272594) (← links)
- Hitting minors on bounded treewidth graphs. III. Lower bounds (Q2301360) (← links)
- Polynomial kernels for vertex cover parameterized by small degree modulators (Q2322700) (← links)
- Grid recognition: classical and parameterized computational perspectives (Q6156159) (← links)
