Pages that link to "Item:Q3499737"
From MaRDI portal
The following pages link to The Undirected Feedback Vertex Set Problem Has a Poly(k) Kernel (Q3499737):
Displayed 30 items.
- A \(13k\)-kernel for planar feedback vertex set via region decomposition (Q306250) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- On the small cycle transversal of planar graphs (Q551170) (← links)
- Kernel bounds for disjoint cycles and disjoint paths (Q638521) (← links)
- Quadratic kernelization for convex recoloring of trees (Q639283) (← links)
- The complexity ecology of parameters: An illustration using bounded max leaf number (Q733736) (← links)
- A cubic kernel for feedback vertex set and loop cutset (Q968273) (← links)
- On problems without polynomial kernels (Q1034099) (← links)
- A randomized polynomial kernel for subset feedback vertex set (Q1702849) (← links)
- Faster deterministic \textsc{Feedback Vertex Set} (Q2015151) (← links)
- Improved analysis of highest-degree branching for feedback vertex set (Q2041981) (← links)
- Preprocessing vertex-deletion problems: characterizing graph properties by low-rank adjacencies (Q2119402) (← links)
- Preprocessing to reduce the search space: antler structures for feedback vertex set (Q2672419) (← links)
- Hitting Forbidden Minors: Approximation and Kernelization (Q2790404) (← links)
- Kernelization – Preprocessing with a Guarantee (Q2908537) (← links)
- Subset Feedback Vertex Set Is Fixed-Parameter Tractable (Q3012825) (← links)
- A Quartic Kernel for Pathwidth-One Vertex Deletion (Q3057625) (← links)
- A Linear Kernel for Planar Feedback Vertex Set (Q3503587) (← links)
- Approximation and Kernelization for Chordal Vertex Deletion (Q4586151) (← links)
- Generalized Pseudoforest Deletion: Algorithms and Uniform Kernel (Q4637327) (← links)
- (Q5009475) (← links)
- Exploring the Kernelization Borders for Hitting Cycles (Q5009476) (← links)
- Crossing Paths with Hans Bodlaender: A Personal View on Cross-Composition for Sparsification Lower Bounds (Q5042452) (← links)
- (Q5140722) (← links)
- Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential Algorithms (Q5302061) (← links)
- Tree Deletion Set Has a Polynomial Kernel but No $\text{OPT}^\mathcal{O}(1)$ Approximation) (Q5741082) (← links)
- (Q5743380) (← links)
- Kernelization for feedback vertex set via elimination distance to a forest (Q6039422) (← links)
- MIP formulations for induced graph optimization problems: a tutorial (Q6056886) (← links)
- Kernelization for feedback vertex set via elimination distance to a forest (Q6153475) (← links)