DBLP GOOGLE SCHOLAR
Journal Publications:
1. Raghunath Reddy Madireddy and Apurva Mudgal, “NP-hardness of geometric set cover and hitting set with rectangles containing a common point”, Information processing letters 141, 1-8 (2019). (https://doi.org/10.1016/j.ipl.2018.09.002)
2. Raghunath Reddy Madireddy and Apurva Mudgal, “Approximability and hardness of geometric hitting set with axis-parallel rectangles”, Information processing letters 141, 9-15 (2019). (https://doi.org/10.1016/j.ipl.2018.09.003)
3. A K Dhar, Raghunath Reddy Madireddy, Supantha Pandit and Jagpreet Singh, “Maximum Independent and Disjoint Coverage”, Journal of Combinatorial Optimization, 39(4), 1017-1037 (2020). https://doi.org/10.1007/s10878-020-00536-w
Conference Publications:
1. Raghunath Reddy Madireddy and Apurva Mudgal, “Stabbing Line Segments with Disks and Related Problems”, The 28th Canadian Conference on Computational Geometry, CCCG 2016, Canada.
2. Raghunath Reddy Madireddy, Apurva Mudgal and Supantha Pandit, “Hardness results and approximation schemes for discrete packing and domination problems”, International Conference on Combinatorial Optimization and Applications, 421-435, 2018, Atlanta, USA.
3. A K Dhar, Raghunath Reddy Madireddy, Supantha Pandit and Jagpreet Singh, “Maximum Independent and Disjoint Coverage”, 15th Annual Conference on Theory and Applications of Models of Computation (TAMC 2019), Japan.
4. Raghunath Reddy Madireddy and Apurva Mudgal, “A constant factor approximation algorithm for red-blue set cover with unit disks”, 18th Workshop on Approximation and Online Algorithms WAOA 2020, 204-219
6. Raghunath Reddy Madireddy and Supantha Pandit, On the Geometric Red-Blue Hitting Set Problem. EuroCG 2021 (PDF)
7.
Raghunath Reddy Madireddy, Subhas C. Nandy, and Supantha Pandit, Exact Algorithms and Hardness Results for Geometric Red-Blue Hitting Set Problem, The 16th Frontiers of Algorithmics Workshop (IJTCS-FAW 2022), pages 176--191, (
https://doi.org/10.1007/978-3-031-20796-9_13)