Pages that link to "Item:Q2843281"

The following pages link to Solving Planar k -Terminal Cut in $O(n^{c \sqrt{k}})$ Time (Q2843281):

Displaying 16 items.

• Improved parameterized and exact algorithms for cut problems on trees (Q896125) (← links)
• Multicuts in planar and bounded-genus graphs with bounded number of terminals (Q2408168) (← links)
• An \(O^\ast(1.84^k)\) parameterized algorithm for the multiterminal cut problem (Q2445900) (← links)
• FPT Suspects and Tough Customers: Open Problems of Downey and Fellows (Q2908547) (← links)
• Optimal Parameterized Algorithms for Planar Facility Location Problems Using Voronoi Diagrams (Q3452847) (← links)
• Coloring Graphs with Constraints on Connectivity (Q4978449) (← links)
• Parameterized Approximation Algorithms for Bidirected Steiner Network Problems (Q5009577) (← links)
• A Subexponential Parameterized Algorithm for Directed Subset Traveling Salesman Problem on Planar Graphs (Q5071089) (← links)
• (Q5088957) (← links)
• (Q5089231) (← links)
• Quick separation in chordal and split graphs (Q5089243) (← links)
• Subexponential parameterized algorithms for graphs of polynomial growth (Q5111748) (← links)
• A Near-Linear Approximation Scheme for Multicuts of Embedded Graphs With a Fixed Number of Terminals (Q5149755) (← links)
• Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions) (Q5221061) (← links)
• A Tight Lower Bound for Edge-Disjoint Paths on Planar DAGs (Q6158361) (← links)
• A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)