Pages that link to "Item:Q2275894"
From MaRDI portal
The following pages link to Contraction obstructions for treewidth (Q2275894):
Displaying 25 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)
- Contraction bidimensionality of geometric intersection graphs (Q832527) (← 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)
- Explicit linear kernels for packing problems (Q1739112) (← links)
- On the tree-width of even-hole-free graphs (Q1979431) (← links)
- Succinct monotone circuit certification: planarity and parameterized complexity (Q2019496) (← links)
- Energy complexity of satisfying assignments in monotone circuits: on the complexity of computing the best case (Q2151382) (← links)
- Succinct certification of monotone circuits (Q2232601) (← links)
- Computing the best-case energy complexity of satisfying assignments in monotone circuits (Q2674710) (← links)
- Grid induced minor theorem for graphs of small degree (Q2692786) (← links)
- Graph Minors and Parameterized Algorithm Design (Q2908540) (← links)
- Large Induced Subgraphs via Triangulations and CMSO (Q2954371) (← links)
- Bidimensionality and Kernels (Q3387764) (← links)
- (Q4972036) (← links)
- Treewidth versus Clique Number. I. Graph Classes with a Forbidden Structure (Q5013568) (← links)
- (Q5028434) (← links)
- A Retrospective on (Meta) Kernelization (Q5042460) (← links)
- Contraction-Bidimensionality of Geometric Intersection Graphs (Q5111864) (← links)
- To Approximate Treewidth, Use Treelength! (Q5741086) (← links)
- (Q5743379) (← links)
- (Q5874521) (← links)
- The Parameterized Complexity of Graph Cyclability (Q5891809) (← links)
