Pages that link to "Item:Q5501962"
From MaRDI portal
The following pages link to Dynamic programming for graphs on surfaces (Q5501962):
Displayed 9 items.
- Contraction bidimensionality of geometric intersection graphs (Q832527) (← links)
- C-planarity testing of embedded clustered graphs with bounded dual carving-width (Q2041980) (← links)
- Hitting forbidden induced subgraphs on bounded treewidth graphs (Q2051840) (← links)
- How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs? (Q2324243) (← links)
- The role of planarity in connectivity problems parameterized by treewidth (Q2514121) (← links)
- A Fixed Parameter Tractable Approximation Scheme for the Optimal Cut Graph of a Surface (Q3452802) (← links)
- Hitting Forbidden Induced Subgraphs on Bounded Treewidth Graphs (Q5089257) (← links)
- Contraction-Bidimensionality of Geometric Intersection Graphs (Q5111864) (← links)
- Hitting Minors on Bounded Treewidth Graphs. I. General Upper Bounds (Q5130572) (← links)