Supantha Pandit

EDBT 2026 Demo / reviewers in the wild / expert

dblp:139/8205 · DBLP profile ↗

← Back

38ranked-venue papers

2as first author

22since 2021 · last 2026

0000-0002-4908-7165ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 25 · 1 first-author · 16 since 2021Artificial intelligence and machine learning · 5 · 1 first-authorSystems, architecture and hardware · 2 · 1 since 2021Security and privacy · 2 · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 2 since 2021Databases, data management, data science and information retrieval · 1

Year	Publication	Venue	Position
2026	Optimal dispersion of silent robots in a ring Bibhuti Das 0001, Barun Gorain, Kaushik Mondal 0001, Krishnendu Mukhopadhyaya, Supantha Pandit	Theor. Comput. Sci.	5
2026	Efficient dispersion in triangular grids without prior knowledge Himani, Supantha Pandit	Theor. Comput. Sci.	2
2025	Minimum-Membership Geometric Dominating Set: Complexity and Algorithms Bhavya Bansal, Raghunath Reddy Madireddy, Supantha Pandit	COCOON (1)	3
2025	Optimal Dispersion of Silent Robots in a Ring Bibhuti Das 0001, Barun Gorain, Kaushik Mondal 0001, Krishnendu Mukhopadhyaya, Supantha Pandit	SSS	5
2025	On the geometric red-blue set cover problem Raghunath Reddy Madireddy, Subhas C. Nandy, Supantha Pandit	Theor. Comput. Sci.	3
2025	On some geometric optimization problems with segments Joseph S. B. Mitchell, Supantha Pandit	Theor. Comput. Sci.	2
2024	Generalized class cover problem with axis-parallel strips Apurva Mudgal, Supantha Pandit	Comput. Geom.	2
2024	Collaborative dispersion by silent robots Barun Gorain, Partha Sarathi Mandal 0001, Kaushik Mondal 0001, Supantha Pandit	J. Parallel Distributed Comput.	4
2024	Constrained hitting set problem with intervals: Hardness, FPT and approximation algorithms Ankush Acharyya, Vahideh Keikha, Diptapriyo Majumdar, Supantha Pandit	Theor. Comput. Sci.	4
2023	Red-Blue Rectangular Annulus Cover Problem Sukanya Maji, Supantha Pandit, Sanjib Sadhu	IJTCS-FAW	2
2023	Burning and w-burning of geometric graphs Barun Gorain, Arya Tanmay Gupta, Swapnil A. Lokhande, Kaushik Mondal 0001, Supantha Pandit	Discret. Appl. Math.	5
2022	Distributed Dominating Sets in Interval Graphs Barun Gorain, Kaushik Mondal 0001, Supantha Pandit	COCOON	3
2022	Collaborative Dispersion by Silent Robots Barun Gorain, Partha Sarathi Mandal 0001, Kaushik Mondal 0001, Supantha Pandit	SSS	4
2022	Distributed Connected Dominating Sets in Unit Square and Disk Graphs Barun Gorain, Kaushik Mondal 0001, Supantha Pandit	TAMC	3
2022	The balanced connected subgraph problem Sujoy Bhore, Sourav Chakraborty 0001, Satyabrata Jana, Joseph S. B. Mitchell, Supantha Pandit, Sasanka Roy	Discret. Appl. Math.	5
2022	Covering and packing of triangles intersecting a straight line Supantha Pandit	Discret. Appl. Math.	1
2022	The balanced connected subgraph problem for geometric intersection graphs Sujoy Bhore, Satyabrata Jana, Supantha Pandit, Sasanka Roy	Theor. Comput. Sci.	3
2022	Pebble guided optimal treasure hunt in anonymous graphs Barun Gorain, Kaushik Mondal 0001, Himadri Nayak, Supantha Pandit	Theor. Comput. Sci.	4
2021	Constrained Hitting Set Problem with Intervals Ankush Acharyya, Vahideh Keikha, Diptapriyo Majumdar, Supantha Pandit	COCOON	4
2021	Pebble Guided Near Optimal Treasure Hunt in Anonymous Graphs Barun Gorain, Kaushik Mondal 0001, Himadri Nayak, Supantha Pandit	SIROCCO	4
2021	Distributed Independent Sets in Interval and Segment Intersection Graphs Barun Gorain, Kaushik Mondal 0001, Supantha Pandit	SOFSEM	3
2021	Minimum Membership Covering and Hitting Joseph S. B. Mitchell, Supantha Pandit	Theor. Comput. Sci.	2
2020	Packing and Covering with Segments Joseph S. B. Mitchell, Supantha Pandit	WALCOM	2
2020	Variations of largest rectangle recognition amidst a bichromatic point set Ankush Acharyya, Minati De, Subhas C. Nandy, Supantha Pandit	Discret. Appl. Math.	4
2020	Covering and packing of rectilinear subdivision Satyabrata Jana, Supantha Pandit	Theor. Comput. Sci.	2
2019	Balanced Connected Subgraph Problem in Geometric Intersection Graphs Sujoy Bhore, Satyabrata Jana, Supantha Pandit, Sasanka Roy	COCOA	3
2019	New Results on a Family of Geometric Hitting Set Problems in the Plane Joseph S. B. Mitchell, Supantha Pandit	COCOA	2
2019	On the Hardness of Some Geometric Optimization Problems with Rectangles Supantha Pandit	COCOA	1
2019	Maximum Independent and Disjoint Coverage Amit Kumar Dhar, Raghunath Reddy Madireddy, Supantha Pandit, Jagpreet Singh	TAMC	3
2019	Covering and Packing of Rectilinear Subdivision Satyabrata Jana, Supantha Pandit	WALCOM	2
2019	Minimum Membership Covering and Hitting Joseph S. B. Mitchell, Supantha Pandit	WALCOM	2
2019	Covering segments with unit squares Ankush Acharyya, Subhas C. Nandy, Supantha Pandit, Sasanka Roy	Comput. Geom.	3
2019	Optimal deterministic distributed algorithms for maximal independent set in geometric graphs Anisur Rahaman Molla, Supantha Pandit, Sasanka Roy	J. Parallel Distributed Comput.	2
2018	Hardness Results and Approximation Schemes for Discrete Packing and Domination Problems Raghunath Reddy Madireddy, Apurva Mudgal, Supantha Pandit	COCOA	3
2017	Covering Segments with Unit Squares Ankush Acharyya, Subhas C. Nandy, Supantha Pandit, Sasanka Roy	WADS	3
2017	Faster approximation for maximum independent set on unit disk graph Subhas C. Nandy, Supantha Pandit, Sasanka Roy	Inf. Process. Lett.	2
2016	Geometric hitting set, set cover and generalized class cover problems with half-strips in opposite directions Apurva Mudgal, Supantha Pandit	Discret. Appl. Math.	2
2015	Covering, Hitting, Piercing and Packing Rectangles Intersecting an Inclined Line Apurva Mudgal, Supantha Pandit	COCOA	2