Slowing down sorting networks to obtain faster sorting algorithms
Journal of the ACM (JACM)
An improved algorithm for constructing kth-order voronoi diagrams
IEEE Transactions on Computers
A Bibliography on Digital and Computational Convexity (1961-1988)
IEEE Transactions on Pattern Analysis and Machine Intelligence
The complexity of many faces in arrangements of lines of segments
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Algorithms for vertical and orthogonal L1 linear approximation of points
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Maintenance of geometric extrema ∈
Journal of the ACM (JACM)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Diameter, width, closest line pair, and parametric searching
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
An optimal algorithm for the (≤ k)-levels, with applications to separation and transversal problems
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Geometric partitioning made easier, even in parallel
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Computing a centerpoint of a finite planar set of points in linear time
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Approximating center points with iterated radon points
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Dehn-Sommerville relations, upper bound theorem, and levels in arrangements
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Constructing levels in arrangements and higher order Voronoi diagrams
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Cutting dense point sets in half
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
On geometric optimization with few violated constraints
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Computational geometry: a retrospective
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
ACM Computing Surveys (CSUR)
New lower bounds for Hopcroft's problem
Proceedings of the eleventh annual symposium on Computational geometry
Efficient algorithms for geometric optimization
ACM Computing Surveys (CSUR)
Parametric polymatroid optimization and its geometric applications
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the sixteenth annual symposium on Computational geometry
An improved bound for k-sets in three dimensions
Proceedings of the sixteenth annual symposium on Computational geometry
An optimal algorithm for hyperplane depth in the plane
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms for layered manufacturing
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Fast implementation of depth contours using topological sweep
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Notes on computing peaks in k-levels and parametric spanning trees
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Hardware-assisted computation of depth contours
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
On the ordinary line problem in computational geometry
Nordic Journal of Computing
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
An optimal randomized algorithm for maximum Tukey depth
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
The interface between computational and combinatorial geometry
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Robust shape fitting via peeling and grating coresets
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Point set stratification and Delaunay depth
Computational Statistics & Data Analysis
Algorithms for bivariate zonoid depth
Computational Geometry: Theory and Applications
Computing the least quartile difference estimator in the plane
Computational Statistics & Data Analysis
Divide and Conquer Method for k-Set Polygons
Computational Geometry and Graph Theory
Dynamic ham-sandwich cuts in the plane
Computational Geometry: Theory and Applications
Approximate center points with proofs
Proceedings of the twenty-fifth annual symposium on Computational geometry
Computational Geometry: Theory and Applications
Shape approximation using k-order alpha-hulls
Proceedings of the twenty-sixth annual symposium on Computational geometry
Approximate centerpoints with proofs
Computational Geometry: Theory and Applications
Orthogonal ham-sandwich theorem in R3
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Convex hull of imprecise points in o(n log n) time after preprocessing
Proceedings of the twenty-seventh annual symposium on Computational geometry
k-sets of convex inclusion chains of planar point sets
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Minimizing the error of linear separators on linearly inseparable data
Discrete Applied Mathematics
Covering a bichromatic point set with two disjoint monochromatic disks
Computational Geometry: Theory and Applications
Convex hull of points lying on lines in o(nlogn) time after preprocessing
Computational Geometry: Theory and Applications
Information Processing Letters
k-Capture in multiagent pursuit evasion, or the lion and the hyenas
Theoretical Computer Science
| Hi-index | 0.01 |