3 citations · 9 across the 10 of their papers we have counts for
5 papers · 1 filter
Communication-Efficient Construction of the Plane Localized Delaunay Graph
Prosenjit Bose, Paz Carmi, Michiel Smid +1
Let be a finite set of points in the plane. We present a 2-local algorithm that constructs a plane -spanner of the unit-disk graph $\UDG(V)$. This algori…
NAPX: A Polynomial Time Approximation Scheme for the Noah's Ark Problem
G. Hickey, P. Carmi, A. Maheshwari +1
The Noah's Ark Problem (NAP) is an NP-Hard optimization problem with relevance to ecological conservation management. It asks to maximize the phylogenetic diversity (PD) of a set o…
Distinct Distances in Graph Drawings
Paz Carmi, Vida Dujmović, Pat Morin +1
The \emph{distance-number} of a graph is the minimum number of distinct edge-lengths over all straight-line drawings of in the plane. This definition generalises many well-…
On the Stretch Factor of Convex Delaunay Graphs
Prosenjit Bose, Paz Carmi, Sebastien Collette +1
Let C be a compact and convex set in the plane that contains the origin in its interior, and let S be a finite set of points in the plane. The Delaunay graph DG_C(S) of S is define…
Spanners of Additively Weighted Point Sets
Prosenjit Bose, Paz Carmi, Mathieu Couture
We study the problem of computing geometric spanners for (additively) weighted point sets. A weighted point set is a set of pairs where is a point in the plane and …