Strongly sublinear separators and bounded asymptotic dimension for sphere intersection graphs
From MaRDI portal
Cites work
- A framework for exponential-time-hypothesis-tight algorithms and lower bounds in geometric intersection graphs
- A semi-algebraic version of Zarankiewicz's problem
- A Separator Theorem for Planar Graphs
- A separator theorem for string graphs and its applications
- An ETH-Tight Exact Algorithm for Euclidean TSP
- Applications of a Planar Separator Theorem
- Approximation algorithms for polynomial-expansion and low-density graphs
- Asymptotic dimension of intersection graphs
- Asymptotic dimension of minor-closed families and Assouad-Nagata dimension of surfaces
- Asymptotic dimension of planes and planar graphs
- Better bounds for poset dimension and boxicity
- Boxicity and topological invariants
- Circle graph obstructions
- Clique-based separators for geometric intersection graphs
- Constant approximation algorithms for embedding graph metrics into trees and outerplanar graphs
- Fixed points, Koebe uniformization and circle packings
- Geodesic spaces of low Nagata dimension
- Geometric representation of graphs in low dimension using axis parallel boxes
- Geometric separator theorems and applications
- Harmonic functions on planar and almost planar graphs and manifolds, via circle packings
- scientific article; zbMATH DE number 1003278 (Why is no real title available?)
- scientific article; zbMATH DE number 4091559 (Why is no real title available?)
- scientific article; zbMATH DE number 16297 (Why is no real title available?)
- scientific article; zbMATH DE number 3307331 (Why is no real title available?)
- scientific article; zbMATH DE number 3323729 (Why is no real title available?)
- scientific article; zbMATH DE number 3027510 (Why is no real title available?)
- Lack of sphere packing of graphs via nonlinear potential theory
- Near-optimal separators in string graphs
- On a problem of K. Zarankiewicz
- On the chromatic number of multiple interval graphs and overlap graphs
- Reconnaissance des graphes de cordes
- Separator theorem and algorithms for planar hyperbolic graphs
- Separators for sphere-packings and nearest neighbor graphs
- Separators in region intersection graphs
- Space graphs and sphericity
- Sparse covers for planar graphs and graphs that exclude a fixed minor
- Strongly sublinear separators and polynomial expansion
- Structural results on circular-arc graphs and circle graphs: a survey and the main open problems
- Sublinear separators in intersection graphs of convex shapes
- The Novikov conjecture for groups with finite asymptotic dimension
- Universal approximations for TSP, Steiner tree, and set cover
- Weak Coloring Numbers of Intersection Graphs
- Weak diameter coloring of graphs on surfaces
This page was built for publication: Strongly sublinear separators and bounded asymptotic dimension for sphere intersection graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7312682)
