We present a near-linear time approximation algorithm for the subtraject...
Given a point set P in the Euclidean plane and a parameter t, we define
...
Given a set of n≥ 1 unit disk robots in the Euclidean plane, we consider...
Spanner construction is a well-studied problem and Delaunay triangulatio...
Given a set of n ≥ 1 unit disk robots in the Euclidean plane, we
conside...
We present sweeping line graphs, a generalization of Θ-graphs. We show
t...
We study Snipperclips, a computer puzzle game whose objective is to crea...
The Fréchet distance is a popular similarity measure between curves. For...
We study three covering problems in the plane. Our original motivation f...
Solomon and Elkin constructed a shortcutting scheme for weighted trees w...
Let V be a finite set of vertices in the plane and S be a finite set of
...
We study the geodesic Voronoi diagram of a set S of n linearly moving
si...
We study how to dynamize the Trapezoidal Search Tree - a well known
rand...
Online routing in a planar embedded graph is central to a number of fiel...
We present the first universal reconfiguration algorithm for transformin...
The total angular resolution of a straight-line drawing is the minimum a...
We introduce a new abstract graph game, Swap Planarity, where the goal i...
Let P be an x-monotone orthogonal polygon with n vertices. We call P
a s...
We consider the problem of routing on a network in the presence of line
...
We study the computation of the diameter and radius under the rectilinea...
In this paper we study local routing strategies on geometric graphs. Suc...
We prove a geometric version of the graph separator theorem for the unit...
Let P be a planar set of n sites in general position. For k∈{1,...,n-1},...