Pages that link to "Item:Q456698"

The following pages link to FPT algorithms for path-transversal and cycle-transversal problems (Q456698):

Displaying 19 items.

• On group feedback vertex set parameterized by the size of the cutset (Q262251) (← links)
• Parameterized complexity dichotomy for \textsc{Steiner Multicut} (Q295637) (← links)
• On the parameterized complexity of finding separators with non-hereditary properties (Q494799) (← links)
• Parameterized complexity of critical node cuts (Q517024) (← links)
• Edge bipartization faster than \(2^k\) (Q666655) (← links)
• Multi-budgeted directed cuts (Q786027) (← links)
• Synchronization problems in computer vision with closed-form solutions (Q2193841) (← links)
• A faster FPT algorithm for bipartite contraction (Q2445333) (← links)
• Half-integrality, LP-branching, and FPT Algorithms (Q2816829) (← 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)
• A Faster Parameterized Algorithm for Group Feedback Edge Set (Q3181064) (← links)
• Designing FPT Algorithms for Cut Problems Using Randomized Contractions (Q3187169) (← links)
• Multi-Budgeted Directed Cuts (Q5009480) (← links)
• (Q5089231) (← links)
• A deterministic polynomial kernel for odd cycle transversal and vertex multiway cut in planar graphs (Q5090489) (← links)
• A Linear-Time Parameterized Algorithm for Node Unique Label Cover (Q5111746) (← links)
• On Weighted Graph Separation Problems and Flow Augmentation (Q6187079) (← links)