Pages that link to "Item:Q949776"
From MaRDI portal
The following pages link to Linearity of grid minors in treewidth with applications through bidimensionality (Q949776):
Displaying 44 items.
- Beyond bidimensionality: parameterized subexponential algorithms on directed graphs (Q391650) (← links)
- Grid minors in damaged grids (Q405308) (← links)
- The complexity of two graph orientation problems (Q412352) (← links)
- Local search: is brute-force avoidable? (Q439931) (← links)
- Catalan structures and dynamic programming in \(H\)-minor-free graphs (Q440008) (← links)
- Subexponential parameterized algorithms (Q458457) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- On the parameterized complexity of the edge monitoring problem (Q509893) (← links)
- The edge-disjoint paths problem in Eulerian graphs and 4-edge-connected graphs (Q520046) (← links)
- Spanners in sparse graphs (Q657919) (← links)
- Polynomial treewidth forces a large grid-like-minor (Q661945) (← links)
- FPT algorithms for connected feedback vertex set (Q695322) (← links)
- Compactors for parameterized counting problems (Q826317) (← links)
- Contraction bidimensionality of geometric intersection graphs (Q832527) (← links)
- Practical algorithms for branch-decompositions of planar graphs (Q896665) (← links)
- Bivariate complexity analysis of \textsc{Almost Forest Deletion} (Q1686068) (← links)
- Explicit linear kernels for packing problems (Q1739112) (← links)
- Fast minor testing in planar graphs (Q1759679) (← links)
- Parameterized complexity of the spanning tree congestion problem (Q1759686) (← links)
- On the excluded minor structure theorem for graphs of large tree-width (Q1931397) (← links)
- Improved bounds on the planar branchwidth with respect to the largest grid minor size (Q1934314) (← links)
- Subexponential algorithms for partial cover problems (Q1944141) (← links)
- Target set selection for conservative populations (Q2235265) (← links)
- Contraction obstructions for treewidth (Q2275894) (← links)
- Linear min-max relation between the treewidth of an \(H\)-minor-free graph and its largest grid minor (Q2284742) (← links)
- Extension complexity of the correlation polytope (Q2294265) (← links)
- Deleting vertices to graphs of bounded genus (Q2319638) (← links)
- Map graphs having witnesses of large girth (Q2632022) (← links)
- Graph Minors and Parameterized Algorithm Design (Q2908540) (← links)
- Chasing a Fast Robber on Planar Graphs and Random Graphs (Q2940989) (← links)
- Low Polynomial Exclusion of Planar Graph Patterns (Q2958196) (← links)
- Strengthening Erdös-Pósa property for minor-closed graph classes (Q3083410) (← links)
- Bidimensionality and Kernels (Q3387764) (← links)
- Approximating Unique Games Using Low Diameter Graph Decomposition (Q5002621) (← links)
- (Q5009461) (← links)
- (Q5009465) (← links)
- (Q5075819) (← links)
- Decomposition of Map Graphs with Applications. (Q5091217) (← links)
- (Q5092371) (← links)
- Lossy Kernels for Hitting Subgraphs (Q5111284) (← links)
- Subexponential parameterized algorithms for graphs of polynomial growth (Q5111748) (← links)
- Contraction-Bidimensionality of Geometric Intersection Graphs (Q5111864) (← links)
- Parameterized algorithms and data reduction for the short secluded <i>s</i>‐<i>t</i>‐path problem (Q6068532) (← links)
- FPT approximation and subexponential algorithms for covering few or many edges (Q6195348) (← links)
