Pages that link to "Item:Q3088068"
From MaRDI portal
The following pages link to Problems Parameterized by Treewidth Tractable in Single Exponential Time: A Logical Approach (Q3088068):
Displayed 23 items.
- Catalan structures and dynamic programming in \(H\)-minor-free graphs (Q440008) (← links)
- Contraction bidimensionality of geometric intersection graphs (Q832527) (← links)
- Simplified algorithmic metatheorems beyond MSO: treewidth and neighborhood diversity (Q1687933) (← links)
- Subexponential parameterized algorithms and kernelization on almost chordal graphs (Q2037110) (← links)
- Subexponential-time algorithms for finding large induced sparse subgraphs (Q2041989) (← links)
- Hitting forbidden induced subgraphs on bounded treewidth graphs (Q2051840) (← links)
- Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth (Q2347800) (← links)
- Hitting forbidden subgraphs in graphs of bounded treewidth (Q2407089) (← links)
- Linear kernels for outbranching problems in sparse digraphs (Q2408200) (← links)
- Parameterized complexity dichotomy for \((r, \ell)\)-\textsc{Vertex Deletion} (Q2408559) (← links)
- Contracting graphs to paths and trees (Q2441588) (← links)
- The role of planarity in connectivity problems parameterized by treewidth (Q2514121) (← links)
- (Q3304125) (← links)
- (Q5009465) (← links)
- Hitting Forbidden Induced Subgraphs on Bounded Treewidth Graphs (Q5089257) (← links)
- (Q5092394) (← links)
- (Q5111296) (← links)
- Contraction-Bidimensionality of Geometric Intersection Graphs (Q5111864) (← links)
- Lower Bounds for Dynamic Programming on Planar Graphs of Bounded Cutwidth (Q5131225) (← links)
- Slightly Superexponential Parameterized Problems (Q5745079) (← links)
- Fine-Grained Complexity of the Graph Homomorphism Problem for Bounded-Treewidth Graphs (Q5858645) (← links)
- (Q5874546) (← links)
- (Q6068237) (← links)