Pages that link to "Item:Q4371696"
From MaRDI portal
The following pages link to Separators for sphere-packings and nearest neighbor graphs (Q4371696):
Displaying 47 items.
- Apollonian ball packings and stacked polytopes (Q309645) (← links)
- Small strong epsilon nets (Q396471) (← links)
- Coloring \(K_{k}\)-free intersection graphs of geometric objects in the plane (Q412277) (← links)
- New constructions of SSPDs and their applications (Q419372) (← links)
- On strong centerpoints (Q483053) (← links)
- Ramsey numbers of cubes versus cliques (Q519968) (← links)
- Unimodular hyperbolic triangulations: circle packing and random walk (Q730189) (← links)
- Spectral partitioning works: planar graphs and finite element meshes (Q869898) (← links)
- An optimal extension of the centerpoint theorem (Q924064) (← links)
- Separator theorems and Turán-type results for planar intersection graphs (Q947779) (← links)
- Centerpoints and Tverberg's technique (Q982949) (← links)
- Combinatorial and spectral aspects of nearest neighbor graphs in doubling dimensional and nearly-Euclidean spaces (Q1007250) (← links)
- On the complexity of barrier resilience for fat regions and bounded ply (Q1615674) (← links)
- Simple polytopes without small separators. II: Thurston's bound (Q1618117) (← links)
- Simple polytopes without small separators (Q1678493) (← links)
- PTAS for \(\mathcal{H}\)-free node deletion problems in disk graphs (Q1706122) (← links)
- Poincaré profiles of groups and spaces (Q1998684) (← links)
- Notes on graph product structure theory (Q2058955) (← links)
- Upper eigenvalue bounds for the Kirchhoff Laplacian on embedded metric graphs (Q2078948) (← links)
- A tight analysis of geometric local search (Q2117344) (← links)
- Smaller extended formulations for spanning tree polytopes in minor-closed classes and beyond (Q2121739) (← links)
- Contact graphs of ball packings (Q2200926) (← links)
- Minimum vertex cover in ball graphs through local search (Q2250102) (← links)
- Computing the center region and its variants (Q2272371) (← links)
- Subexponential algorithms for variants of the homomorphism problem in string graphs (Q2301363) (← links)
- Edge integrity of nearest neighbor graphs and separator theorems (Q2312806) (← links)
- Distance geometry for kissing spheres (Q2348019) (← links)
- Scribability problems for polytopes (Q2359975) (← links)
- Space saving by dynamic algebraization based on tree-depth (Q2411033) (← links)
- Vulnerability of nearest neighbor graphs (Q2449104) (← links)
- Discussion about properties of first nearest neighbor graphs (Q2700050) (← links)
- Minimizing Co-location Potential of Moving Entities (Q2829447) (← links)
- Parallel Algorithms for Nearest Neighbor Search Problems in High Dimensions (Q2830635) (← links)
- Six Topics on Inscribable Polytopes (Q2832782) (← links)
- A fast, memory efficient and robust sparse preconditioner based on a multifrontal approach with applications to finite‐element matrices (Q2952959) (← links)
- A Separator Theorem for String Graphs and its Applications (Q3058296) (← links)
- A Glimpse into Thurston’s Work (Q3384092) (← links)
- Separators in region intersection graphs (Q4638049) (← links)
- (Q5009600) (← links)
- (Q5115816) (← links)
- (Q5115825) (← links)
- (Q5875468) (← links)
- Maximum matchings in geometric intersection graphs (Q6050213) (← links)
- On weighted sublinear separators (Q6081561) (← links)
- Clique-based separators for geometric intersection graphs (Q6103521) (← links)
- Non-existence of annular separators in geometric graphs (Q6151030) (← links)
- (Q6179341) (← links)
