Pages that link to "Item:Q695322"
From MaRDI portal
The following pages link to FPT algorithms for connected feedback vertex set (Q695322):
Displaying 18 items.
- Finding good 2-partitions of digraphs. I. Hereditary properties (Q290530) (← links)
- A \(9k\) kernel for nonseparating independent set in planar graphs (Q385964) (← links)
- Dynamic parameterized problems (Q722546) (← links)
- The price of connectivity for cycle transversals (Q739064) (← links)
- Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity (Q1680547) (← links)
- An improved FPT algorithm for almost forest deletion problem (Q1751414) (← links)
- On the parameterized complexity of 2-partitions (Q2205943) (← links)
- A complete parameterized complexity analysis of bounded planning (Q2353405) (← links)
- Improved parameterized algorithms for network query problems (Q2414861) (← links)
- Degree-constrained 2-partitions of graphs (Q2419120) (← links)
- Finding good 2-partitions of digraphs. II. Enumerable properties (Q2629228) (← links)
- Circumventing connectivity for kernelization (Q2692730) (← links)
- Improved Parameterized Algorithms for Network Query Problems (Q2946028) (← links)
- (Q5075825) (← links)
- Improved FPT Algorithms for Deletion to Forest-Like Structures. (Q6065438) (← links)
- Further Exploiting <i>c</i>-Closure for FPT Algorithms and Kernels for Domination Problems (Q6071818) (← links)
- Minimization and parameterized variants of vertex partition problems on graphs (Q6087212) (← links)
- Improved FPT Algorithms for Deletion to Forest-Like Structures (Q6492092) (← links)
