Pages that link to "Item:Q476436"
From MaRDI portal
The following pages link to The kernelization complexity of connected domination in graphs with (no) small cycles (Q476436):
Displayed 5 items.
- Improved kernel results for some FPT problems based on simple observations (Q507431) (← links)
- Smaller Kernels for Several FPT Problems Based on Simple Observations (Q3452562) (← links)
- Perfect domination and small cycles (Q5367522) (← links)
- On the lossy kernelization for connected treedepth deletion set (Q6043184) (← links)
- Further Exploiting <i>c</i>-Closure for FPT Algorithms and Kernels for Domination Problems (Q6071818) (← links)