Modification to Planarity is Fixed Parameter Tractable
From MaRDI portal
Publication:5090477
DOI10.4230/LIPICS.STACS.2019.28OpenAlexW2934043480MaRDI QIDQ5090477FDOQ5090477
Authors: Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos 
Publication date: 18 July 2022
Full work available at URL: https://bora.uib.no/bora-xmlui/handle/1956/23373
Recommendations
Cites Work
- Graph minors. XIII: The disjoint paths problem
- Parameterized algorithms
- Graph minors. V. Excluding a planar graph
- Odd cycle packing
- Chordal deletion is fixed-parameter tractable
- Hitting forbidden minors: approximation and kernelization
- Tight bounds for linkages in planar graphs
- Finding topological subgraphs is fixed-parameter tractable
- Obtaining planarity by contracting few edges
- The Induced Disjoint Paths Problem
- Obtaining a planar graph by vertex deletion
- Title not available (Why is that?)
- (Meta) kernelization
- A near-optimal planarization algorithm
- Optimal algorithms for hitting (topological) minors on graphs of bounded treewidth
- Linear kernels for edge deletion problems to immersion-closed graph classes
- Planarity Allowing Few Error Vertices in Linear Time
- FPT algorithms for plane completion problems
Cited In (6)
- A more accurate view of the flat wall theorem
- A survey of parameterized algorithms and the complexity of edge modification
- An algorithmic meta-theorem for graph modification to planarity and FOL
- Combing a Linkage in an Annulus
- Lossy planarization: a constant-factor approximate kernelization for planar vertex deletion
- Computing paths of large rank in planar frameworks deterministically
This page was built for publication: Modification to Planarity is Fixed Parameter Tractable
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5090477)
