A near-optimal planarization algorithm
From MaRDI portal
Recommendations
Cited in
(60)- Paths to trees and cacti
- Hitting forbidden induced subgraphs on bounded treewidth graphs
- Faster FPT algorithms for deletion to pairs of graph classes
- Distance from triviality 2.0: hybrid parameterizations
- Hitting minors on bounded treewidth graphs. III. Lower bounds
- Deleting vertices to graphs of bounded genus
- A tight lower bound for vertex planarization on graphs of bounded treewidth
- Hitting forbidden subgraphs in graphs of bounded treewidth
- Experiments with the Fixed-Parameter Approach for Two-Layer Planarization
- Linear time parameterized algorithms for subset feedback vertex set
- How to Use Planarity Efficiently: New Tree-Decomposition Based Algorithms
- Obtaining a Planar Graph by Vertex Deletion
- scientific article; zbMATH DE number 3965443 (Why is no real title available?)
- Bijective comparison of optimal planarity algorithms
- scientific article; zbMATH DE number 1445286 (Why is no real title available?)
- scientific article; zbMATH DE number 7525474 (Why is no real title available?)
- Hitting forbidden induced subgraphs on bounded treewidth graphs
- Modification to Planarity is Fixed Parameter Tractable
- A deterministic polynomial kernel for odd cycle transversal and vertex multiway cut in planar graphs
- A Linear-Time Parameterized Algorithm for Node Unique Label Cover
- Optimal algorithms for hitting (topological) minors on graphs of bounded treewidth
- Hitting minors on bounded treewidth graphs. I: General upper bounds
- scientific article; zbMATH DE number 7278081 (Why is no real title available?)
- A Deterministic Polynomial Kernel for Odd Cycle Transversal and Vertex Multiway Cut in Planar Graphs
- A fully dynamic algorithm for planar
- The design and implementation of panar maps in CGAL
- An algorithmic meta-theorem for graph modification to planarity and FOL
- Graph Drawing
- k-apices of minor-closed graph classes. I: Bounding the obstructions
- Polynomial Kernel for Interval Vertex Deletion
- Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable
- Lossy planarization: a constant-factor approximate kernelization for planar vertex deletion
- Deletion to scattered graph classes. II: Improved FPT algorithms for deletion to pairs of graph classes
- Hitting Minors on Bounded Treewidth Graphs. IV. An Optimal Algorithm
- Planarizing graphs and their drawings by vertex splitting
- Recognizing map graphs of bounded treewidth
- Parameterized Complexity of Vertex Splitting to Pathwidth at Most 1
- Faster parameterized algorithms for modification problems to minor-closed classes
- Parameterized complexity of vertex splitting to pathwidth at most 1
- Lossy planarization: a constant-factor approximate kernelization for planar vertex deletion
- An FPT-algorithm for recognizing k-apices of minor-closed graph classes
- When recursion is better than iteration: a linear-time algorithm for directed acyclicity with few error vertices
- Eliminating crossings in ordered graphs
- Decremental sensitivity oracles for covering and packing minors
- Tight bounds for chordal/interval vertex deletion parameterized by treewidth
- An exponential time parameterized algorithm for planar disjoint paths
- An algorithmic meta-theorem for graph modification to planarity and FOL
- Compound logics for modification problems
- Tree decompositions meet induced matchings: beyond max weight independent set
- Parameterized dynamic data structure for split completion
- Uniform polynomial kernel for deletion to \(K_{2,p}\) minor-free graphs
- Does subset sum admit short proofs?
- Outer-planar vertex deletion on AT-free graphs
- Tree decompositions meet induced matchings: beyond max weight independent set
- Kernelization in almost linear time for clustering into bounded vertex cover components
- Graph modification of bounded size to minor-closed classes as fast as vertex deletion
- A unified FPT framework for crossing number problems
- Going beyond surfaces in diameter approximation
- Sparse induced subgraphs in P₇-Free graphs of bounded clique number
- A single-exponential FPT algorithm for the \(K_4\)-\textsc{minor cover} problem
This page was built for publication: A near-optimal planarization algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5384092)
