| Randomized Incremental Construction Of Delaunay Triangulations Of Nice Point Sets | 0 | 0.34 | 2021 |
| Optimizing Persistent Homology Based Functions | 0 | 0.34 | 2021 |
| Topological Uncertainty - Monitoring Trained Neural Networks through Persistence of Activation Graphs. | 0 | 0.34 | 2021 |
| Variable-width contouring for additive manufacturing | 1 | 0.35 | 2020 |
| DTM-based filtrations. | 0 | 0.34 | 2019 |
| Randomized Incremental Construction of Delaunay Triangulations of Nice Point Sets. | 0 | 0.34 | 2019 |
| On Order Types of Random Point Sets. | 0 | 0.34 | 2018 |
| Monotone Simultaneous Paths Embeddings in $\mathbb{R}^d$. | 0 | 0.34 | 2018 |
| Monotone Simultaneous Embeddings of Paths in R^d. | 0 | 0.34 | 2016 |
| Silhouette Of A Random Polytope | 1 | 0.40 | 2016 |
| Smoothed Complexity Of Convex Hulls By Witnesses And Collectors | 1 | 0.38 | 2016 |
| Monotone Simultaneous Embeddings Of Paths In D Dimensions | 0 | 0.34 | 2016 |
| On the Smoothed Complexity of Convex Hulls | 1 | 0.40 | 2015 |
| Convergence rates for persistence diagram estimation in Topological Data Analysis. | 5 | 0.55 | 2014 |
| Recognizing Shrinkable Complexes Is Np-Complete | 0 | 0.34 | 2014 |
| Homological reconstruction and simplification in R3 | 1 | 0.34 | 2013 |
| Optimal rates of convergence for persistence diagrams in Topological Data Analysis | 5 | 0.65 | 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 |
| Point-Set embeddability of 2-colored trees | 3 | 0.47 | 2012 |
| On the complexity of sets of free lines and line segments among balls in three dimensions | 1 | 0.36 | 2012 |
| The structure and stability of persistence modules | 62 | 3.35 | 2012 |
| Metric graph reconstruction from noisy data | 16 | 1.07 | 2011 |
| Farthest-polygon Voronoi diagrams | 23 | 1.18 | 2010 |
| Proximity of persistence modules and their diagrams | 104 | 5.31 | 2009 |
| On the complexity of umbra and penumbra | 2 | 0.37 | 2009 |
| Predicates for line transversals to lines and line segments in three-dimensional space | 1 | 0.35 | 2008 |
| Helly-type theorems for approximate covering | 3 | 0.44 | 2008 |
| Between umbra and penumbra | 0 | 0.34 | 2007 |
| Lines and Free Line Segments Tangent to Arbitrary Three-Dimensional Convex Polyhedra | 12 | 0.63 | 2007 |
| Octrees with near optimal cost for ray-shooting | 3 | 0.40 | 2006 |
| An upper bound on the average size of silhouettes | 2 | 0.40 | 2006 |
| Cost-Optimal Trees for Ray Shooting. | 5 | 0.45 | 2004 |
| 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 |
| Cost-optimal quadtrees for ray shooting. | 2 | 0.39 | 2002 |
