| A Stepping-Up Lemma for Topological Set Systems | 0 | 0.34 | 2021 |
| An Experimental Study of Forbidden Patterns in Geometric Permutations by Combinatorial Lifting. | 0 | 0.34 | 2019 |
| Consistent sets of lines with no colorful incidence. | 0 | 0.34 | 2018 |
| On Order Types of Random Point Sets. | 0 | 0.34 | 2018 |
| Shellability is NP-complete | 0 | 0.34 | 2018 |
| Shatter Functions with Polynomial Growth Rates | 0 | 0.34 | 2017 |
| The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg | 1 | 0.35 | 2017 |
| Geometric Permutations of Non-Overlapping Unit Balls Revisited | 1 | 0.37 | 2016 |
| Smoothed Complexity Of Convex Hulls By Witnesses And Collectors | 1 | 0.38 | 2016 |
| On the Smoothed Complexity of Convex Hulls | 1 | 0.40 | 2015 |
| On Generalized Heawood Inequalities for Manifolds: A Van Kampen-Flores-type Nonembeddability Result. | 1 | 0.43 | 2015 |
| The Number of Holes in the Union of Translates of a Convex Set in Three Dimensions. | 0 | 0.34 | 2015 |
| Simplifying Inclusion-Exclusion Formulas. | 0 | 0.34 | 2015 |
| Limits of Order Types. | 1 | 0.41 | 2015 |
| Bounding Helly Numbers via Betti Numbers. | 3 | 0.53 | 2015 |
| Bounded-Curvature Shortest Paths through a Sequence of Points Using Convex Optimization. | 9 | 0.71 | 2013 |
| Complexity analysis of random geometric structures made simpler | 4 | 0.57 | 2013 |
| The monotonicity of f-vectors of random polytopes | 0 | 0.34 | 2012 |
| Multinerves and helly numbers of acyclic families | 5 | 0.49 | 2012 |
| Helly numbers of acyclic families | 1 | 0.38 | 2011 |
| Inflating Balls Is Np-Hard | 0 | 0.34 | 2011 |
| Lines Pinning Lines | 2 | 0.41 | 2011 |
| Pinning a Line by Balls or Ovaloids in ℝ3 | 0 | 0.34 | 2011 |
| Admissible linear map models of linear cameras | 1 | 0.34 | 2010 |
| Lower Bounds for Pinning Lines by Balls | 0 | 0.34 | 2009 |
| Untangling a Planar Graph. | 9 | 0.83 | 2009 |
| Set systems and families of permutations with small traces | 1 | 0.43 | 2009 |
| Lower Bounds for Pinning Lines by Balls (Extended Abstract) | 0 | 0.34 | 2009 |
| Helly-Type Theorems for Line Transversals to Disjoint Unit Balls | 11 | 0.77 | 2008 |
| Helly-type theorems for approximate covering | 3 | 0.44 | 2008 |
| Moving vertices to make drawings plane | 7 | 0.81 | 2007 |
| Lines and Free Line Segments Tangent to Arbitrary Three-Dimensional Convex Polyhedra | 12 | 0.63 | 2007 |
| Hadwiger and Helly-type theorems for disjoint unit spheres | 6 | 0.59 | 2007 |
| Line transversals to disjoint balls | 10 | 0.77 | 2007 |
| Common Tangents to Spheres in ź3 | 8 | 0.68 | 2006 |
| A note on maximally repeated sub-patterns of a point set | 0 | 0.34 | 2006 |
| A Polynomial-time Algorithm to Design Push Plans for Sensorless Parts Sorting | 1 | 0.35 | 2005 |
| Hadwiger and Helly-type theorems for disjoint unit spheres in R3 | 0 | 0.34 | 2005 |
| Geometric permutations of disjoint unit spheres | 17 | 1.27 | 2005 |
| Disjoint Unit Spheres admit at Most Two Line Transversals | 2 | 0.50 | 2003 |
| The Expected Number of 3D Visibility Events Is Linear | 11 | 0.69 | 2003 |
| On the worst-case complexity of the silhouette of a polytope | 2 | 0.41 | 2003 |
| On the number of lines tangent to four convex polyhedra | 7 | 0.74 | 2002 |
