Supantha Pandit
Supantha Pandit
Dhirubhai Ambani Institute of Information and Communication Technology
No verified email - Homepage
Cited by
Cited by
Covering, hitting, piercing and packing rectangles intersecting an inclined line
A Mudgal, S Pandit
Combinatorial Optimization and Applications: 9th International Conference …, 2015
Faster approximation for maximum independent set on unit disk graph
SC Nandy, S Pandit, S Roy
Information Processing Letters 127, 58-61, 2017
Dominating Set of Rectangles Intersecting a Straight Line.
S Pandit
CCCG, 144-149, 2017
The balanced connected subgraph problem
S Bhore, S Chakraborty, S Jana, JSB Mitchell, S Pandit, S Roy
Discrete Applied Mathematics 319, 111-120, 2022
Variations of largest rectangle recognition amidst a bichromatic point set
A Acharyya, M De, SC Nandy, S Pandit
Discrete Applied Mathematics 286, 35-50, 2020
The balanced connected subgraph problem for geometric intersection graphs
S Bhore, S Jana, S Pandit, S Roy
Theoretical Computer Science 929, 69-80, 2022
Covering segments with unit squares
A Acharyya, SC Nandy, S Pandit, S Roy
Computational Geometry 79, 1-13, 2019
Covering Points: Minimizing the Maximum Depth.
SC Nandy, S Pandit, S Roy
CCCG, 37-42, 2017
On the geometric red-blue set cover problem
RR Madireddy, SC Nandy, S Pandit
International Workshop on Algorithms and Computation, 129-141, 2021
Optimal deterministic distributed algorithms for maximal independent set in geometric graphs
AR Molla, S Pandit, S Roy
Journal of Parallel and Distributed Computing 132, 36-47, 2019
Maximum independent and disjoint coverage
AK Dhar, RR Madireddy, S Pandit, J Singh
Journal of Combinatorial Optimization 39 (4), 1017-1037, 2020
Hardness results and approximation schemes for discrete packing and domination problems
RR Madireddy, A Mudgal, S Pandit
International Conference on Combinatorial Optimization and Applications, 421-435, 2018
Geometric Hitting Set and Set Cover Problem with Half-Strips.
A Mudgal, S Pandit
CCCG, 2014
Generalized class cover problem with axis-parallel strips
A Mudgal, S Pandit
Algorithms and Computation: 8th International Workshop, WALCOM 2014, Chennai …, 2014
Collaborative Dispersion by Silent Robots
B Gorain, PS Mandal, K Mondal, S Pandit
International Symposium on Stabilizing, Safety, and Security of Distributed …, 2022
Pebble guided optimal treasure hunt in anonymous graphs
B Gorain, K Mondal, H Nayak, S Pandit
Theoretical Computer Science 922, 61-80, 2022
Minimum membership covering and hitting
JSB Mitchell, S Pandit
Theoretical Computer Science 876, 1-11, 2021
Balanced connected graph partition
S Jana, S Pandit, S Roy
Conference on Algorithms and Discrete Applied Mathematics, 487-499, 2021
Covering and packing of rectilinear subdivision
S Jana, S Pandit
Theoretical Computer Science 840, 166-176, 2020
Geometric hitting set, set cover and generalized class cover problems with half-strips in opposite directions
A Mudgal, S Pandit
Discrete Applied Mathematics 211, 143-162, 2016
The system can't perform the operation now. Try again later.
Articles 1–20