Pages that link to "Item:Q2957897"

The following pages link to Subexponential-Time Parameterized Algorithm for Steiner Tree on Planar Graphs (Q2957897):

Displaying 16 items.

• Beyond bidimensionality: parameterized subexponential algorithms on directed graphs (Q391650) (← links)
• Linear kernels for outbranching problems in sparse digraphs (Q2408200) (← links)
• Extending the kernel for planar Steiner tree to the number of Steiner vertices (Q2408201) (← links)
• Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree (Q3448810) (← links)
• Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree (Q4619482) (← links)
• (Q5009500) (← links)
• Parameterized Approximation Algorithms for Bidirected Steiner Network Problems (Q5009577) (← links)
• Four Shorts Stories on Surprising Algorithmic Uses of Treewidth (Q5042454) (← links)
• A Subexponential Parameterized Algorithm for Directed Subset Traveling Salesman Problem on Planar Graphs (Q5071089) (← links)
• A deterministic polynomial kernel for odd cycle transversal and vertex multiway cut in planar graphs (Q5090489) (← links)
• Subexponential parameterized algorithms for graphs of polynomial growth (Q5111748) (← links)
• Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions) (Q5221061) (← links)
• Parameterized Complexity of Directed Steiner Tree on Sparse Graphs (Q5270408) (← links)
• Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering (Q5885586) (← links)
• On the complexity of the cable-trench problem (Q6048437) (← links)
• A Tight Lower Bound for Edge-Disjoint Paths on Planar DAGs (Q6158361) (← links)