| Stronger bounds for weak epsilon-nets in higher dimensions | 0 | 0.34 | 2021 |
| Planar Point Sets Determine Many Pairwise Crossing Segments. | 0 | 0.34 | 2019 |
| Further Consequences of the Colorful Helly Hypothesis. | 0 | 0.34 | 2018 |
| An Improved Bound for Weak Epsilon-Nets in the Plane | 3 | 0.52 | 2018 |
| Approximate Nearest Neighbor Search Amid Higher-Dimensional Flats. | 0 | 0.34 | 2017 |
| A Crossing Lemma for Jordan Curves. | 0 | 0.34 | 2017 |
| Stable Delaunay Graphs. | 1 | 0.36 | 2015 |
| Beyond the Richter-Thomassen Conjecture. | 4 | 0.73 | 2015 |
| On Kinetic Delaunay Triangulations: A Near-Quadratic Bound for Unit Speed Motions. | 3 | 0.39 | 2015 |
| Kinetic Voronoi Diagrams and Delaunay Triangulations under Polygonal Distance Functions. | 2 | 0.40 | 2014 |
| On the Richter-Thomassen conjecture about pairwise intersecting closed curves | 4 | 0.49 | 2014 |
| On topological changes in the delaunay triangulation of moving points | 7 | 0.55 | 2013 |
| On Kinetic Delaunay Triangulations: A Near Quadratic Bound for Unit Speed Motions | 4 | 0.43 | 2013 |
| Lines Avoiding Balls in Three Dimensions Revisited | 2 | 0.40 | 2012 |
| Improved Bounds for Geometric Permutations | 3 | 0.42 | 2012 |
| Lines Avoiding Balls In Three Dimensions Revisited | 0 | 0.34 | 2010 |
| A Kinetic Triangulation Scheme For Moving Points In The Plane | 0 | 0.34 | 2010 |
| Kinetic stable Delaunay graphs | 12 | 0.70 | 2010 |
| A Kinetic Triangulation Scheme for Moving Points in The Plane | 8 | 0.62 | 2010 |
| Linear Data Structures for Fast Ray-Shooting amidst Convex Polyhedra | 4 | 0.45 | 2009 |
| Efficient Colored Orthogonal Range Counting | 17 | 0.85 | 2008 |
| Line transversals of convex polyhedra in R3 | 4 | 0.44 | 2008 |
| Counting colors in boxes | 14 | 0.92 | 2007 |
