17 citations · 17 across the 4 of their papers we have counts for
9 papers
Towards Learning-Guided Discovery of Extremal Geometric Constructions: A PatternBoost Study
Deepak Ajwani, Paula Carroll, Rishikesh Gajjala +5
Extremal constructions play a central role in the design and analysis of algorithms. Integrality-gap instances expose the limitations of relaxations, while hard configurations reve…
Geometric Optimization Parameterized by Piercing Complexity
Aritra Banik, Rajiv Raman, Saurabh Ray
Packing and covering problems for geometric regions have been studied under many notions of complexity, including VC-dimension, union complexity, shallow-cell complexity, and fatne…
Counterexamples to Wegner's Conjecture for Rectangles
Deepak Ajwani, Rishikesh Gajjala, Rajiv Raman +1
Wegner conjectured in 1965 that every finite family of axis-parallel rectangles satisfies , where is the minimum num…
Hitting Axis-Parallel Segments with Weighted Points
Rajiv Raman, Siddhartha Sarkar, Jatin Yadav
We study a geometric hitting-set problem in which the input consists of a set of weighted points and a family of axis-parallel segments in the plane. The goal is to…
A fast algorithm for computing a planar support for non-piercing rectangles
Ambar Pal, Rajiv Raman, Saurabh Ray +1
For a hypergraph a \emph{support} is a graph on such that for each , the induced subgraph of on the elements in is co…
Sweeping Arrangements of Non-Piercing Curves in Plane
Suryendu Dalal, Rahul Gangopadhyay, Rajiv Raman +1
Let be an arrangement of Jordan curves in the plane, i.e., simple closed curves in the plane. For any curve , we denote the bounded region enclosed by as .…
On Hypergraph Supports
Rajiv Raman, Karamjeet Singh
Let be a hypergraph. A support is a graph on such that for each , the subgraph of induced on the elements in is conne…
QPTAS for Geometric Set-Cover Problems via Optimal Separators
Nabil H. Mustafa, Rajiv Raman, Saurabh Ray
Weighted geometric set-cover problems arise naturally in several geometric and non-geometric settings (e.g. the breakthrough of Bansal-Pruhs (FOCS 2010) reduces a wide class of mac…
On Profit-Maximizing Pricing for the Highway and Tollbooth Problems
Khaled Elbassioni, Rajiv Raman, Saurabh Ray +1
In the \emph{tollbooth problem}, we are given a tree $\bT=(V,E)$ with edges, and a set of customers, each of whom is interested in purchasing a path on the tree. Each custo…