displayNone
displayNone

Accessibility Menu

banner

Supantha Pandit

Supantha Pandit
Supantha Pandit
 
PhD (Computer Science), IIT Ropar

Contact Details

 
079-68261546
 
# 2205, FB-2, DA-IICT, Gandhinagar, Gujarat, India – 382007

Biography

Supantha Pandit is an Assistant Professor at the Dhirubhai Ambani Institute of Information and Communication Technology (DA-IICT), Gandhinagar, Gujarat, India. Before joining DA-IICT, he was a SERB Indo-US Post Doctoral Fellow at the SUNY Stony Brook, New York, USA. He was also a SERB National Post Doctoral Fellow at the Indian Statistical Institute Kolkata, India. He obtained his Ph.D. degree in Computer Science and Engineering from the Indian Institute of Technology Ropar, Punjab, India. His current research concentrates on theoretical computer science, mainly focused on computational geometry, approximation algorithms, distributed network algorithms, and graph algorithms.

Specialization

Theoretical Computer Science.

Mainly focused on: Approximation Algorithms, Computational Geometry, Computational Complexity, Combinatorial Optimization

Publications

Journal Publications

  • Barun Gorain, Partha Sarathi Mandal, Kaushik Mondal, and Supantha Pandit, Collaborative Dispersion by Silent Robots, Journal of Parallel and Distributed Computing, 2024, https://www.sciencedirect.com/science/article/pii/S0304397524000173
  • Ankush Acharyya, Vahideh Keikha, Diptapriyo Majumdar, and Supantha Pandit, Constrained Hitting Set Problem with Intervals: Hardness, FPT and Approximation Algorithms, Theoretical Computer Science, 2024, https://www.sciencedirect.com/science/article/pii/S0304397524000173
  • Apurva Mudgal and Supantha Pandit, Generalized class cover problem with axis-parallel strips, Computational Geometry: Theory and Applications, 2024, https://www.sciencedirect.com/science/article/pii/S0925772123000858
  • Barun Gorain, Arya T. Gupta, Swapnil A. Lokhande, Kaushik Mondal, Supantha Pandit, Burning and w-burning of geometric graphs, Discrete Applied Mathematics, 2023, https://www.sciencedirect.com/science/article/pii/S0166218X23001099
  • Supantha Pandit, Covering and packing of triangles intersecting a straight line, Discrete Applied Mathematics, 2022, https://doi.org/10.1016/j.dam.2021.11.017
  • Sujoy Bhore, Sourav Chakraborty, Satyabrata Jana, Joseph S. B. Mitchell, Supantha Pandit, and Sasanka Roy, The Balanced Connected Subgraph Problem, Discrete Applied Mathematics, 2022, https://doi.org/10.1016/j.dam.2020.12.030
  • Barun Gorain, Kaushik Mondal, Himadri Nayak, and Supantha Pandit, Pebble Guided Optimal Treasure Hunt in Anonymous Graphs, Theoretical Computer Science, 2022, https://doi.org/10.1016/j.tcs.2022.04.011
  •  Sujoy Bhore, Satyabrata Jana, Supantha Pandit and Sasanka Roy, Balanced Connected Subgraph Problem in Geometric Intersection Graphs, Theoretical Computer Science, 2022, https://doi.org/10.1016/j.tcs.2022.06.030
  • Joseph S. B. Mitchell and Supantha Pandit, Minimum Membership Covering and Hitting, Theoretical Computer Science, 2021, https://www.sciencedirect.com/science/article/pii/S0304397521002619
  • Supantha Pandit, Dominating set of rectangles intersecting a straight line, Journal of Combinatorial Optimization, 2021, https://link.springer.com/article/10.1007/s10878-020-00685-y
  • Satyabrata Jana and Supantha Pandit, Covering and Packing of Rectilinear Subdivision, Theoretical Computer Science, 2020, https://www.sciencedirect.com/science/article/abs/pii/S0304397520304175
  • Ankush Acharyya, Minati De, Subhas C. Nandy, and Supantha Pandit, Variations of largest rectangle recognition amidst a bichromatic point set, Discrete Applied Mathematics, 2020, https://www.sciencedirect.com/science/article/pii/S0166218X19302690
  • Amit Kumar Dhar, Raghunath Reddy Madireddy, Supantha Pandit and Jagpreet Singh, Maximum Independent and Disjoint Coverage, Journal of Combinatorial Optimization, 2020, https://link.springer.com/article/10.1007%2Fs10878-020-00536-w
  • Anisur Rahaman Molla, Supantha Pandit, and Sasanka Roy, Optimal Deterministic Distributed Algorithms for Maximal Independent Set in Geometric Graphs, Journal of Parallel and Distributed Computing, 2019, https://www.sciencedirect.com/science/article/pii/S0743731519304113
  • Ankush Acharyya, Subhas C. Nandy, Supantha Pandit, and Sasanka Roy, Covering Segments with Unit Squares.
    Computational Geometry: Theory and Applications, 2017, https://www.sciencedirect.com/science/article/pii/S0925772119300070
  • Subhas C Nandy, Supantha Pandit, and Sasanka Roy, Faster Approximation for Maximum Independent Set on Unit Disk Graph, Information Processing Letters, 2017, http://www.sciencedirect.com/science/article/pii/S0020019017301291
  • Apurva Mudgal and Supantha Pandit, Geometric Hitting Set, Set Cover and Generalized Class Cover Problems with Half-Strips in
    Opposite Directions, Discrete Applied Mathematics, 2016, http://www.sciencedirect.com/science/article/pii/S0166218X16301263

Conference Publications

  • Sukanya Maji, Supantha Pandit, Sanjib Sadhu: Red-Blue Rectangular Annulus Cover Problem. IJTCS-FAW 2023: 195-211

Teaching

  • Autumn 2023 Design and Analysis of Algorithms (DA-IICT, Gandhinagar).
  • Autumn 2023 Discrete Mathematics (DA-IICT, Gandhinagar).
  • Winter 2022 Optimization (DA-IICT, Gandhinagar).
  • Autumn 2022 Design and Analysis of Algorithms (DA-IICT, Gandhinagar).
  • Autumn 2022 Data Structures and Algorithms with Python (DA-IICT, Gandhinagar).
  • Winter 2022 Optimization (DA-IICT, Gandhinagar).
  • Design and Analysis of Algorithms (DA-IICT, Gandhinagar).
  • Discrete Mathematics (DA-IICT, Gandhinagar). Optimization (DA-IICT, Gandhinagar).

Openings

I am looking for Ph.D. and Masters Students. A Ph.D. thesis will have foundational theoretical work possibly supported by experimental studies. The research topics include computational geometry, approximation algorithms, graph algorithms, distributed computing, discrete mathematics, and problems that generally obey the design and analysis framework of discrete algorithms. For a better understanding, I'd like you to please take a look at my publications. If you have any questions, please don't hesitate to contact me.

Back to Top