20 citations · 66 across the 52 of their papers we have counts for
66 papers
Minimum Sum Vertex Cover via Minimum Vertex Cover
Ahmad Biniaz, Jean-Lou De Carufel, Anil Maheshwari +2
The Minimum Sum Vertex Cover (MSVC) problem asks for an ordering of the vertices of a graph that minimizes the sum, over all edges, of the time at which each edge is first covered.…
On the Spanning Ratio of the Greedy Triangulation for Convex Point Sets
Prosenjit Bose, Jean Lou de Carufel, Anil Maheshwari +3
The greedy triangulation of a finite planar point set is obtained by considering all segments in nondecreasing order of length and inserting each segment that does not cross an ear…
Completely Independent Steiner Trees
Anil Maheshwari, Karthik Murali, Michiel Smid
Spanning trees are fundamental for efficient communication in networks. For fault-tolerant communication, it is desirable to have multiple spanning trees to ensure resilience again…
Linear-Time -Approximation Algorithms for Two-Line-Center Problems
Chaeyoon Chung, Anil Maheshwari, Michiel Smid
Given a set of points in the plane, we study the two-line-center problem: finding two lines that minimize the maximum distance from each point in to its closest line. W…
An Improved Bound for Plane Covering Paths
Hugo A. Akitaya, Greg Aloupis, Ahmad Biniaz +8
A covering path for a finite set of points in the plane is a polygonal path such that every point of lies on a segment of the path. The vertices of the path need not be at…
Polychromatic Coloring of Tuples in Hypergraphs
Ahmad Biniaz, Jean-Lou De Carufel, Anil Maheshwari +3
A hypergraph consists of a set of vertices and a set of hyperedges that are subsets of . A -tuple of is a subset of vertices of . A -tuple -color…