Stabbing Line Segments with Disks and Related Problems. - Raghunath Reddy Madireddy; Apurva Mudgal (CCCG, 2016)

Hardness Results and Approximation Schemes for Discrete Packing and Domination Problems. - Raghunath Reddy Madireddy; Apurva Mudgal; Supantha Pandit (COCOA, 2018)

NP-hardness of geometric set cover and hitting set with rectangles containing a common point. - Raghunath Reddy Madireddy; Apurva Mudgal (Inf. Process. Lett., 2019)

Approximability and hardness of geometric hitting set with axis-parallel rectangles. - Raghunath Reddy Madireddy; Apurva Mudgal (Inf. Process. Lett., 2019)

Maximum independent and disjoint coverage. - Amit Kumar Dhar; Raghunath Reddy Madireddy; Supantha Pandit; Jagpreet Singh (J. Comb. Optim., 2020)

Exact Algorithms and Hardness Results for Geometric Red-Blue Hitting Set Problem. - Raghunath Reddy Madireddy; Subhas C. Nandy; Supantha Pandit (FAW, 2022)

Weighted geometric set cover with rectangles of bounded integer side lengths. - Raghunath Reddy Madireddy; Apurva Mudgal (Discret. Appl. Math., 2022)

A Constant-Factor Approximation Algorithm for Red-Blue Set Cover with Unit Disks. - Raghunath Reddy Madireddy; Apurva Mudgal (Algorithmica, 2023)

Minimum-Membership Geometric Dominating Set: Complexity and Algorithms. - Bhavya Bansal; Raghunath Reddy Madireddy; Supantha Pandit (COCOON (1), 2025)

On the geometric red-blue set cover problem. - Raghunath Reddy Madireddy; Subhas C. Nandy; Supantha Pandit (Theor. Comput. Sci., 2025)

Hardness and Approximation Schemes for Discrete Packing and Domination. - Raghunath Reddy Madireddy; Apurva Mudgal; Supantha Pandit (CoRR, 2025)