Pages that link to "Item:Q5302055"
From MaRDI portal
The following pages link to Parameterized Complexity for Domination Problems on Degenerate Graphs (Q5302055):
Displaying 19 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)
- FPT algorithms for domination in sparse graphs and beyond (Q1740694) (← links)
- Twin-width and polynomial kernels (Q2093574) (← links)
- Partial vertex cover on graphs of bounded degeneracy (Q2097233) (← links)
- Linear kernels for \(k\)-tuple and liar's domination in bounded genus graphs (Q2403794) (← links)
- An approval-based model for single-step liquid democracy (Q2670941) (← links)
- Kernelization Hardness of Connectivity Problems in d-Degenerate Graphs (Q3057621) (← links)
- A Constructive Arboricity Approximation Scheme (Q3297754) (← links)
- Smaller Kernels for Several FPT Problems Based on Simple Observations (Q3452562) (← links)
- Exploiting $c$-Closure in Kernelization Algorithms for Graph Problems (Q5048305) (← links)
- (Q5136270) (← links)
- Exploiting c-Closure in Kernelization Algorithms for Graph Problems (Q5874537) (← links)
- (Q6065417) (← links)
- Further Exploiting <i>c</i>-Closure for FPT Algorithms and Kernels for Domination Problems (Q6071818) (← links)
- Computing dense and sparse subgraphs of weakly closed graphs (Q6107896) (← links)
