We study the reverse shortest path problem on disk graphs in the plane. ...
Let E={e_1,…,e_n} be a set of C-oriented disjoint segments in the
plane,...
We present an algorithm for computing a bottleneck matching in a set of
...
Let 𝒯 be a set of n planar semi-algebraic regions in
ℝ^3 of constant com...
We present a general technique, based on parametric search with some twi...
Bounded-angle (minimum) spanning trees were first introduced in the cont...
The problem of computing a connected network with minimum interference i...
The problem of vertex guarding a simple polygon was first studied by Sub...
We study two fundamental problems dealing with curves in the plane, name...
In the (1+ε,r)-approximate-near-neighbor problem for curves
(ANNC) under...
Following the seminal works of Danzer (1956, 1986) and Stachó
(1965,1981...
We consider a set of transmitters broadcasting simultaneously on the sam...
In this extended abstract, we first present a PTAS for guarding the vert...
We prove a geometric version of the graph separator theorem for the unit...