Pages that link to "Item:Q2429328"
From MaRDI portal
The following pages link to Obtaining a planar graph by vertex deletion (Q2429328):
Displaying 28 items.
- Parameterized complexity of vertex deletion into perfect graph classes (Q392038) (← links)
- Parameterized complexity of finding connected induced subgraphs (Q897959) (← links)
- Sublinear approximation algorithms for boxicity and related problems (Q1693125) (← links)
- The critical node detection problem in networks: a survey (Q1750314) (← links)
- Proper interval vertex deletion (Q1949742) (← links)
- Improved kernel and algorithm for claw and diamond free edge deletion based on refined observations (Q2077398) (← links)
- All minor-minimal apex obstructions with connectivity two (Q2223478) (← links)
- Deleting vertices to graphs of bounded genus (Q2319638) (← links)
- Modifying a graph using vertex elimination (Q2345941) (← links)
- Faster parameterized algorithms for deletion to split graphs (Q2350905) (← links)
- A tight lower bound for vertex planarization on graphs of bounded treewidth (Q2403808) (← links)
- Contracting graphs to paths and trees (Q2441588) (← links)
- A faster FPT algorithm for bipartite contraction (Q2445333) (← links)
- Graph Minors and Parameterized Algorithm Design (Q2908540) (← links)
- What’s Next? Future Directions in Parameterized Complexity (Q2908548) (← links)
- (Q5075776) (← links)
- Modification to Planarity is Fixed Parameter Tractable (Q5090477) (← links)
- A deterministic polynomial kernel for odd cycle transversal and vertex multiway cut in planar graphs (Q5090489) (← links)
- A Deterministic Polynomial Kernel for Odd Cycle Transversal and Vertex Multiway Cut in Planar Graphs (Q5163509) (← links)
- (Q5874521) (← links)
- Quadratic vertex kernel for split vertex deletion (Q5896158) (← links)
- \(k\)-apices of minor-closed graph classes. I: Bounding the obstructions (Q6038588) (← links)
- Combing a Linkage in an Annulus (Q6057804) (← links)
- Faster parameterized algorithms for modification problems to minor-closed classes (Q6601299) (← links)
- A more accurate view of the flat wall theorem (Q6606321) (← links)
- Splitting plane graphs to outerplanarity (Q6636997) (← links)
- Computing paths of large rank in planar frameworks deterministically (Q6668350) (← links)
- Lossy planarization: a constant-factor approximate kernelization for planar vertex deletion (Q6670351) (← links)
