Computing Circular Separability.
Computing homology.
Computing parametric rational generating functions with a primal Barvinok algorithm.
Computing Simple Circuits from a Set of Line Segments.
Computing the Ehrhart Polynomial of a Convex Lattice Polytope.
Computing the Geodesic Center of a Simple Polygon.
Computing the period of an Ehrhart quasi-polynomial.
Computing the Volume, Counting Integral Points, and Exponential Sums.
Computing the Volume is Difficult.
Concentration inequalities for s-concave measures of dilations of Borel sets and applications.
Concentration of mass on the Schatten classes
Concerning interior mapping theorem
Concerning Sets of the First Baire Category with Respect to Different Metrics
We prove that if and δ are the Hausdorff metric and the radial metric on the space ⁿ of star bodies in ℝ, with 0 in the kernel and with radial function positive and continuous, then a family ⊂ ⁿ that is meager with respect to need not be meager with respect to δ. Further, we show that both the family of fractal star bodies and its complement are dense in ⁿ with respect to δ.
Conditional probabilities and permutahedron
Condizioni di continuità in una misura approssimante
Conectando puntos: Poligonizaciones y otros problemas relacionados.
Cônes asymptotes d'ensembles non convexes
Cones of polynomials
Configuration spaces and limits of voronoi diagrams
The Voronoi diagram of n distinct generating points divides the plane into cells, each of which consists of points most close to one particular generator. After introducing 'limit Voronoi diagrams' by analyzing diagrams of moving and coinciding points, we define compactifications of the configuration space of n distinct, labeled points. On elements of these compactifications we define Voronoi diagrams.
Configuration spaces of weighted graphs in high dimensional Euclidean spaces.