Pages that link to "Item:Q690464"
From MaRDI portal
The following pages link to On parameterized independent feedback vertex set (Q690464):
Displaying 25 items.
- Circular convex bipartite graphs: feedback vertex sets (Q300230) (← links)
- Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity (Q1680547) (← links)
- Independent feedback vertex sets for graphs of bounded diameter (Q1685021) (← links)
- Independent feedback vertex set for \(P_5\)-free graphs (Q1739097) (← links)
- An improved FPT algorithm for almost forest deletion problem (Q1751414) (← links)
- On some hard and some tractable cases of the maximum acyclic matching problem (Q2288858) (← links)
- A polynomial kernel for block graph deletion (Q2408204) (← links)
- An improved parameterized algorithm for the independent feedback vertex set problem (Q2447761) (← links)
- Circumventing connectivity for kernelization (Q2692730) (← links)
- Deterministic Algorithms for the Independent Feedback Vertex Set Problem (Q2946071) (← links)
- (Q5005155) (← links)
- Exploring the Kernelization Borders for Hitting Cycles (Q5009476) (← links)
- Recognizing Graphs Close to Bipartite Graphs (Q5111287) (← links)
- Independent Feedback Vertex Set for P_5-free Graphs (Q5136232) (← links)
- On cycle transversals and their connected variants in the absence of a small linear forest (Q5918178) (← links)
- An improved FPT algorithm for independent feedback vertex set (Q5918287) (← links)
- Conflict free version of covering problems on graphs: classical and parameterized (Q5918906) (← links)
- Approximability of the independent feedback vertex set problem for bipartite graphs (Q5919046) (← links)
- Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration (Q6056774) (← links)
- Improved FPT Algorithms for Deletion to Forest-Like Structures. (Q6065438) (← links)
- Minimization and parameterized variants of vertex partition problems on graphs (Q6087212) (← links)
- On the price of independence for vertex cover, feedback vertex set and odd cycle transversal (Q6181986) (← links)
- Improved FPT Algorithms for Deletion to Forest-Like Structures (Q6492092) (← links)
- Sparsity in covering solutions (Q6547950) (← links)
- Near-bipartiteness, connected near-bipartiteness, independent feedback vertex set and acyclic vertex cover on graphs having small dominating sets (Q6606167) (← links)
