The following pages link to Planar Separators (Q4296512):
Displaying 28 items.
- Approximation algorithms for cutting a convex polyhedron out of a sphere (Q388101) (← links)
- Cubic polyhedral Ramanujan graphs with face size no larger than six (Q535313) (← links)
- On graph thickness, geometric thickness, and separator theorems (Q621923) (← links)
- Theory and application of width bounded geometric separators (Q632801) (← links)
- Nested cycles in large triangulations and crossing-critical graphs (Q765192) (← links)
- Anticoloring of a family of grid graphs (Q937411) (← links)
- Anticoloring and separation of graphs (Q960942) (← links)
- Surface triangulations with isometric boundary (Q1339862) (← links)
- Generating irregular partitionable data structures (Q1575237) (← links)
- Spanners for geodesic graphs and visibility graphs (Q1709579) (← links)
- On the separation profile of infinite graphs (Q1932130) (← links)
- A crossing lemma for multigraphs (Q2189737) (← links)
- Treetopes and their graphs (Q2197683) (← links)
- Edge integrity of nearest neighbor graphs and separator theorems (Q2312806) (← links)
- The game of overprescribed Cops and Robbers played on graphs (Q2409518) (← links)
- Vulnerability of nearest neighbor graphs (Q2449104) (← links)
- Planar graph bipartization in linear time (Q2482113) (← links)
- A PTAS for a disc covering problem using width-bounded separators (Q2498985) (← links)
- The first order definability of graphs with separators via the Ehrenfeucht game (Q2570131) (← links)
- Bidimensionality and Kernels (Q3387764) (← links)
- MULTI-DIRECTIONAL WIDTH-BOUNDED GEOMETRIC SEPARATOR AND PROTEIN FOLDING (Q3607489) (← links)
- (Q4972036) (← links)
- A crossing lemma for multigraphs (Q5116525) (← links)
- (Q5158500) (← links)
- Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering (Q5885586) (← links)
- Vertex Fault-Tolerant Geometric Spanners for Weighted Points (Q6173263) (← links)
- Vertex fault-tolerant spanners for weighted points in polygonal domains (Q6174157) (← links)
- Counting cycles on planar graphs in subexponential time (Q6182684) (← links)
