Pages that link to "Item:Q2275894"
From MaRDI portal
The following pages link to Contraction obstructions for treewidth (Q2275894):
Displayed 9 items.
- Beyond bidimensionality: parameterized subexponential algorithms on directed graphs (Q391650) (← links)
- On the parameterized complexity of the edge monitoring problem (Q509893) (← links)
- Parameterizing cut sets in a graph by the number of their components (Q653326) (← links)
- On the parameterized complexity of monotone and antimonotone weighted circuit satisfiability (Q1680511) (← links)
- A width parameter useful for chordal and co-comparability graphs (Q1680525) (← links)
- Graph Minors and Parameterized Algorithm Design (Q2908540) (← links)
- Large Induced Subgraphs via Triangulations and CMSO (Q2954371) (← links)
- To Approximate Treewidth, Use Treelength! (Q5741086) (← links)
- The Parameterized Complexity of Graph Cyclability (Q5891809) (← links)