default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSupantha Pandit
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j17]Apurva Mudgal, Supantha Pandit
:
Generalized class cover problem with axis-parallel strips. Comput. Geom. 119: 102065 (2024)- [j16]Barun Gorain, Partha Sarathi Mandal, Kaushik Mondal, Supantha Pandit:
Collaborative dispersion by silent robots. J. Parallel Distributed Comput. 188: 104852 (2024) - [j15]Ankush Acharyya, Vahideh Keikha, Diptapriyo Majumdar, Supantha Pandit:
Constrained hitting set problem with intervals: Hardness, FPT and approximation algorithms. Theor. Comput. Sci. 990: 114402 (2024) - [i10]Sukanya Maji, Supantha Pandit, Sanjib Sadhu:
Generalized Red-Blue Circular Annulus Cover Problem. CoRR abs/2402.13767 (2024) - [i9]Bibhuti Das, Barun Gorain, Kaushik Mondal, Krishnendu Mukhopadhyaya, Supantha Pandit:
Optimal Dispersion of Silent Robots in a Ring. CoRR abs/2408.05491 (2024) - 2023
- [j14]Barun Gorain, Arya Tanmay Gupta, Swapnil A. Lokhande, Kaushik Mondal, Supantha Pandit:
Burning and w-burning of geometric graphs. Discret. Appl. Math. 336: 83-98 (2023) - [c26]Sukanya Maji, Supantha Pandit, Sanjib Sadhu:
Red-Blue Rectangular Annulus Cover Problem. IJTCS-FAW 2023: 195-211 - 2022
- [j13]Supantha Pandit:
Covering and packing of triangles intersecting a straight line. Discret. Appl. Math. 319: 92-110 (2022) - [j12]Sujoy Bhore, Sourav Chakraborty, Satyabrata Jana, Joseph S. B. Mitchell, Supantha Pandit, Sasanka Roy:
The balanced connected subgraph problem. Discret. Appl. Math. 319: 111-120 (2022) - [j11]Barun Gorain, Kaushik Mondal, Himadri Nayak, Supantha Pandit:
Pebble guided optimal treasure hunt in anonymous graphs. Theor. Comput. Sci. 922: 61-80 (2022) - [j10]Sujoy Bhore, Satyabrata Jana, Supantha Pandit, Sasanka Roy:
The balanced connected subgraph problem for geometric intersection graphs. Theor. Comput. Sci. 929: 69-80 (2022) - [c25]Barun Gorain, Kaushik Mondal, Supantha Pandit:
Distributed Dominating Sets in Interval Graphs. COCOON 2022: 508-520 - [c24]Raghunath Reddy Madireddy, Subhas C. Nandy, Supantha Pandit:
Exact Algorithms and Hardness Results for Geometric Red-Blue Hitting Set Problem. FAW 2022: 176-191 - [c23]Barun Gorain, Partha Sarathi Mandal, Kaushik Mondal, Supantha Pandit:
Collaborative Dispersion by Silent Robots. SSS 2022: 254-269 - [c22]Barun Gorain, Kaushik Mondal, Supantha Pandit:
Distributed Connected Dominating Sets in Unit Square and Disk Graphs. TAMC 2022: 346-358 - [i8]Barun Gorain, Partha Sarathi Mandal, Kaushik Mondal, Supantha Pandit:
Collaborative Dispersion by Silent Robots. CoRR abs/2202.05710 (2022) - 2021
- [j9]Supantha Pandit:
Dominating set of rectangles intersecting a straight line. J. Comb. Optim. 41(2): 414-432 (2021) - [j8]Joseph S. B. Mitchell, Supantha Pandit:
Minimum Membership Covering and Hitting. Theor. Comput. Sci. 876: 1-11 (2021) - [c21]Satyabrata Jana, Supantha Pandit, Sasanka Roy:
Balanced Connected Graph Partition. CALDAM 2021: 487-499 - [c20]Ankush Acharyya, Vahideh Keikha, Diptapriyo Majumdar, Supantha Pandit:
Constrained Hitting Set Problem with Intervals. COCOON 2021: 604-616 - [c19]Barun Gorain, Kaushik Mondal, Himadri Nayak, Supantha Pandit:
Pebble Guided Near Optimal Treasure Hunt in Anonymous Graphs. SIROCCO 2021: 222-239 - [c18]Barun Gorain, Kaushik Mondal, Supantha Pandit:
Distributed Independent Sets in Interval and Segment Intersection Graphs. SOFSEM 2021: 175-188 - [c17]Raghunath Reddy Madireddy, Subhas C. Nandy, Supantha Pandit:
On the Geometric Red-Blue Set Cover Problem. WALCOM 2021: 129-141 - [i7]Barun Gorain, Kaushik Mondal, Himadri Nayak, Supantha Pandit:
Pebble Guided Near Optimal Treasure Hunt in Anonymous Graphs. CoRR abs/2103.05933 (2021) - 2020
- [j7]Ankush Acharyya, Minati De, Subhas C. Nandy, Supantha Pandit:
Variations of largest rectangle recognition amidst a bichromatic point set. Discret. Appl. Math. 286: 35-50 (2020) - [j6]Amit Kumar Dhar, Raghunath Reddy Madireddy, Supantha Pandit, Jagpreet Singh:
Maximum independent and disjoint coverage. J. Comb. Optim. 39(4): 1017-1037 (2020) - [j5]Satyabrata Jana, Supantha Pandit:
Covering and packing of rectilinear subdivision. Theor. Comput. Sci. 840: 166-176 (2020) - [c16]Joseph S. B. Mitchell, Supantha Pandit:
Packing and Covering with Segments. WALCOM 2020: 198-210
2010 – 2019
- 2019
- [j4]Ankush Acharyya, Subhas C. Nandy, Supantha Pandit, Sasanka Roy:
Covering segments with unit squares. Comput. Geom. 79: 1-13 (2019) - [j3]Anisur Rahaman Molla, Supantha Pandit, Sasanka Roy:
Optimal deterministic distributed algorithms for maximal independent set in geometric graphs. J. Parallel Distributed Comput. 132: 36-47 (2019) - [c15]Sujoy Bhore, Sourav Chakraborty, Satyabrata Jana, Joseph S. B. Mitchell, Supantha Pandit, Sasanka Roy:
The Balanced Connected Subgraph Problem. CALDAM 2019: 201-215 - [c14]Supantha Pandit:
Covering and Packing of Triangles Intersecting a Straight Line. CALDAM 2019: 216-230 - [c13]Sujoy Bhore, Satyabrata Jana, Supantha Pandit, Sasanka Roy:
Balanced Connected Subgraph Problem in Geometric Intersection Graphs. COCOA 2019: 56-68 - [c12]Joseph S. B. Mitchell, Supantha Pandit:
New Results on a Family of Geometric Hitting Set Problems in the Plane. COCOA 2019: 387-399 - [c11]Supantha Pandit:
On the Hardness of Some Geometric Optimization Problems with Rectangles. COCOA 2019: 425-436 - [c10]Amit Kumar Dhar, Raghunath Reddy Madireddy, Supantha Pandit, Jagpreet Singh:
Maximum Independent and Disjoint Coverage. TAMC 2019: 134-153 - [c9]Satyabrata Jana, Supantha Pandit:
Covering and Packing of Rectilinear Subdivision. WALCOM 2019: 381-393 - [c8]Joseph S. B. Mitchell, Supantha Pandit:
Minimum Membership Covering and Hitting. WALCOM 2019: 394-406 - [i6]Ankush Acharyya, Minati De, Subhas C. Nandy, Supantha Pandit:
Variations of largest rectangle recognition amidst a bichromatic point set. CoRR abs/1905.07124 (2019) - [i5]Sujoy Bhore, Satyabrata Jana, Supantha Pandit, Sasanka Roy:
Balanced Connected Subgraph Problem in Geometric Intersection Graphs. CoRR abs/1909.03872 (2019) - 2018
- [c7]Raghunath Reddy Madireddy, Apurva Mudgal, Supantha Pandit:
Hardness Results and Approximation Schemes for Discrete Packing and Domination Problems. COCOA 2018: 421-435 - [i4]Satyabrata Jana, Supantha Pandit:
Covering and Packing of Rectilinear Subdivision. CoRR abs/1809.07214 (2018) - [i3]Sujoy Bhore, Sourav Chakraborty, Satyabrata Jana, Joseph S. B. Mitchell, Supantha Pandit, Sasanka Roy:
The Balanced Connected Subgraph Problem. CoRR abs/1809.08856 (2018) - 2017
- [j2]Subhas C. Nandy, Supantha Pandit, Sasanka Roy:
Faster approximation for maximum independent set on unit disk graph. Inf. Process. Lett. 127: 58-61 (2017) - [c6]Subhas C. Nandy, Supantha Pandit, Sasanka Roy:
Covering Points: Minimizing the Maximum Depth. CCCG 2017: 37-42 - [c5]Supantha Pandit:
Dominating Set of Rectangles Intersecting a Straight Line. CCCG 2017: 144-149 - [c4]Ankush Acharyya, Subhas C. Nandy, Supantha Pandit, Sasanka Roy:
Covering Segments with Unit Squares. WADS 2017: 1-12 - 2016
- [j1]Apurva Mudgal, Supantha Pandit:
Geometric hitting set, set cover and generalized class cover problems with half-strips in opposite directions. Discret. Appl. Math. 211: 143-162 (2016) - [i2]Ankush Acharyya, Subhas C. Nandy, Supantha Pandit, Sasanka Roy:
Covering segments with axis-parallel unit squares. CoRR abs/1607.07256 (2016) - [i1]Subhas C. Nandy, Supantha Pandit, Sasanka Roy:
Faster Approximation for Maximum Independent Set on Unit Disk Graph. CoRR abs/1611.03260 (2016) - 2015
- [c3]Apurva Mudgal, Supantha Pandit:
Covering, Hitting, Piercing and Packing Rectangles Intersecting an Inclined Line. COCOA 2015: 126-137 - 2014
- [c2]Apurva Mudgal, Supantha Pandit:
Geometric Hitting Set and Set Cover Problem with Half-Strips. CCCG 2014 - [c1]Apurva Mudgal, Supantha Pandit:
Generalized Class Cover Problem with Axis-Parallel Strips. WALCOM 2014: 8-21
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
