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
∙
03/09/2022
On Flipping the Fréchet distance
The classical and extensively-studied Fréchet distance between two curve...
research
∙
11/04/2021
Minimum-Complexity Graph Simplification under Fréchet-Like Distances
Simplifying graphs is a very applicable problem in numerous domains, esp...
research
∙
07/21/2020
Static and Streaming Data Structures for Fréchet Distance Queries
Given a curve P with points in ℝ^d in a streaming fashion, and parameter...
research
∙
05/10/2020
Plurality in Spatial Voting Games with constant β
Consider a set of voters V, represented by a multiset in a metric space ...
research
∙
07/02/2019
A Constant-Factor Approximation Algorithm for Vertex Guarding a WV-Polygon
The problem of vertex guarding a simple polygon was first studied by Sub...
research
∙
04/24/2019
Efficient Nearest-Neighbor Query and Clustering of Planar Curves
We study two fundamental problems dealing with curves in the plane, name...
research
∙
02/20/2019