On the angular resolution of planar graphs
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Separator based parallel divide and conquer in computational geometry
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Quality mesh generation in three dimensions
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
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
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Efficient parallel shortest-paths in digraphs with a separator decomposition
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
New graph decompositions and fast emulations in hypercubes and butterflies
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Faster shortest-path algorithms for planar graphs
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Parallel algorithms for forward and back substitution in direct solution of sparse linear systems
Supercomputing '95 Proceedings of the 1995 ACM/IEEE conference on Supercomputing
Disk packings and planar separators
Proceedings of the twelfth annual symposium on Computational geometry
ICS '96 Proceedings of the 10th international conference on Supercomputing
Separators for sphere-packings and nearest neighbor graphs
Journal of the ACM (JACM)
Parallel multilevel k-way partitioning scheme for irregular graphs
Supercomputing '96 Proceedings of the 1996 ACM/IEEE conference on Supercomputing
Multilevel algorithms for multi-constraint graph partitioning
SC '98 Proceedings of the 1998 ACM/IEEE conference on Supercomputing
An Efficient Path Computation Model for Hierarchically Structured Topographical Road Maps
IEEE Transactions on Knowledge and Data Engineering
A Scalable Approach to Balanced, High-Dimensional Clustering of Market-Baskets
HiPC '00 Proceedings of the 7th International Conference on High Performance Computing
Parallel Multilevel Graph Partitioning
IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
A Dynamic Algorithm for Maintaining Graph Partitions
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Well-separated pair decomposition for the unit-disk graph metric and its applications
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
ICPP '00 Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing
An efficient 3D grid based scheduling for heterogeneous systems
Journal of Parallel and Distributed Computing - Special section best papers from the 2002 international parallel and distributed processing symposium
Wireless sensor network aided search and rescue in trails
Proceedings of the 2nd international conference on Scalable information systems
MPIWiz: subgroup reproducible replay of mpi applications
Proceedings of the 14th ACM SIGPLAN symposium on Principles and practice of parallel programming
Improved sublinear time algorithm for width-bounded separators
FAW'10 Proceedings of the 4th international conference on Frontiers in algorithmics
Hierarchical Diagonal Blocking and Precision Reduction Applied to Combinatorial Multigrid
Proceedings of the 2010 ACM/IEEE International Conference for High Performance Computing, Networking, Storage and Analysis
Theory and application of width bounded geometric separators
Journal of Computer and System Sciences
Theory and application of width bounded geometric separator
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
A PTAS for a disc covering problem using width-bounded separators
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
An unbalanced partitioning scheme for graph in heterogeneous computing
GCC'05 Proceedings of the 4th international conference on Grid and Cooperative Computing
Approximate distance queries in disk graphs
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
A Deterministic Linear Time Algorithm For Geometric Separators And Its Applications
Fundamenta Informaticae
Scalable parallel graph partitioning
SC '13 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis
| Hi-index | 0.00 |
A class of graphs called k-overlap graphs is proposed. Special cases of k-overlap graphs include planar graphs, k-nearest neighbor graphs, and earlier classes of graphs associated with finite element methods. A separator bound is proved for k-overlap graphs embedded in d dimensions. The result unifies several earlier separator results. All the arguments are based on geometric properties of embedding. The separator bounds come with randomized linear-time and randomized NC algorithms. Moreover, the bounds are the best possible up to the leading term.