Pages that link to "Item:Q494933"

The following pages link to On feedback vertex set: new measure and new structures (Q494933):

Displayed 14 items.

• Structural parameterizations of undirected feedback vertex set: FPT algorithms and kernelization (Q722549) ‎ (← links)
• A parameterized complexity view on collapsing \(k\)-cores (Q825978) ‎ (← links)
• Sublinear approximation algorithms for boxicity and related problems (Q1693125) ‎ (← links)
• Solving problems on graphs of high rank-width (Q1709595) ‎ (← links)
• An improved FPT algorithm for almost forest deletion problem (Q1751414) ‎ (← links)
• Improved analysis of highest-degree branching for feedback vertex set (Q2041981) ‎ (← links)
• An approximation algorithm for the \(l\)-pseudoforest deletion problem (Q2285146) ‎ (← links)
• A polynomial kernel for block graph deletion (Q2408204) ‎ (← links)
• Parameterized complexity of fair feedback vertex set problem (Q2663038) ‎ (← links)
• FPT Algorithms for FVS Parameterized by Split and Cluster Vertex Deletion Sets and Other Parameters (Q4632216) ‎ (← links)
• (Q5009469) ‎ (← links)
• (Q5240414) ‎ (← links)
• Tree Deletion Set Has a Polynomial Kernel but No $\text{OPT}^\mathcal{O}(1)$ Approximation) (Q5741082) ‎ (← links)
• An improved FPT algorithm for independent feedback vertex set (Q5918287) ‎ (← links)