40 citations · 98 across the 42 of their papers we have counts for
55 papers
Online Class Cover Problem
Minati De, Anil Maheshwari, Ratnadip Mandal
In this paper, we study the online class cover problem where a (finite or infinite) family of geometric objects and a set of red points in are…
Distance-Preserving Graph Compression Techniques
Amirali Madani, Anil Maheshwari
We study the problem of distance-preserving graph compression for weighted paths and trees. The problem entails a weighted graph with non-negative weights, and a subse…
Approximating bottleneck spanning trees on partitioned tuples of points
Ahmad Biniaz, Anil Maheshwari, Michiel Smid
We present approximation algorithms for the following NP-hard optimization problems related to bottleneck spanning trees in metric spaces. 1. The disjoint bottleneck spanning tree…
Exact and Approximation Algorithms for Many-To-Many Point Matching in the Plane
Sayan Bandyapadhyay, Anil Maheshwari, Michiel Smid
Given two sets and of points in the plane, of total size , a {many-to-many} matching between and is a set of pairs such that , and for e…
A linear-time algorithm for semitotal domination in strongly chordal graphs
Vikash Tripathi, Arti Pandey, Anil Maheshwari
In a graph with no isolated vertex, a dominating set , is called a semitotal dominating set if for every vertex there is another vertex …
Constant Delay Lattice Train Schedules
Jean-Lou De Carufel, Darryl Hill, Anil Maheshwari +2
The following geometric vehicle scheduling problem has been considered: given continuous curves , find non-negative delays $…