Pages that link to "Item:Q968273"

The following pages link to A cubic kernel for feedback vertex set and loop cutset (Q968273):

Displaying 21 items.

• A \(13k\)-kernel for planar feedback vertex set via region decomposition (Q306250) (← links)
• Parameterized complexity of vertex deletion into perfect graph classes (Q392038) (← links)
• Kernel bounds for disjoint cycles and disjoint paths (Q638521) (← links)
• Structural parameterizations of undirected feedback vertex set: FPT algorithms and kernelization (Q722549) (← links)
• Polynomial kernels for deletion to classes of acyclic digraphs (Q1751231) (← links)
• Faster deterministic \textsc{Feedback Vertex Set} (Q2015151) (← 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)
• Preprocessing to reduce the search space: antler structures for feedback vertex set (Q2672419) (← links)
• Subset Feedback Vertex Set Is Fixed-Parameter Tractable (Q3012825) (← links)
• A Quartic Kernel for Pathwidth-One Vertex Deletion (Q3057625) (← links)
• Parameterized Complexity of Vertex Deletion into Perfect Graph Classes (Q3088287) (← links)
• Kernelization: New Upper and Lower Bound Techniques (Q3656848) (← links)
• Approximation and Kernelization for Chordal Vertex Deletion (Q4586151) (← links)
• Generalized Pseudoforest Deletion: Algorithms and Uniform Kernel (Q4637327) (← links)
• (Q5009475) (← links)
• Crossing Paths with Hans Bodlaender: A Personal View on Cross-Composition for Sparsification Lower Bounds (Q5042452) (← links)
• (Q5111250) (← links)
• (Q5140722) (← links)
• Tree Deletion Set Has a Polynomial Kernel but No $\text{OPT}^\mathcal{O}(1)$ Approximation) (Q5741082) (← links)
• Kernelization for feedback vertex set via elimination distance to a forest (Q6153475) (← links)