Pages that link to "Item:Q2015151"
From MaRDI portal
The following pages link to Faster deterministic \textsc{Feedback Vertex Set} (Q2015151):
Displaying 42 items.
- Algorithms and kernels for \textsc{Feedback Set} problems in generalizations of tournaments (Q329279) (← links)
- On feedback vertex set: new measure and new structures (Q494933) (← links)
- Dynamic parameterized problems (Q722546) (← links)
- Structural parameterizations of undirected feedback vertex set: FPT algorithms and kernelization (Q722549) (← links)
- A parameterized complexity view on collapsing \(k\)-cores (Q825978) (← links)
- Kernels for deletion to classes of acyclic digraphs (Q1678165) (← links)
- Bivariate complexity analysis of \textsc{Almost Forest Deletion} (Q1686068) (← links)
- A faster parameterized algorithm for pseudoforest deletion (Q1693129) (← links)
- A randomized polynomial kernel for subset feedback vertex set (Q1702849) (← links)
- Independent feedback vertex set for \(P_5\)-free graphs (Q1739097) (← links)
- An improved FPT algorithm for almost forest deletion problem (Q1751414) (← links)
- Improved analysis of highest-degree branching for feedback vertex set (Q2041981) (← links)
- On the complexity of singly connected vertex deletion (Q2089067) (← links)
- On the feedback number of 3-uniform linear extremal hypergraphs (Q2150590) (← links)
- On the tractability of \(( k , i )\)-coloring (Q2235289) (← links)
- An approximation algorithm for the \(l\)-pseudoforest deletion problem (Q2285146) (← links)
- Parameterised algorithms for deletion to classes of DAGs (Q2322699) (← links)
- Faster exact algorithms for some terminal set problems (Q2361353) (← links)
- A polynomial kernel for block graph deletion (Q2408204) (← links)
- An improved parameterized algorithm for the independent feedback vertex set problem (Q2447761) (← links)
- Simultaneous feedback edge set: a parameterized perspective (Q2659779) (← links)
- Towards a polynomial kernel for directed feedback vertex set (Q2663705) (← links)
- Odd cycle transversal in mixed graphs (Q2672431) (← links)
- Generalized Pseudoforest Deletion: Algorithms and Uniform Kernel (Q2946421) (← links)
- Euler Digraphs (Q3120436) (← links)
- Parameterized Vertex Deletion Problems for Hereditary Graph Classes with a Block Property (Q3181061) (← links)
- Bivariate Complexity Analysis of Almost Forest Deletion (Q3196379) (← links)
- (Q5005155) (← links)
- (Q5009469) (← links)
- (Q5111250) (← links)
- (Q5136298) (← links)
- (Q5140722) (← links)
- A naive algorithm for feedback vertex set (Q5240414) (← links)
- MIP formulations for induced graph optimization problems: a tutorial (Q6056886) (← links)
- Improved FPT Algorithms for Deletion to Forest-Like Structures. (Q6065438) (← links)
- A parameterized algorithm for subset feedback vertex set in tournaments (Q6076355) (← links)
- (Q6089665) (← links)
- Deletion to scattered graph classes. II: Improved FPT algorithms for deletion to pairs of graph classes (Q6098156) (← links)
- Deletion to scattered graph classes. I: Case of finite number of graph classes (Q6133645) (← links)
- Kernelization for feedback vertex set via elimination distance to a forest (Q6153475) (← links)
- Small vertex cover helps in fixed-parameter tractability of graph deletion problems over data streams (Q6185609) (← links)
- Improved FPT Algorithms for Deletion to Forest-Like Structures (Q6492092) (← links)
