| Intersection Searching Amid Tetrahedra in 4-Space and Efficient Continuous Collision Detection | 0 | 0.34 | 2022 |
| On Ray Shooting for Triangles in 3-Space and Related Problems | 0 | 0.34 | 2022 |
| Throwing a Sofa Through the Window | 0 | 0.34 | 2021 |
| Subquadratic Algorithms for Some 3Sum-Hard Geometric Problems in the Algebraic Decision Tree Model. | 0 | 0.34 | 2021 |
| How to Find a Point in the Convex Hull Privately. | 0 | 0.34 | 2020 |
| Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic Õ(n5/3) Time. | 0 | 0.34 | 2018 |
| Algebraic Techniques In Geometry: The 10th Anniversary | 0 | 0.34 | 2018 |
| Distinct distances between points and lines | 0 | 0.34 | 2018 |
| Approximate Minimum-Weight Matching with Outliers under Translation. | 0 | 0.34 | 2018 |
| Incidences Between Points and Lines on Two- and Three-Dimensional Varieties | 1 | 0.37 | 2018 |
| Incidences Between Points and Lines in $${\mathbb {R}}^4$$. | 0 | 0.34 | 2017 |
| On the number of unit-area triangles spanned by convex grids in the plane | 2 | 0.39 | 2017 |
| Finding axis-parallel rectangles of fixed perimeter or area containing the largest number of points | 1 | 0.35 | 2017 |
| Depth contours in arrangements of halfplanes. | 0 | 0.34 | 2016 |
| The Decision Tree Complexity for k-SUM is at most Nearly Quadratic. | 0 | 0.34 | 2016 |
| Incidences between Points and Lines in R^4 | 1 | 0.45 | 2015 |
| The Discrete and Semicontinuous Fréchet Distance with Shortcuts via Approximate Distance Counting and Selection | 1 | 0.35 | 2015 |
| Epsilon-Nets for Halfspaces Revisited. | 5 | 0.44 | 2014 |
| Partial-Matching and Hausdorff RMS Distance Under Translation: Combinatorics and Algorithms. | 1 | 0.36 | 2014 |
| Finding The Largest Empty Disk Containing A Query Point | 0 | 0.34 | 2013 |
| The Discrete Fréchet Distance with Shortcuts via Approximate Distance Counting and Selection Techniques. | 0 | 0.34 | 2013 |
| Output-Sensitive Tools for Range Searching in Higher Dimensions. | 2 | 0.39 | 2013 |
| Improved Bounds for Incidences Between Points and Circles. | 10 | 0.58 | 2013 |
| Union of Random Minkowski Sums and Network Vulnerability Analysis | 8 | 0.54 | 2013 |
| Finding the maximal empty disk containing a query point | 8 | 0.71 | 2012 |
| Incidences in three dimensions and distinct distances in the plane | 17 | 1.57 | 2010 |
| Approximate Halfspace Range Counting | 7 | 0.50 | 2010 |
| Guarding a Terrain by Two Watchtowers | 5 | 0.57 | 2010 |
| Constructing Two-Dimensional Voronoi Diagrams via Divide-and-Conquer of Envelopes in Space | 11 | 0.86 | 2010 |
| The complexity of the outer face in arrangements of random segments | 0 | 0.34 | 2008 |
| An Optimal-Time Algorithm for Shortest Paths on a Convex Polytope in Three Dimensions | 27 | 1.16 | 2008 |
| Weak &epsis;-nets and interval chains | 5 | 0.44 | 2008 |
| Kinetic and dynamic data structures for convex hulls and upper envelopes | 16 | 0.86 | 2007 |
| Bi-criteria linear-time approximations for generalized k-mean/median/center | 8 | 0.62 | 2007 |
| Almost Tight Bound for the Union of Fat Tetrahedra in Three Dimensions | 11 | 0.62 | 2007 |
| On the number of crossing-free matchings, (cycles, and partitions) | 48 | 3.27 | 2006 |
| On the ICP algorithm | 7 | 0.83 | 2006 |
| Crossing patterns of semi-algebraic sets | 27 | 2.02 | 2005 |
| Top-Down Analysis of Path Compression | 11 | 0.76 | 2005 |
| Geometrically aware communication in random wireless networks | 14 | 0.81 | 2004 |
| Counting and representing intersections among triangles in three dimensions | 10 | 0.53 | 2004 |
| Computing maximally separated sets in the plane and independent sets in the intersection graph of unit disks | 3 | 0.41 | 2004 |
| On the number of views of translates of a cube and related problems | 0 | 0.34 | 2004 |
| 3-Dimensional Euclidean Voronoi Diagrams of Lines with a Fixed Number of Orientations | 15 | 0.69 | 2003 |
| The Minkowski sum of a simple polygon and a segment | 1 | 0.39 | 2003 |
| The Clarkson–Shor Technique Revisited and Extended | 10 | 0.83 | 2003 |
| The Number of Congruent Simplices in a Point Set | 6 | 0.66 | 2002 |
| The 2-center problem with obstacles | 16 | 1.02 | 2002 |
| Online point location in planar arrangements and its applications | 13 | 0.82 | 2001 |
| Exact and Approximation Algorithms for Minimum-Width Cylindrical Shells | 14 | 1.08 | 2001 |
