Given a graph G, the k-hop dominating set problem asks for a vertex
subs...
Placing a minimum number of guards on a given watchman route in a polygo...
We study the art gallery problem for opposing half guards: guards that c...
We consider the online two-dimensional vector packing problem, showing a...
We consider the watchman route problem for a k-transmitter watchman:
sta...
We present an O(nrG) time algorithm for computing and maintaining a mini...
Online routing in a planar embedded graph is central to a number of fiel...