193 citations · 363 across the 59 of their papers we have counts for
7 papers · 1 filter
Metric inequalities for polygons
Adrian Dumitrescu
Let be the vertices of a polygon with unit perimeter, that is . We derive various tight estimates on the minimum and maximum values…
Dispersion in disks
Adrian Dumitrescu, Minghui Jiang
We present three new approximation algorithms with improved constant ratios for selecting points in disks such that the minimum pairwise distance among the points is maximi…
On convexification of polygons by pops
Adrian Dumitrescu, Evan Hilscher
Given a polygon in the plane, a {\em pop} operation is the reflection of a vertex with respect to the line through its adjacent vertices. We define a family of alternating poly…
Piercing translates and homothets of a convex body
Adrian Dumitrescu, Minghui Jiang
According to a classical result of Grünbaum, the transversal number $τ(\F)$ of any family $\F$ of pairwise-intersecting translates or homothets of a convex body in $\RR^d$ is b…
Minimum clique partition in unit disk graphs
Adrian Dumitrescu, János Pach
The minimum clique partition (MCP) problem is that of partitioning the vertex set of a given graph into a minimum number of cliques. Given points in the plane, the correspondin…
Long non-crossing configurations in the plane
Adrian Dumitrescu, Csaba D. Tóth
We revisit several maximization problems for geometric networks design under the non-crossing constraint, first studied by Alon, Rajagopalan and Suri (ACM Symposium on Computationa…