53 citations · 55 across the 2 of their papers we have counts for
2 papers
cs.CG2009★ 2 cited
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…
math.CO2007★ 53 cited
Compatible Geometric Matchings
Oswin Aichholzer, Sergey Bereg, Adrian Dumitrescu +10
This paper studies non-crossing geometric perfect matchings. Two such perfect matchings are \emph{compatible} if they have the same vertex set and their union is also non-crossing.…