Pages that link to "Item:Q2324243"

The following pages link to How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs? (Q2324243):

Displaying 11 items.

• On the approximate compressibility of connected vertex cover (Q2006945) (← links)
• Measuring what matters: a hybrid approach to dynamic programming with treewidth (Q2040028) (← links)
• Preprocessing vertex-deletion problems: characterizing graph properties by low-rank adjacencies (Q2119402) (← links)
• Polynomial kernels for hitting forbidden minors under structural parameterizations (Q2202024) (← links)
• A Turing kernelization dichotomy for structural parameterizations of \(\mathcal{F} \)-minor-free deletion (Q2662677) (← links)
• Parameterized complexity of computing maximum minimal blocking and hitting sets (Q2684484) (← links)
• Bridge-Depth Characterizes which Minor-Closed Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel (Q5048303) (← links)
• Elimination Distances, Blocking Sets, and Kernels for Vertex Cover (Q5099101) (← links)
• Smaller Parameters for Vertex Cover Kernelization (Q5111879) (← links)
• On the Parameterized Complexity of Clique Elimination Distance (Q6068235) (← links)
• Kernelization for feedback vertex set via elimination distance to a forest (Q6153475) (← links)