Pages that link to "Item:Q5885586"
From MaRDI portal
The following pages link to Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering (Q5885586):
Displaying 11 items.
- Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs (Q988694) (← links)
- Subexponential algorithms for partial cover problems (Q1944141) (← links)
- Finding, hitting and packing cycles in subexponential time on unit disk graphs (Q2334507) (← links)
- Subexponential parameterized algorithms for bounded-degree connected subgraph problems on planar graphs (Q2839212) (← links)
- Subexponential algorithms for partial cover problems (Q2920126) (← links)
- (Q4972036) (← 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)
- A Tight Lower Bound for Edge-Disjoint Paths on Planar DAGs (Q6158361) (← links)
- FPT approximation and subexponential algorithms for covering few or many edges (Q6195348) (← links)
- Algorithms and Turing kernels for detecting and counting small patterns in unit disk graphs (Q6655672) (← links)
