research
∙
08/01/2023
Minimum k-Hop Dominating Sets in Grid Graphs
Given a graph G, the k-hop dominating set problem asks for a vertex subs...
share
research
∙
07/10/2022
APX-Hardness of the Minimum Vision Points Problem
Placing a minimum number of guards on a given watchman route in a polygo...
research
∙
07/10/2022
Opposing Half Guards
We study the art gallery problem for opposing half guards: guards that c...
research
∙
04/21/2022
Online Two-Dimensional Vector Packing with Advice
We consider the online two-dimensional vector packing problem, showing a...
research
∙
02/03/2022
k-Transmitter Watchman Routes
We consider the watchman route problem for a k-transmitter watchman: sta...
research
∙
07/16/2020
Shortest Watchman Tours in Simple Polygons under Rotated Monotone Visibility
We present an O(nrG) time algorithm for computing and maintaining a mini...
research
∙
09/23/2019
