Geometric Hitting Set and Set Cover Problem with Half-Strips. - Apurva Mudgal; Supantha Pandit (CCCG, 2014)

Covering, Hitting, Piercing and Packing Rectangles Intersecting an Inclined Line. - Apurva Mudgal; Supantha Pandit (COCOA, 2015)

Covering segments with axis-parallel unit squares. - Ankush Acharyya; Subhas C. Nandy; Supantha Pandit; Sasanka Roy (CoRR, 2016)

Geometric hitting set, set cover and generalized class cover problems with half-strips in opposite directions. - Apurva Mudgal; Supantha Pandit (Discret. Appl. Math., 2016)

Covering Points: Minimizing the Maximum Depth. - Subhas C. Nandy; Supantha Pandit; Sasanka Roy (CCCG, 2017)

Faster approximation for maximum independent set on unit disk graph. - Subhas C. Nandy; Supantha Pandit; Sasanka Roy (Inf. Process. Lett., 2017)

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

New Results on a Family of Geometric Hitting Set Problems in the Plane. - Joseph S. B. Mitchell; Supantha Pandit (COCOA, 2019)

On the Hardness of Some Geometric Optimization Problems with Rectangles. - Supantha Pandit (COCOA, 2019)

Covering segments with unit squares. - Ankush Acharyya; Subhas C. Nandy; Supantha Pandit; Sasanka Roy (Comput. Geom., 2019)

Optimal deterministic distributed algorithms for maximal independent set in geometric graphs. - Anisur Rahaman Molla; Supantha Pandit; Sasanka Roy (J. Parallel Distributed Comput., 2019)

Packing and Covering with Segments. - Joseph S. B. Mitchell; Supantha Pandit (WALCOM, 2020)

Variations of largest rectangle recognition amidst a bichromatic point set. - Ankush Acharyya; Minati De; Subhas C. Nandy; Supantha Pandit (Discret. Appl. Math., 2020)

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

Covering and packing of rectilinear subdivision. - Satyabrata Jana; Supantha Pandit (Theor. Comput. Sci., 2020)

Balanced Connected Graph Partition. - Satyabrata Jana; Supantha Pandit; Sasanka Roy (CALDAM, 2021)

Constrained Hitting Set Problem with Intervals. - Ankush Acharyya; Vahideh Keikha; Diptapriyo Majumdar; Supantha Pandit (COCOON, 2021)

Pebble Guided Near Optimal Treasure Hunt in Anonymous Graphs. - Barun Gorain; Kaushik Mondal 001; Himadri Nayak; Supantha Pandit (SIROCCO, 2021)

Distributed Independent Sets in Interval and Segment Intersection Graphs. - Barun Gorain; Kaushik Mondal 001; Supantha Pandit (SOFSEM, 2021)

Dominating set of rectangles intersecting a straight line. - Supantha Pandit (J. Comb. Optim., 2021)

Minimum Membership Covering and Hitting. - Joseph S. B. Mitchell; Supantha Pandit (Theor. Comput. Sci., 2021)

Distributed Dominating Sets in Interval Graphs. - Barun Gorain; Kaushik Mondal 001; Supantha Pandit (COCOON, 2022)

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

Distributed Connected Dominating Sets in Unit Square and Disk Graphs. - Barun Gorain; Kaushik Mondal 001; Supantha Pandit (TAMC, 2022)

The balanced connected subgraph problem. - Sujoy Bhore; Sourav Chakraborty 001; Satyabrata Jana; Joseph S. B. Mitchell; Supantha Pandit; Sasanka Roy (Discret. Appl. Math., 2022)

Covering and packing of triangles intersecting a straight line. - Supantha Pandit (Discret. Appl. Math., 2022)

The balanced connected subgraph problem for geometric intersection graphs. - Sujoy Bhore; Satyabrata Jana; Supantha Pandit; Sasanka Roy (Theor. Comput. Sci., 2022)

Pebble guided optimal treasure hunt in anonymous graphs. - Barun Gorain; Kaushik Mondal 001; Himadri Nayak; Supantha Pandit (Theor. Comput. Sci., 2022)

Red-Blue Rectangular Annulus Cover Problem. - Sukanya Maji; Supantha Pandit; Sanjib Sadhu (IJTCS-FAW, 2023)

Burning and w-burning of geometric graphs. - Barun Gorain; Arya Tanmay Gupta; Swapnil A. Lokhande; Kaushik Mondal 001; Supantha Pandit (Discret. Appl. Math., 2023)

Generalized class cover problem with axis-parallel strips. - Apurva Mudgal; Supantha Pandit (Comput. Geom., 2024)

Generalized Red-Blue Circular Annulus Cover Problem. - Sukanya Maji; Supantha Pandit; Sanjib Sadhu (CoRR, 2024)

Optimal Dispersion of Silent Robots in a Ring. - Bibhuti Das 001; Barun Gorain; Kaushik Mondal 001; Krishnendu Mukhopadhyaya; Supantha Pandit (CoRR, 2024)

Collaborative dispersion by silent robots. - Barun Gorain; Partha Sarathi Mandal 001; Kaushik Mondal 001; Supantha Pandit (J. Parallel Distributed Comput., 2024)

Constrained hitting set problem with intervals: Hardness, FPT and approximation algorithms. - Ankush Acharyya; Vahideh Keikha; Diptapriyo Majumdar; Supantha Pandit (Theor. Comput. Sci., 2024)

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

Optimal Dispersion in Triangular Grids: Achieving Efficiency Without Prior Knowledge. - Himani; Supantha Pandit (ICDCIT, 2025)

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

On some geometric optimization problems with segments. - Joseph S. B. Mitchell; Supantha Pandit (Theor. Comput. Sci., 2025)

Distributed Independent Sets in Interval and Segment Intersection Graphs. - Nirmala Bhatt; Barun Gorain; Kaushik Mondal 001; Supantha Pandit (Int. J. Found. Comput. Sci., 2025)

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