Pages that link to "Item:Q955350"
From MaRDI portal
The following pages link to Improved algorithms for feedback vertex set problems (Q955350):
Displaying 50 items.
- On group feedback vertex set parameterized by the size of the cutset (Q262251) (← links)
- Approximation algorithms for orienting mixed graphs (Q390889) (← links)
- Beyond bidimensionality: parameterized subexponential algorithms on directed graphs (Q391650) (← links)
- Feedback vertex sets on restricted bipartite graphs (Q393042) (← links)
- Fixed-parameter algorithms for cochromatic number and disjoint rectangle stabbing via iterative localization (Q393084) (← links)
- FPT algorithms for path-transversal and cycle-transversal problems (Q456698) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- Enumerating minimal subset feedback vertex sets (Q472481) (← links)
- On feedback vertex set: new measure and new structures (Q494933) (← links)
- Planar feedback vertex set and face cover: combinatorial bounds and subexponential algorithms (Q547307) (← links)
- Hardness of subgraph and supergraph problems in \(c\)-tournaments (Q638528) (← links)
- On parameterized independent feedback vertex set (Q690464) (← links)
- A single-exponential FPT algorithm for the \(K_4\)-\textsc{minor cover} problem (Q743120) (← links)
- An FPT algorithm for edge subset feedback edge set (Q763477) (← links)
- An FPT algorithm for the vertex cover \(P_4\) problem (Q906446) (← links)
- Kernels for deletion to classes of acyclic digraphs (Q1678165) (← links)
- An improved FPT algorithm for almost forest deletion problem (Q1751414) (← links)
- Faster deterministic \textsc{Feedback Vertex Set} (Q2015151) (← links)
- Improved analysis of highest-degree branching for feedback vertex set (Q2041981) (← links)
- On the complexity of singly connected vertex deletion (Q2089067) (← links)
- FPT algorithms for generalized feedback vertex set problems (Q2110739) (← links)
- Fixed-parameter tractability results for feedback set problems in tournaments (Q2266940) (← links)
- Iterative compression and exact algorithms (Q2268862) (← links)
- Mim-width. II. The feedback vertex set problem (Q2285053) (← links)
- Parameterised algorithms for deletion to classes of DAGs (Q2322699) (← links)
- Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth (Q2347800) (← links)
- An improved exact algorithm for undirected feedback vertex set (Q2355979) (← links)
- A multivariate framework for weighted FPT algorithms (Q2402359) (← links)
- A polynomial kernel for block graph deletion (Q2408204) (← links)
- On compiling structured CNFs to OBDDs (Q2411046) (← links)
- Contracting graphs to paths and trees (Q2441588) (← links)
- A faster FPT algorithm for bipartite contraction (Q2445333) (← links)
- An improved parameterized algorithm for the independent feedback vertex set problem (Q2447761) (← links)
- Towards a polynomial kernel for directed feedback vertex set (Q2663705) (← links)
- Odd cycle transversal in mixed graphs (Q2672431) (← links)
- Fixed parameterized algorithms for generalized feedback vertex set problems (Q2693637) (← links)
- An Improved Exact Algorithm for Undirected Feedback Vertex Set (Q2867116) (← links)
- Backdoors to Satisfaction (Q2908542) (← links)
- What’s Next? Future Directions in Parameterized Complexity (Q2908548) (← links)
- Two Hardness Results on Feedback Vertex Sets (Q3004674) (← links)
- Approximation Algorithms for Orienting Mixed Graphs (Q3011872) (← links)
- Subset Feedback Vertex Set Is Fixed-Parameter Tractable (Q3012825) (← links)
- Minimum Cell Connection in Line Segment Arrangements (Q3132917) (← links)
- On Compiling Structured CNFs to OBDDs (Q3194709) (← links)
- (Q3304141) (← links)
- (Q5005155) (← links)
- (Q5111250) (← links)
- (Q5136298) (← links)
- (Q5140722) (← links)
- Improved FPT Algorithms for Deletion to Forest-Like Structures. (Q6065438) (← links)
