Pages that link to "Item:Q713308"

The following pages link to Kernelization hardness of connectivity problems in \(d\)-degenerate graphs (Q713308):

Displaying 12 items.

• The price of connectivity for cycle transversals (Q739064) (← links)
• On the terminal connection problem (Q831820) (← links)
• Twin-width and polynomial kernels (Q2093574) (← links)
• A multivariate analysis of the strict terminal connection problem (Q2306846) (← links)
• The graph motif problem parameterized by the structure of the input graph (Q2403795) (← links)
• Extending the kernel for planar Steiner tree to the number of Steiner vertices (Q2408201) (← links)
• Clique Cover and Graph Separation (Q2943572) (← links)
• Lossy Kernels for Connected Dominating Set on Sparse Graphs (Q3304128) (← links)
• The Maximum Colorful Arborescence problem parameterized by the structure of its color hierarchy graph (Q5140781) (← links)
• On the computational difficulty of the terminal connection problem (Q6041044) (← links)
• Further Exploiting <i>c</i>-Closure for FPT Algorithms and Kernels for Domination Problems (Q6071818) (← links)
• Essentially tight kernels for (weakly) closed graphs (Q6103524) (← links)