Pages that link to "Item:Q5302055"
From MaRDI portal
The following pages link to Parameterized Complexity for Domination Problems on Degenerate Graphs (Q5302055):
Displayed 8 items.
- The kernelization complexity of connected domination in graphs with (no) small cycles (Q476436) (← links)
- Improved kernel results for some FPT problems based on simple observations (Q507431) (← links)
- Implicit branching and parameterized partial cover problems (Q657922) (← links)
- Kernelization hardness of connectivity problems in \(d\)-degenerate graphs (Q713308) (← links)
- The parameterized complexity of editing graphs for bounded degeneracy (Q986553) (← links)
- Linear kernels for \(k\)-tuple and liar's domination in bounded genus graphs (Q2403794) (← links)
- Kernelization Hardness of Connectivity Problems in d-Degenerate Graphs (Q3057621) (← links)
- Smaller Kernels for Several FPT Problems Based on Simple Observations (Q3452562) (← links)