Pages that link to "Item:Q3639282"
From MaRDI portal
The following pages link to Solving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels (Q3639282):
Displayed 19 items.
- An FPT-algorithm for modifying a graph of bounded treewidth to decrease the size of its dominating set using minimum modification (Q284360) (← links)
- Lower bounds on kernelization (Q456702) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- The kernelization complexity of connected domination in graphs with (no) small cycles (Q476436) (← links)
- Dominating set is fixed parameter tractable in claw-free graphs (Q650938) (← links)
- Kernelization hardness of connectivity problems in \(d\)-degenerate graphs (Q713308) (← links)
- FPT algorithms for domination in sparse graphs and beyond (Q1740694) (← links)
- Reconfiguration on sparse graphs (Q1747496) (← links)
- Revising Johnson's table for the 21st century (Q2091799) (← links)
- Minimum fill-in of sparse graphs: kernelization and approximation (Q2258069) (← links)
- How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs? (Q2324243) (← links)
- Hitting Forbidden Minors: Approximation and Kernelization (Q2790404) (← links)
- Domination When the Stars Are Out (Q3012826) (← links)
- Kernelization Hardness of Connectivity Problems in d-Degenerate Graphs (Q3057621) (← links)
- Kernelization: New Upper and Lower Bound Techniques (Q3656848) (← links)
- Polynomial Kernels and Faster Algorithms for the Dominating Set Problem on Graphs with an Excluded Minor (Q3656866) (← links)
- How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs (Q5111869) (← links)
- Lossy Kernels for Connected Dominating Set on Sparse Graphs (Q5234662) (← links)
- (Q5743379) (← links)