Modification to Planarity is Fixed Parameter Tractable
From MaRDI portal
Publication:5090477
DOI10.4230/LIPIcs.STACS.2019.28OpenAlexW2934043480MaRDI QIDQ5090477
Fedor V. Fomin, Dimitrios M. Thilikos, Petr A. Golovach
Publication date: 18 July 2022
Full work available at URL: https://bora.uib.no/bora-xmlui/handle/1956/23373
Related Items (3)
Combing a Linkage in an Annulus ⋮ A survey of parameterized algorithms and the complexity of edge modification ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Chordal deletion is fixed-parameter tractable
- Graph minors. V. Excluding a planar graph
- Graph minors. XIII: The disjoint paths problem
- Obtaining planarity by contracting few edges
- Obtaining a planar graph by vertex deletion
- Hitting Forbidden Minors: Approximation and Kernelization
- Odd cycle packing
- Tight Bounds for Linkages in Planar Graphs
- (Meta) Kernelization
- Uniform Kernelization Complexity of Hitting Forbidden Minors
- The Induced Disjoint Paths Problem
- Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions
- Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes
- Planarity Allowing Few Error Vertices in Linear Time
- A Near-Optimal Planarization Algorithm
- Finding topological subgraphs is fixed-parameter tractable
- Parameterized Algorithms
- The Parameterized Complexity of Graph Cyclability
This page was built for publication: Modification to Planarity is Fixed Parameter Tractable
