Pages that link to "Item:Q2403808"
From MaRDI portal
The following pages link to A tight lower bound for vertex planarization on graphs of bounded treewidth (Q2403808):
Displaying 11 items.
- Hitting forbidden induced subgraphs on bounded treewidth graphs (Q2051840) (← links)
- Orthogonal planarity testing of bounded treewidth graphs (Q2071827) (← links)
- Hitting minors on bounded treewidth graphs. III. Lower bounds (Q2301360) (← links)
- Deleting vertices to graphs of bounded genus (Q2319638) (← links)
- The role of planarity in connectivity problems parameterized by treewidth (Q2514121) (← links)
- (Q4639989) (← links)
- Tight Running Time Lower Bounds for Vertex Deletion Problems (Q4973874) (← links)
- Hitting Forbidden Induced Subgraphs on Bounded Treewidth Graphs (Q5089257) (← links)
- (Q5111863) (← links)
- Hitting Minors on Bounded Treewidth Graphs. I. General Upper Bounds (Q5130572) (← links)
- Hitting Minors on Bounded Treewidth Graphs. IV. An Optimal Algorithm (Q6115414) (← links)