Separators for sphere-packings and nearest neighbor graphs
From MaRDI portal
Recommendations
Cited in
(77)- Combinatorial and spectral aspects of nearest neighbor graphs in doubling dimensional and nearly-Euclidean spaces
- On the complexity of barrier resilience for fat regions and bounded ply
- Simple polytopes without small separators. II: Thurston's bound
- Simple polytopes without small separators
- PTAS for \(\mathcal{H}\)-free node deletion problems in disk graphs
- Poincaré profiles of groups and spaces
- Notes on graph product structure theory
- Upper eigenvalue bounds for the Kirchhoff Laplacian on embedded metric graphs
- A tight analysis of geometric local search
- Smaller extended formulations for spanning tree polytopes in minor-closed classes and beyond
- Contact graphs of ball packings
- Minimum vertex cover in ball graphs through local search
- Subexponential algorithms for variants of the homomorphism problem in string graphs
- Edge integrity of nearest neighbor graphs and separator theorems
- Distance geometry for kissing spheres
- Scribability problems for polytopes
- Space saving by dynamic algebraization based on tree-depth
- Vulnerability of nearest neighbor graphs
- Discussion about properties of first nearest neighbor graphs
- Minimizing co-location potential of moving entities
- Parallel algorithms for nearest neighbor search problems in high dimensions
- Six topics on inscribable polytopes
- A fast, memory efficient and robust sparse preconditioner based on a multifrontal approach with applications to finite-element matrices
- A separator theorem for string graphs and its applications
- Apollonian ball packings and stacked polytopes
- A Glimpse into Thurston’s Work
- Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs
- \(k\)-centerpoints conjectures for pointsets in \(\mathbb{R}^d\)
- A Separator Theorem for String Graphs and Its Applications
- Small strong epsilon nets
- Coloring \(K_{k}\)-free intersection graphs of geometric objects in the plane
- New constructions of SSPDs and their applications
- scientific article; zbMATH DE number 741006 (Why is no real title available?)
- Geometric Separators for Finite-Element Meshes
- Provably Good Partitioning and Load Balancing Algorithms for Parallel Adaptive N-Body Simulation
- Approximation algorithms for polynomial-expansion and low-density graphs
- Network essence: PageRank completion and centrality-conforming Markov chains
- Separators in region intersection graphs
- COMPACT REPRESENTATIONS OF SIMPLICIAL MESHES IN TWO AND THREE DIMENSIONS
- On strong centerpoints
- Inference for misspecified models with fixed regressors
- Sublinear separators in intersection graphs of convex shapes
- Dynamic effective resistances and approximate Schur complement on separable graphs
- A dynamic separator algorithm
- Optimality of geometric local search
- Graph-based time-space trade-offs for approximate near neighbors
- Ramsey numbers of cubes versus cliques
- On the exact complexity of Hamiltonian Cycle and \(q\)-Colouring in disk graphs
- Domination in Geometric Intersection Graphs
- scientific article; zbMATH DE number 7053376 (Why is no real title available?)
- scientific article; zbMATH DE number 7650083 (Why is no real title available?)
- Balanced line separators of unit disk graphs
- Min-max-boundary domain decomposition
- Conical equipartitions of mass distributions
- Computing list homomorphisms in geometric intersection graphs
- Maximum matchings in geometric intersection graphs
- On weighted sublinear separators
- Clique-based separators for geometric intersection graphs
- Non-existence of annular separators in geometric graphs
- A note on reachability and distance oracles for transmission graphs
- Space-efficient graph coarsening with applications to succinct planar encodings
- Recognition and proper coloring of unit segment intersection graphs
- Product structure of graph classes with strongly sublinear separators
- A survey of degree-boundedness
- Greedy spanners in Euclidean spaces admit sublinear separators
- Shortest path separators in unit disk graphs
- Unimodular hyperbolic triangulations: circle packing and random walk
- Clustered independence and bounded treewidth
- Structure and independence in hyperbolic uniform disk graphs
- Strongly sublinear separators and bounded asymptotic dimension for sphere intersection graphs
- Embedding graphs as Euclidean kNN-graphs
- Sublinear hitting sets for some geometric graphs
- Diamond-kite meshes: adaptive quadrilateral meshing and orthogonal circle packing
- Spectral partitioning works: planar graphs and finite element meshes
- An optimal extension of the centerpoint theorem
- Separator theorems and Turán-type results for planar intersection graphs
- Centerpoints and Tverberg's technique
This page was built for publication: Separators for sphere-packings and nearest neighbor graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4371696)