Efficient Computation of the Maximum of the Sum of Two Sequences and Applications
IEEE Transactions on Computers
An Array Layout Methodology for VLSI Circuits
IEEE Transactions on Computers
A probabilistic algorithm for the post office problem
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
A fast planar partition algorithm, II
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
SCG '85 Proceedings of the first annual symposium on Computational geometry
On k-Nearest Neighbor Voronoi Diagrams in the Plane
IEEE Transactions on Computers
Universality considerations in VLSI circuits
IEEE Transactions on Computers
A static optimality transformation with applications to planar point location
Proceedings of the twenty-seventh annual symposium on Computational geometry
| Hi-index | 0.01 |
Any n-vertex planar graph has the property that it can be divided into components of roughly equal size by removing only O(√n) vertices. This separator theorem, in combination with a divide-and-conquer strategy, leads to many new complexity results for planar graph problems. This paper describes some of these results.