2 citations · 4 across the 6 of their papers we have counts for
5 papers · 1 filter
A New Model in Firefighting Theory
Rolf Klein, David Kübel, Elmar Langetepe +2
Continuous and discrete models for firefighting problems are well-studied in Theoretical Computer Science. We introduce a new, discrete, and more general framework based on a hexag…
Rectilinear Shortest Paths Among Transient Obstacles
Anil Maheshwari, Arash Nouri, Jörg-Rüdiger Sack
This paper presents an optimal algorithm for determining time-minimal rectilinear paths among transient rectilinear obstacles. An obstacle is transient if it exis…
Similarity of Polygonal Curves in the Presence of Outliers
Jean-Lou De Carufel, Amin Gheibi, Anil Maheshwari +2
The Fréchet distance is a well studied and commonly used measure to capture the similarity of polygonal curves. Unfortunately, it exhibits a high sensitivity to the presence of out…
Visiting All Sites with Your Dog
Anil Maheshwari, Jörg-Rüdiger Sack, Kaveh Shahbaz
Given a polygonal curve P, a pointset S, and an ε> 0, we study the problem of finding a polygonal curve Q whose vertices are from S and has a Frechet distance less or equal to εto…
An Approximation Algorithm for Computing Shortest Paths in Weighted 3-d Domains
Lyudmil Aleksandrov, Hristo Djidjev, Anil Maheshwari +1
We present the first polynomial time approximation algorithm for computing shortest paths in weighted three-dimensional domains. Given a polyhedral domain $\D$, consisting of t…