Pages that link to "Item:Q3652285"

The following pages link to Constant-Factor Approximations of Branch-Decomposition and Largest Grid Minor of Planar Graphs in O(n 1 + ε ) Time (Q3652285):

Displayed 7 items.

• Constant-factor approximations of branch-decomposition and largest grid minor of planar graphs in \(O(n^{1+\epsilon})\) time (Q553343) ‎ (← links)
• Induced packing of odd cycles in planar graphs (Q764360) ‎ (← links)
• Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs (Q988694) ‎ (← links)
• Fast minor testing in planar graphs (Q1759679) ‎ (← links)
• (Q5743390) ‎ (← links)
• (Q5743428) ‎ (← links)
• (Q5743430) ‎ (← links)