Pages that link to "Item:Q2843292"

The following pages link to A Tight Lower Bound for Planar Multiway Cut with Fixed Number of Terminals (Q2843292):

Displaying 19 items.

• A tight algorithm for strongly connected Steiner subgraph on two terminals with demands (Q524378) (← links)
• Improved parameterized and exact algorithms for cut problems on trees (Q896125) (← links)
• An FPT algorithm for planar multicuts with sources and sinks on the outer face (Q1755788) (← links)
• A tight lower bound for planar Steiner orientation (Q1999967) (← 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)
• A Tight Algorithm for Strongly Connected Steiner Subgraph on Two Terminals with Demands (Extended Abstract) (Q2946016) (← 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)
• On Geometric Set Cover for Orthants (Q5075763) (← links)
• (Q5088957) (← links)
• (Q5089231) (← 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)
• The Parameterized Complexity of Finding a 2-Sphere in a Simplicial Complex (Q5241237) (← links)
• A Tight Lower Bound for Edge-Disjoint Paths on Planar DAGs (Q6158361) (← links)
• On the parameterized intractability of determinant maximization (Q6547207) (← links)
• The parameterized complexity of the survivable network design problem (Q6655676) (← links)