Pages that link to "Item:Q2849328"
From MaRDI portal
The following pages link to Tight Kernel Bounds for Problems on Graphs with Small Degeneracy (Q2849328):
Displaying 11 items.
- Independent dominating set problem revisited (Q476836) (← links)
- Kernelization hardness of connectivity problems in \(d\)-degenerate graphs (Q713308) (← links)
- Twin-width and polynomial kernels (Q2093574) (← links)
- On sparsification for computing treewidth (Q2343087) (← links)
- Sparsification upper and lower bounds for graph problems and not-all-equal SAT (Q2408194) (← links)
- Tight Approximations of Degeneracy in Large Graphs (Q2802958) (← links)
- Kernelization Hardness of Connectivity Problems in d-Degenerate Graphs (Q3057621) (← links)
- Lossy Kernels for Connected Dominating Set on Sparse Graphs (Q3304128) (← links)
- Exploiting $c$-Closure in Kernelization Algorithms for Graph Problems (Q5048305) (← links)
- Lossy Kernels for Connected Dominating Set on Sparse Graphs (Q5234662) (← links)
- Exploiting c-Closure in Kernelization Algorithms for Graph Problems (Q5874537) (← links)