Pages that link to "Item:Q3452187"
From MaRDI portal
The following pages link to A fixed-parameter algorithm for the directed feedback vertex set problem (Q3452187):
Displaying 50 items.
- On group feedback vertex set parameterized by the size of the cutset (Q262251) (← links)
- Dynamics and control at feedback vertex sets. I: Informative and determining nodes in regulatory networks (Q376311) (← links)
- Fixed-parameter algorithms for cochromatic number and disjoint rectangle stabbing via iterative localization (Q393084) (← links)
- Finding kernels or solving SAT (Q414435) (← links)
- Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables (Q414863) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- On parameterized independent feedback vertex set (Q690464) (← links)
- Kernels for below-upper-bound parameterizations of the hitting set and directed dominating set problems (Q719315) (← links)
- Exact localisations of feedback sets (Q722200) (← links)
- An FPT algorithm for edge subset feedback edge set (Q763477) (← links)
- Multi-budgeted directed cuts (Q786027) (← links)
- Approximations of arbitrary relations by partial orders (Q1644912) (← links)
- Polynomial kernels for deletion to classes of acyclic digraphs (Q1751231) (← links)
- Augmenting tractable fragments of abstract argumentation (Q1761284) (← links)
- On knot-free vertex deletion: fine-grained parameterized complexity analysis of a deadlock resolution graph problem (Q2078619) (← links)
- On the complexity of singly connected vertex deletion (Q2089067) (← links)
- On the complexity of recognizing Wheeler graphs (Q2118211) (← links)
- On the feedback number of 3-uniform linear extremal hypergraphs (Q2150590) (← links)
- A polynomial kernel for funnel arc deletion set (Q2161012) (← links)
- Component order connectivity in directed graphs (Q2165039) (← links)
- Fixed-parameter tractability results for feedback set problems in tournaments (Q2266940) (← links)
- Kernels for packing and covering problems (Q2272393) (← links)
- Triangle edge deletion on planar glasses-free RGB-digraphs (Q2317352) (← links)
- Parameterised algorithms for deletion to classes of DAGs (Q2322699) (← links)
- Backdoors to tractable answer set programming (Q2341833) (← links)
- On the space and circuit complexity of parameterized problems: classes and completeness (Q2343093) (← links)
- An improved exact algorithm for undirected feedback vertex set (Q2355979) (← links)
- Linear kernels for separating a graph into components of bounded size (Q2361357) (← links)
- A faster FPT algorithm for bipartite contraction (Q2445333) (← links)
- An \(O^\ast(1.84^k)\) parameterized algorithm for the multiterminal cut problem (Q2445900) (← links)
- Towards a polynomial kernel for directed feedback vertex set (Q2663705) (← links)
- FPT is characterized by useful obstruction sets (Q2828222) (← links)
- An Improved Exact Algorithm for Undirected Feedback Vertex Set (Q2867116) (← links)
- On Polynomial Kernels for Structural Parameterizations of Odd Cycle Transversal (Q2891343) (← links)
- Backdoors to Satisfaction (Q2908542) (← links)
- FPT Suspects and Tough Customers: Open Problems of Downey and Fellows (Q2908547) (← links)
- What’s Next? Future Directions in Parameterized Complexity (Q2908548) (← links)
- Clique Cover and Graph Separation (Q2943572) (← links)
- Two Hardness Results on Feedback Vertex Sets (Q3004674) (← links)
- Clustering with Local Restrictions (Q3012850) (← links)
- Important Separators and Parameterized Algorithms (Q3104759) (← links)
- Parameterized Complexity of Eulerian Deletion Problems (Q3104771) (← links)
- Acyclic Digraphs (Q3120435) (← links)
- The complexity of speedrunning video games (Q3301017) (← links)
- A spin glass approach to the directed feedback vertex set problem (Q3302766) (← links)
- (Q5002795) (← links)
- Multi-Budgeted Directed Cuts (Q5009480) (← links)
- On the Complexity of Singly Connected Vertex Deletion (Q5041193) (← links)
- On the Hardness and Inapproximability of Recognizing Wheeler Graphs (Q5075794) (← links)
- Adapting the Directed Grid Theorem into an FPT Algorithm (Q5099098) (← links)
