Pages that link to "Item:Q372970"

The following pages link to Vertex cover kernelization revisited. Upper and lower bounds for a refined parameter (Q372970):

Displaying 28 items.

• Structural parameterizations of undirected feedback vertex set: FPT algorithms and kernelization (Q722549) (← links)
• On the approximate compressibility of connected vertex cover (Q2006945) (← links)
• Subexponential parameterized algorithms and kernelization on almost chordal graphs (Q2037110) (← links)
• Measuring what matters: a hybrid approach to dynamic programming with treewidth (Q2040028) (← links)
• Structural parameterizations with modulator oblivion (Q2161010) (← links)
• Polynomial kernels for hitting forbidden minors under structural parameterizations (Q2202024) (← links)
• Revisiting connected vertex cover: FPT algorithms and lossy kernels (Q2322693) (← links)
• Polynomial kernels for vertex cover parameterized by small degree modulators (Q2322700) (← links)
• A multivariate framework for weighted FPT algorithms (Q2402359) (← links)
• Meta-kernelization using well-structured modulators (Q2413976) (← links)
• A Turing kernelization dichotomy for structural parameterizations of \(\mathcal{F} \)-minor-free deletion (Q2662677) (← links)
• Towards a polynomial kernel for directed feedback vertex set (Q2663705) (← links)
• FPT algorithms to compute the elimination distance to bipartite graphs and more (Q2672425) (← links)
• Parameterized complexity of computing maximum minimal blocking and hitting sets (Q2684484) (← links)
• Maximum Minimal Vertex Cover Parameterized by Vertex Cover (Q2946427) (← links)
• A Randomized Polynomial Kernelization for Vertex Cover with a Smaller Parameter (Q3177162) (← links)
• Vertex Cover Structural Parameterization Revisited (Q3181056) (← links)
• A Multivariate Approach for Weighted FPT Algorithms (Q3452855) (← links)
• Maximum Minimal Vertex Cover Parameterized by Vertex Cover (Q4588848) (← links)
• Polynomial Kernels for Hitting Forbidden Minors under Structural Parameterizations. (Q5009611) (← links)
• Bridge-Depth Characterizes which Minor-Closed Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel (Q5048303) (← links)
• (Q5090486) (← links)
• Elimination Distances, Blocking Sets, and Kernels for Vertex Cover (Q5099101) (← links)
• (Q5111250) (← links)
• Smaller Parameters for Vertex Cover Kernelization (Q5111879) (← links)
• (Q5874519) (← links)
• The parameterized complexity of cycle packing: indifference is not an issue (Q5919574) (← links)
• (Q6089666) (← links)