A unit-disk graph G (P) of a set P of points in the plane is a graph with P as its vertex set such
that two points of P are connected by an edge if the distance between the two points is at …

For a set $ P $ of $ n $ points in the plane and a value $ r> 0$, the unit-disk range reporting
problem is to construct a data structure so that given any query disk of radius $ r $, all points …

Given a set P of n points in the plane, the unit-disk graph G r (P) with respect to a parameter r
is an undirected graph whose vertex set is P such that an edge connects two points p, q\in P …

In this dissertation, we study algorithms for several problems on unit-disk graphs and related
problems. The unit-disk graph can be viewed as an intersection graph of a set of congruent …

We investigate the problem of finding a spanning tree of a set of $ n $ moving points in
$\mathbb {R}^{\dim} $ that minimizes the maximum total weight (under any convex distance …