In multicriteria optimization, several objective functions, conflicting with each other, have to be minimized simultaneously. We propose a new efficient method for approximating t...
We prove that computing a geometric minimum-dilation graph on a given set of points in the plane, using not more than a given number of edges, is an NP-hard problem, no matter if ...
Motivated by questions in computer vision and sensor networks, Alpert et al. [3] introduced the following definitions. Given a graph G, an obstacle representation of G is a set of...
The f-regressive Ramsey number Rreg f (d, n) is the minimum N such that every colouring of the d-tuples of an N-element set mapping each x1, . . . , xd to a colour ≤ f(x1) contai...
Let P be a set of n points in the plane. A geometric proximity graph on P is a graph where two points are connected by a straight-line segment if they satisfy some prescribed prox...