Recommendations
Cited in
(52)- Finding small simple cycle separators for 2-connected planar graphs
- Not all planar digraphs have small cycle separators
- Separators in graphs with negative and multiple vertex weights
- Surface triangulations with isometric boundary
- Generating irregular partitionable data structures
- Spanners for geodesic graphs and visibility graphs
- Reduced constants for simple cycle graph separation
- On the separation profile of infinite graphs
- A crossing lemma for multigraphs
- Treetopes and their graphs
- On 3-pushdown graphs with large separators
- Edge integrity of nearest neighbor graphs and separator theorems
- The game of overprescribed Cops and Robbers played on graphs
- Vulnerability of nearest neighbor graphs
- Planar graph bipartization in linear time
- A PTAS for a disc covering problem using width-bounded separators
- The first order definability of graphs with separators via the Ehrenfeucht game
- On the path separability of planar graphs
- Bidimensionality and kernels
- A Heuristic Algorithm for Small Separators in Arbitrary Graphs
- MULTI-DIRECTIONAL WIDTH-BOUNDED GEOMETRIC SEPARATOR AND PROTEIN FOLDING
- I/O-Efficient Planar Separators
- scientific article; zbMATH DE number 4064516 (Why is no real title available?)
- scientific article; zbMATH DE number 4101213 (Why is no real title available?)
- Approximation algorithms for cutting a convex polyhedron out of a sphere
- Planar Crossovers
- A Separator Theorem for Nonplanar Graphs
- scientific article; zbMATH DE number 4127226 (Why is no real title available?)
- PLANAR LACES
- scientific article; zbMATH DE number 1979709 (Why is no real title available?)
- Coverability and sub-exponential parameterized algorithms in planar graphs
- A crossing lemma for multigraphs
- Almost polynomial hardness of node-disjoint paths in grids
- NP-completeness of the Planar Separator Problems
- Cubic polyhedral Ramanujan graphs with face size no larger than six
- Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering
- Counting cycles on planar graphs in subexponential time
- Non-existence of annular separators in geometric graphs
- Vertex Fault-Tolerant Geometric Spanners for Weighted Points
- Vertex fault-tolerant spanners for weighted points in polygonal domains
- Counting cycles on planar graphs in subexponential time
- On graph thickness, geometric thickness, and separator theorems
- Theory and application of width bounded geometric separators
- \(N\)-separators in planar graphs
- Drawn tree decomposition: new approach for graph drawing problems
- Nested cycles in large triangulations and crossing-critical graphs
- Space efficient separator algorithms for planar graphs
- Weighted graph separators and their applications
- On cleaving a planar graph
- Anticoloring of a family of grid graphs
- Separator theorems and Turán-type results for planar intersection graphs
- Anticoloring and separation of graphs
This page was built for publication: Planar Separators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4296512)
