A subexponential bound for linear programming
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Efficient probabilistically checkable proofs and applications to approximations
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
A near-linear algorithm for the planar 2-center problem
Proceedings of the twelfth annual symposium on Computational geometry
Rectilinear and polygonal p-piercing and p-center problems
Proceedings of the twelfth annual symposium on Computational geometry
On linear-time deterministic algorithms for optimization problems in fixed dimension
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Applying Parallel Computation Algorithms in the Design of Serial Algorithms
Journal of the ACM (JACM)
Rectilinear and polygonal p-piercing and p-center problems
Proceedings of the twelfth annual symposium on Computational geometry
Rectilinear p-piercing problems
ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
Efficient algorithms for geometric optimization
ACM Computing Surveys (CSUR)
On point covers of c-oriented polygons
Theoretical Computer Science
| Hi-index | 0.00 |