Supantha Pandit

Publication Activity (10 Years)

Years Active: 2014-2024
Publications (10 Years): 49

Top Topics

Approximation Schemes

Frequent Subgraph Mining

Top Venues

Theor. Comput. Sci.

Publications

Barun Gorain, Partha Sarathi Mandal, Kaushik Mondal, Supantha Pandit
Collaborative dispersion by silent robots. J. Parallel Distributed Comput. 188 (2024)
Ankush Acharyya, Vahideh Keikha, Diptapriyo Majumdar, Supantha Pandit
Constrained hitting set problem with intervals: Hardness, FPT and approximation algorithms. Theor. Comput. Sci. 990 (2024)
Apurva Mudgal, Supantha Pandit
Generalized class cover problem with axis-parallel strips. Comput. Geom. 119 (2024)
Sukanya Maji, Supantha Pandit, Sanjib Sadhu
Generalized Red-Blue Circular Annulus Cover Problem. CoRR (2024)
Barun Gorain, Arya Tanmay Gupta, Swapnil A. Lokhande, Kaushik Mondal, Supantha Pandit
Burning and w-burning of geometric graphs. Discret. Appl. Math. 336 (2023)
Sukanya Maji, Supantha Pandit, Sanjib Sadhu
Red-Blue Rectangular Annulus Cover Problem. IJTCS-FAW (2023)
Supantha Pandit
Covering and packing of triangles intersecting a straight line. Discret. Appl. Math. 319 (2022)
Barun Gorain, Kaushik Mondal, Supantha Pandit
Distributed Dominating Sets in Interval Graphs. COCOON (2022)
Barun Gorain, Kaushik Mondal, Himadri Nayak, Supantha Pandit
Pebble guided optimal treasure hunt in anonymous graphs. Theor. Comput. Sci. 922 (2022)
Barun Gorain, Kaushik Mondal, Supantha Pandit
Distributed Connected Dominating Sets in Unit Square and Disk Graphs. TAMC (2022)
Sujoy Bhore, Satyabrata Jana, Supantha Pandit, Sasanka Roy
The balanced connected subgraph problem for geometric intersection graphs. Theor. Comput. Sci. 929 (2022)
Barun Gorain, Partha Sarathi Mandal, Kaushik Mondal, Supantha Pandit
Collaborative Dispersion by Silent Robots. CoRR (2022)
Barun Gorain, Partha Sarathi Mandal, Kaushik Mondal, Supantha Pandit
Collaborative Dispersion by Silent Robots. SSS (2022)
Raghunath Reddy Madireddy, Subhas C. Nandy, Supantha Pandit
Exact Algorithms and Hardness Results for Geometric Red-Blue Hitting Set Problem. FAW (2022)
Sujoy Bhore, Sourav Chakraborty, Satyabrata Jana, Joseph S. B. Mitchell, Supantha Pandit, Sasanka Roy
The balanced connected subgraph problem. Discret. Appl. Math. 319 (2022)
Raghunath Reddy Madireddy, Subhas C. Nandy, Supantha Pandit
On the Geometric Red-Blue Set Cover Problem. WALCOM (2021)
Ankush Acharyya, Vahideh Keikha, Diptapriyo Majumdar, Supantha Pandit
Constrained Hitting Set Problem with Intervals. COCOON (2021)
Barun Gorain, Kaushik Mondal, Himadri Nayak, Supantha Pandit
Pebble Guided Near Optimal Treasure Hunt in Anonymous Graphs. SIROCCO (2021)
Joseph S. B. Mitchell, Supantha Pandit
Minimum Membership Covering and Hitting. Theor. Comput. Sci. 876 (2021)
Satyabrata Jana, Supantha Pandit, Sasanka Roy
Balanced Connected Graph Partition. CALDAM (2021)
Supantha Pandit
Dominating set of rectangles intersecting a straight line. J. Comb. Optim. 41 (2) (2021)
Barun Gorain, Kaushik Mondal, Supantha Pandit
Distributed Independent Sets in Interval and Segment Intersection Graphs. SOFSEM (2021)
Barun Gorain, Kaushik Mondal, Himadri Nayak, Supantha Pandit
Pebble Guided Near Optimal Treasure Hunt in Anonymous Graphs. CoRR (2021)
Satyabrata Jana, Supantha Pandit
Covering and packing of rectilinear subdivision. Theor. Comput. Sci. 840 (2020)
Joseph S. B. Mitchell, Supantha Pandit
Packing and Covering with Segments. WALCOM (2020)
Amit Kumar Dhar, Raghunath Reddy Madireddy, Supantha Pandit, Jagpreet Singh
Maximum independent and disjoint coverage. J. Comb. Optim. 39 (4) (2020)
Ankush Acharyya, Minati De, Subhas C. Nandy, Supantha Pandit
Variations of largest rectangle recognition amidst a bichromatic point set. Discret. Appl. Math. 286 (2020)
Amit Kumar Dhar, Raghunath Reddy Madireddy, Supantha Pandit, Jagpreet Singh
Maximum Independent and Disjoint Coverage. TAMC (2019)
Supantha Pandit
On the Hardness of Some Geometric Optimization Problems with Rectangles. COCOA (2019)
Sujoy Bhore, Sourav Chakraborty, Satyabrata Jana, Joseph S. B. Mitchell, Supantha Pandit, Sasanka Roy
The Balanced Connected Subgraph Problem. CALDAM (2019)
Supantha Pandit
Covering and Packing of Triangles Intersecting a Straight Line. CALDAM (2019)
Ankush Acharyya, Subhas C. Nandy, Supantha Pandit, Sasanka Roy
Covering segments with unit squares. Comput. Geom. 79 (2019)
Sujoy Bhore, Satyabrata Jana, Supantha Pandit, Sasanka Roy
Balanced Connected Subgraph Problem in Geometric Intersection Graphs. CoRR (2019)
Sujoy Bhore, Satyabrata Jana, Supantha Pandit, Sasanka Roy
Balanced Connected Subgraph Problem in Geometric Intersection Graphs. COCOA (2019)
Joseph S. B. Mitchell, Supantha Pandit
New Results on a Family of Geometric Hitting Set Problems in the Plane. COCOA (2019)
Joseph S. B. Mitchell, Supantha Pandit
Minimum Membership Covering and Hitting. WALCOM (2019)
Ankush Acharyya, Minati De, Subhas C. Nandy, Supantha Pandit
Variations of largest rectangle recognition amidst a bichromatic point set. CoRR (2019)
Anisur Rahaman Molla, Supantha Pandit, Sasanka Roy
Optimal deterministic distributed algorithms for maximal independent set in geometric graphs. J. Parallel Distributed Comput. 132 (2019)
Satyabrata Jana, Supantha Pandit
Covering and Packing of Rectilinear Subdivision. WALCOM (2019)
Satyabrata Jana, Supantha Pandit
Covering and Packing of Rectilinear Subdivision. CoRR (2018)
Sujoy Bhore, Sourav Chakraborty, Satyabrata Jana, Joseph S. B. Mitchell, Supantha Pandit, Sasanka Roy
The Balanced Connected Subgraph Problem. CoRR (2018)
Raghunath Reddy Madireddy, Apurva Mudgal, Supantha Pandit
Hardness Results and Approximation Schemes for Discrete Packing and Domination Problems. COCOA (2018)
Subhas C. Nandy, Supantha Pandit, Sasanka Roy
Covering Points: Minimizing the Maximum Depth. CCCG (2017)
Ankush Acharyya, Subhas C. Nandy, Supantha Pandit, Sasanka Roy
Covering Segments with Unit Squares. WADS (2017)
Supantha Pandit
Dominating Set of Rectangles Intersecting a Straight Line. CCCG (2017)
Subhas C. Nandy, Supantha Pandit, Sasanka Roy
Faster approximation for maximum independent set on unit disk graph. Inf. Process. Lett. 127 (2017)
Ankush Acharyya, Subhas C. Nandy, Supantha Pandit, Sasanka Roy
Covering segments with axis-parallel unit squares. CoRR (2016)
Apurva Mudgal, Supantha Pandit
Geometric hitting set, set cover and generalized class cover problems with half-strips in opposite directions. Discret. Appl. Math. 211 (2016)
Subhas C. Nandy, Supantha Pandit, Sasanka Roy
Faster Approximation for Maximum Independent Set on Unit Disk Graph. CoRR (2016)
Apurva Mudgal, Supantha Pandit
Covering, Hitting, Piercing and Packing Rectangles Intersecting an Inclined Line. COCOA (2015)
Apurva Mudgal, Supantha Pandit
Geometric Hitting Set and Set Cover Problem with Half-Strips. CCCG (2014)
Apurva Mudgal, Supantha Pandit
Generalized Class Cover Problem with Axis-Parallel Strips. WALCOM (2014)