Strongly polynomial-time and NC algorithms for detecting cycles in dynamic graphs
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
A compendium of key search references
ACM SIGIR Forum
Optimal algorithms for some smallest intersection radius problems (extended abstract)
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Transitions in geometric minimum spanning trees (extended abstract)
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
A deterministic poly(log log N)-time N-processor algorithm for linear programming in fixed dimension
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
A subexponential randomized simplex algorithm (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Separation and approximation of polyhedral objects
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
A subexponential bound for linear programming
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Strongly polynomial-time and NC algorithms for detecting cycles in periodic graphs
Journal of the ACM (JACM)
Parallel linear programming in fixed dimension almost surely in constant time
Journal of the ACM (JACM)
Computational geometry: a retrospective
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Las Vegas algorithms for linear and integer programming when the dimension is small
Journal of the ACM (JACM)
A survey of linear programming in randomized subexponential time
ACM SIGACT News
A parallel algorithm for linear programming in fixed dimension
Proceedings of the eleventh annual symposium on Computational geometry
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Efficient algorithms for geometric optimization
ACM Computing Surveys (CSUR)
On linear-time deterministic algorithms for optimization problems in fixed dimension
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Fixed-dimensional parallel linear programming via relative &egr;-approximations
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Efficient approximation and optimization algorithms for computational metrology
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Using separation algorithms in fixed dimension
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Approximating the diameter, width, smallest enclosing cylinder, and minimum-width annulus
Proceedings of the sixteenth annual symposium on Computational geometry
Explicit and implicit enforcing: randomized optimization
Computational Discrete Mathematics
Computing Weighted Rectilinear Median and Center Set in the Presence of Obstacles
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Irregularities of Distribution, Derandomization, and Complexity Theory
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
Decomposable multi-parameter matroid optimization problems
Theoretical Computer Science - Latin American theoretical informatics
Building bridges between convex regions
Computational Geometry: Theory and Applications - Special issue: The European workshop on computational geometry -- CG01
A linear time algorithm for the weighted lexicographic rectilinear 1-center problem in the plane
Information Processing Letters
A simple linear algorithm for computing rectilinear 3-centers
Computational Geometry: Theory and Applications - Special issue: The 11th Candian conference on computational geometry - CCCG 99
Minimal Ellipsoid Circumscribing a Polytope Defined by a System of Linear Inequalities
Journal of Global Optimization
Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs
Proceedings of the twenty-fourth annual symposium on Computational geometry
Multi-dimensional dynamic facility location and fast computation at query points
Information Processing Letters
A simple linear algorithm for computing rectilinear 3-centers
Computational Geometry: Theory and Applications - Special issue: The 11th Candian conference on computational geometry - CCCG 99
New algorithms for 1-D facility location and path equipartition problems
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Facility location problems with uncertainty on the plane
Discrete Optimization
Linear time algorithms for some separable quadratic programming problems
Operations Research Letters
Minimizing ordered weighted averaging of rational functions with applications to continuous location
Computers and Operations Research
Hi-index | 0.00 |