Pages that link to "Item:Q856420"

The following pages link to Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization (Q856420):

Displaying 50 items.

• On group feedback vertex set parameterized by the size of the cutset (Q262251) (← links)
• A note on the parameterized complexity of unordered maximum tree orientation (Q427909) (← links)
• Confronting intractability via parameters (Q465686) (← links)
• A fixed-parameter algorithm for the vertex cover \(P_3\) problem (Q477591) (← links)
• On feedback vertex set: new measure and new structures (Q494933) (← links)
• On the parameterized complexity of reconfiguration problems (Q527426) (← links)
• Separator-based data reduction for signed graph balancing (Q613659) (← links)
• Vertex cover problem parameterized above and below tight bounds (Q633768) (← links)
• The complexity of König subgraph problems and above-guarantee vertex cover (Q652520) (← links)
• Edge bipartization faster than \(2^k\) (Q666655) (← links)
• FPT algorithms for connected feedback vertex set (Q695322) (← links)
• A single-exponential FPT algorithm for the \(K_4\)-\textsc{minor cover} problem (Q743120) (← links)
• A parameterized complexity view on collapsing \(k\)-cores (Q825978) (← links)
• An FPT algorithm for the vertex cover \(P_4\) problem (Q906446) (← links)
• Improved algorithms for feedback vertex set problems (Q955350) (← links)
• Fixed-parameter enumerability of cluster editing and related problems (Q970105) (← links)
• Minimum fill-in and treewidth of split \(+ ke\) and split \(+kv\) graphs (Q972334) (← links)
• Chordal deletion is fixed-parameter tractable (Q973007) (← links)
• Parameterized complexity of finding regular induced subgraphs (Q1026227) (← links)
• An improved FPT algorithm for almost forest deletion problem (Q1751414) (← links)
• Faster deterministic \textsc{Feedback Vertex Set} (Q2015151) (← links)
• Incompressibility of \(H\)-free edge modification problems: towards a dichotomy (Q2071824) (← links)
• On the complexity of singly connected vertex deletion (Q2089067) (← links)
• An improved deterministic parameterized algorithm for cactus vertex deletion (Q2135634) (← 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)
• Faster graph bipartization (Q2301359) (← links)
• An improved exact algorithm for undirected feedback vertex set (Q2355979) (← links)
• Parameterized complexity of satisfying almost all linear equations over \(\mathbb F_2\) (Q2392244) (← links)
• A polynomial kernel for block graph deletion (Q2408204) (← 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)
• Odd cycle transversal in mixed graphs (Q2672431) (← links)
• Circumventing connectivity for kernelization (Q2692730) (← links)
• An Improved Exact Algorithm for Undirected Feedback Vertex Set (Q2867116) (← links)
• On Polynomial Kernels for Structural Parameterizations of Odd Cycle Transversal (Q2891343) (← links)
• FPT Suspects and Tough Customers: Open Problems of Downey and Fellows (Q2908547) (← links)
• What’s Next? Future Directions in Parameterized Complexity (Q2908548) (← links)
• Subset Feedback Vertex Set Is Fixed-Parameter Tractable (Q3012825) (← links)
• A Quartic Kernel for Pathwidth-One Vertex Deletion (Q3057625) (← links)
• (Q3304141) (← links)
• A Linear Kernel for Planar Feedback Vertex Set (Q3503587) (← links)
• Iterative Compression and Exact Algorithms (Q3599139) (← links)
• Iterative Compression for Exactly Solving NP-Hard Minimization Problems (Q3637312) (← links)
• Generalized Pseudoforest Deletion: Algorithms and Uniform Kernel (Q4637327) (← links)
• (Q5009469) (← links)
• On the Complexity of Singly Connected Vertex Deletion (Q5041193) (← links)
• (Q5091216) (← links)