A separator theorem for graphs of bounded genus
Journal of Algorithms
Computational geometry: an introduction
Computational geometry: an introduction
Algorithms in combinatorial geometry
Algorithms in combinatorial geometry
Sphere-packings, lattices, and groups
Sphere-packings, lattices, and groups
Small sets supporting fary embeddings of planar graphs
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Introduction to algorithms
A separator theorem for graphs with an excluded minor and its applications
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Separators in two and three dimensions
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Automatic domain partitioning in three dimensions
SIAM Journal on Scientific and Statistical Computing
A unified geometric approach to graph separators
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Separator based parallel divide and conquer in computational geometry
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Points, spheres, and separators: a unified geometric approach to graph partitioning
Points, spheres, and separators: a unified geometric approach to graph partitioning
Approximating center points with iterated radon points
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
A deterministic linear time algorithm for geometric separators and its applications
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Disk packings and planar separators
Proceedings of the twelfth annual symposium on Computational geometry
Geometric Separators for Finite-Element Meshes
SIAM Journal on Scientific Computing
Geometric Mesh Partitioning: Implementation and Experiments
SIAM Journal on Scientific Computing
Shallow excluded minors and improved graph decompositions
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Multidimensional divide-and-conquer
Communications of the ACM
Area-Efficient VLSI Computation
Area-Efficient VLSI Computation
Spectral Partitioning Works: Planar Graphs and Finite Element Meshes
Spectral Partitioning Works: Planar Graphs and Finite Element Meshes
Dense point sets have sparse Delaunay triangulations: or "…but not too nasty"
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Compact representations of separable graphs
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Towards a Predictive Computational Complexity Theory
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Min-Max-Boundary Domain Decomposition
COCOON '98 Proceedings of the 4th Annual International Conference on Computing and Combinatorics
Constant factor approximation of vertex-cuts in planar graphs
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Polynomial-time approximation schemes for packing and piercing fat objects
Journal of Algorithms
Polynomial Vicinity Circuits and Nonlinear Lower Bounds
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Testing bipartiteness of geometric intersection graphs
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Improved approximation algorithms for minimum-weight vertex separators
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Dictionaries using variable-length keys and data, with applications
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
A Tree-Decomposition Approach to Protein Structure Prediction
CSB '05 Proceedings of the 2005 IEEE Computational Systems Bioinformatics Conference
Tight bounds for the Min-Max boundary decomposition cost of weighted graphs
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Fast and accurate algorithms for protein side-chain packing
Journal of the ACM (JACM)
Fast Agglomerative Clustering Using a k-Nearest Neighbor Graph
IEEE Transactions on Pattern Analysis and Machine Intelligence
Partitioning planar graphs with costs and weights
Journal of Experimental Algorithmics (JEA)
An optimal generalization of the centerpoint theorem, and its extensions
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
Graph algorithms for biological systems analysis
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Compact dictionaries for variable-length keys and data with applications
ACM Transactions on Algorithms (TALG)
Markov incremental constructions
Proceedings of the twenty-fourth annual symposium on Computational geometry
Coloring kk-free intersection graphs of geometric objects in the plane
Proceedings of the twenty-fourth annual symposium on Computational geometry
Studying (non-planar) road networks through an algorithmic lens
Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems
Linear-time algorithms for geometric graphs with sublinearly many crossings
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Testing bipartiteness of geometric intersection graphs
ACM Transactions on Algorithms (TALG)
A Separator Theorem for String Graphs and Its Applications
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
Theoretical Computer Science
An optimal extension of the centerpoint theorem
Computational Geometry: Theory and Applications
A linear-time algorithm to find a separator in a graph excluding a minor
ACM Transactions on Algorithms (TALG)
Eigenvalue bounds, spectral partitioning, and metrical deformations via flows
Journal of the ACM (JACM)
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
On the complexity of approximation streaming algorithms for the k-center problem
FAW'07 Proceedings of the 1st annual international conference on Frontiers in algorithmics
Centerpoints and Tverberg's technique
Computational Geometry: Theory and Applications
Domination in geometric intersection graphs
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
New constructions of SSPDs and their applications
Proceedings of the twenty-sixth annual symposium on Computational geometry
A separator theorem for string graphs and its applications
Combinatorics, Probability and Computing
Succinct representations of separable graphs
CPM'10 Proceedings of the 21st annual conference on Combinatorial pattern matching
Delaunay triangulations in O(sort(n)) time and more
Journal of the ACM (JACM)
Tracking moving objects with few handovers
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Edge Crossings
SIAM Journal on Computing
Bidimensionality and geometric graphs
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Better approximation schemes for disk graphs
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Multi-directional width-bounded geometric separator and protein folding
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Computing the independence number of intersection graphs
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Coloring Kk-free intersection graphs of geometric objects in the plane
European Journal of Combinatorics
New constructions of SSPDs and their applications
Computational Geometry: Theory and Applications
The laplacian paradigm: emerging algorithms for massive graphs
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Rapid protein side-chain packing via tree decomposition
RECOMB'05 Proceedings of the 9th Annual international conference on Research in Computational Molecular Biology
A massively parallel adaptive fast multipole method on heterogeneous architectures
Communications of the ACM
Competitive query strategies for minimising the ply of the potential locations of moving points
Proceedings of the twenty-ninth annual symposium on Computational geometry
Hi-index | 0.02 |
A collection of n balls in d dimensions forms a k-ply system if no point in the space is covered by more than k balls. We show that for every k-ply system &Ggr;, there is a sphere S that intersects at most O(k1/dn1−1/d) balls of &Ggr; and divides the remainder of &Ggr; into two parts: those in the interior and those in the exterior of the sphere S, respectively, so that the larger part contains at most (1−1/(d+2))n balls. This bound of (O(k1/dn1−1/d) is the best possible in both n and k. We also present a simple randomized algorithm to find such a sphere in O(n) time. Our result implies that every k-nearest neighbor graphs of n points in d dimensions has a separator of size O(k1/dn1−1/d). In conjunction with a result of Koebe that every triangulated planar graph is isomorphic to the intersection graph of a disk-packing, our result not only gives a new geometric proof of the planar separator theorem of Lipton and Tarjan, but also generalizes it to higher dimensions. The separator algorithm can be used for point location and geometric divide and conquer in a fixed dimensional space.