| Publication | Date of Publication | Type |
|---|
Some new results on geometric transversals
Discrete \& Computational Geometry | 2024-10-25 | Paper |
Convex hulls of random order types
Journal of the ACM | 2024-07-04 | Paper |
Convex Hulls of Random Order Types
| 2023-11-02 | Paper |
scientific article; zbMATH DE number 7559240 (Why is no real title available?)
| 2022-07-18 | Paper |
The Topology of the set of line Transversals
| 2022-05-29 | Paper |
No weak epsilon nets for lines and convex sets in space
| 2022-02-06 | Paper |
scientific article; zbMATH DE number 7324093 (Why is no real title available?)
| 2021-03-17 | Paper |
Random polytopes and the wet part for arbitrary probability distributions
Annales Henri Lebesgue | 2020-11-11 | Paper |
Shellability is NP-complete
| 2020-08-18 | Paper |
Consistent sets of lines with no colorful incidence
| 2020-08-18 | Paper |
Shellability is NP-complete
Journal of the ACM | 2020-02-11 | Paper |
The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
Bulletin of the American Mathematical Society | 2019-10-30 | Paper |
Shatter functions with polynomial growth rates
SIAM Journal on Discrete Mathematics | 2019-08-29 | Paper |
Bounding Helly numbers via Betti numbers
A Journey Through Discrete Mathematics | 2018-02-26 | Paper |
scientific article; zbMATH DE number 6832267 (Why is no real title available?)
| 2018-01-30 | Paper |
On generalized Heawood inequalities for manifolds: a van Kampen-Flores-type nonembeddability result
Israel Journal of Mathematics | 2017-12-22 | Paper |
Hadwiger and Helly-type theorems for disjoint unit spheres in R 3
Proceedings of the twenty-first annual symposium on Computational geometry | 2017-10-20 | Paper |
Limits of order types
| 2017-10-10 | Paper |
On generalized Heawood inequalities for manifolds: a van Kampen-Flores-type nonembeddability result
| 2017-10-10 | Paper |
On the smoothed complexity of convex hulls
| 2017-10-10 | Paper |
Bounding Helly numbers via Betti numbers
| 2017-10-10 | Paper |
Simplifying Inclusion–Exclusion Formulas
Combinatorics, Probability and Computing | 2017-10-04 | Paper |
The number of lines tangent to arbitrary convex polyhedra in 3D
Proceedings of the twentieth annual symposium on Computational geometry | 2017-09-29 | Paper |
Smoothed complexity of convex hulls by witnesses and collectors
| 2017-03-30 | Paper |
The number of holes in the union of translates of a convex set in three dimensions
Discrete \& Computational Geometry | 2017-02-24 | Paper |
Geometric permutations of non-overlapping unit balls revisited
Computational Geometry | 2016-04-12 | Paper |
Complexity analysis of random geometric structures made simpler
Proceedings of the twenty-ninth annual symposium on Computational geometry | 2015-02-17 | Paper |
The monotonicity of \(f\)-vectors of random polytopes
Electronic Communications in Probability | 2014-09-22 | Paper |
Multinerves and Helly numbers of acyclic families
Proceedings of the twenty-eighth annual symposium on Computational geometry | 2014-08-07 | Paper |
Simplifying inclusion-exclusion formulas
| 2014-06-11 | Paper |
Helly numbers of acyclic families
Advances in Mathematics | 2014-04-15 | Paper |
Lower bounds for pinning lines by balls (extended abstract)
Electronic Notes in Discrete Mathematics | 2013-10-10 | Paper |
Bounded-curvature shortest paths through a sequence of points using convex optimization
SIAM Journal on Computing | 2013-07-24 | Paper |
Set systems and families of permutations with small traces
European Journal of Combinatorics | 2012-12-03 | Paper |
Lower bounds to Helly numbers of line transversals to disjoint congruent balls
Israel Journal of Mathematics | 2012-11-13 | Paper |
Inflating balls is NP-hard
International Journal of Computational Geometry \& Applications | 2012-06-20 | Paper |
Lines pinning lines
Discrete \& Computational Geometry | 2011-03-10 | Paper |
Pinning a line by balls or ovaloids in \(\mathbb R^{3}\)
Discrete \& Computational Geometry | 2011-03-10 | Paper |
Empty-ellipse graphs
| 2010-08-06 | Paper |
Some discrete properties of the space of line transversals to disjoint balls
Nonlinear Computational Geometry | 2010-03-05 | Paper |
Algorithms - ESA 2003
Lecture Notes in Computer Science | 2010-03-03 | Paper |
Untangling a planar graph
Discrete \& Computational Geometry | 2009-12-14 | Paper |
Helly-type theorems for approximate covering
Discrete \& Computational Geometry | 2009-08-27 | Paper |
scientific article; zbMATH DE number 5542492 (Why is no real title available?)
| 2009-04-14 | Paper |
scientific article; zbMATH DE number 5542494 (Why is no real title available?)
| 2009-04-14 | Paper |
scientific article; zbMATH DE number 5507826 (Why is no real title available?)
| 2009-02-12 | Paper |
Helly-type theorems for approximate covering
Proceedings of the twenty-fourth annual symposium on Computational geometry | 2009-02-12 | Paper |
Lines and Free Line Segments Tangent to Arbitrary Three-Dimensional Convex Polyhedra
SIAM Journal on Computing | 2008-04-22 | Paper |
Line transversals to disjoint balls
Discrete \& Computational Geometry | 2008-04-16 | Paper |
Helly-type theorems for line transversals to disjoint unit balls
Discrete \& Computational Geometry | 2008-04-16 | Paper |
Moving Vertices to Make Drawings Plane
Graph Drawing | 2008-03-25 | Paper |
A note on maximally repeated sub-patterns of a point set
Discrete Mathematics | 2006-09-14 | Paper |
Common tangents to spheres in \(\mathbb R^{3}\)
Discrete \& Computational Geometry | 2006-03-21 | Paper |
Geometric permutations of disjoint unit spheres
Computational Geometry | 2005-05-12 | Paper |
The Expected Number of 3D Visibility Events Is Linear
SIAM Journal on Computing | 2004-01-08 | Paper |
Intersection patterns in spaces with a forbidden homological minor
| N/A | Paper |
A canonical tree decomposition for order types, and some applications
| N/A | Paper |
