research
∙
04/25/2022
Pursuit-Evasion in Graphs: Zombies, Lazy Zombies and a Survivor
We study zombies and survivor, a variant of the game of cops and robber ...
share
research
∙
07/09/2021
Constant Delay Lattice Train Schedules
The following geometric vehicle scheduling problem has been considered: ...
research
∙
10/31/2019
Expected Complexity of Routing in Θ 6 and Half-Θ 6 Graphs
We study online routing algorithms on the Θ6-graph and the half-Θ6-graph...
research
∙
12/29/2018
Convex Polygons in Cartesian Products
We study several problems concerning convex polygons whose vertices lie ...
research
∙
12/17/2018
Stabbing Pairwise Intersecting Disks by Four Points
Following the seminal works of Danzer (1956, 1986) and Stachó (1965,1981...
research
∙
10/22/2018
On the Minimum Consistent Subset Problem
Let P be a set of n colored points in the plane. Introduced by Hart (196...
research
∙
08/03/2018
On the Spanning and Routing Ratio of Theta-Four
We present a routing algorithm for the Theta-4-graph that computes a pat...
research
∙
01/07/2018
Reconstructing a convex polygon from its ω-cloud
An ω-wedge is the (closed) set of all points contained between two rays ...
research
∙
10/25/2017
The Geodesic 2-center Problem in a Simple Polygon
The geodesic k-center problem in a simple polygon with n vertices consis...
research
∙
06/25/2017
Optimal Art Gallery Localization is NP-hard
Art Gallery Localization (AGL) is the problem of placing a set T of broa...
research
∙
06/21/2017
Art Gallery Localization
We study the problem of placing a set T of broadcast towers in a simple ...
research
∙
07/09/2015
The Shadows of a Cycle Cannot All Be Paths
A "shadow" of a subset S of Euclidean space is an orthogonal projection ...
research
∙
12/07/2012