
Convex Polygons in Cartesian Products
We study several problems concerning convex polygons whose vertices lie ...
read it

Improved Bounds for Guarding Plane Graphs with Edges
An "edge guard set" of a plane graph G is a subset Γ of edges of G such ...
read it

Routing on the Visibility Graph
We consider the problem of routing on a network in the presence of line ...
read it

Reconstructing a convex polygon from its ωcloud
An ωwedge is the (closed) set of all points contained between two rays ...
read it

Constrained Routing Between NonVisible Vertices
In this paper we study local routing strategies on geometric graphs. Suc...
read it
Sander Verdonschot
is this you? claim profile