default search action
Subhas C. Nandy
- > Home > Persons > Subhas C. Nandy
Publications
- 2013
- [j44]John Augustine, Sandip Das, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy, Swami Sarvattomananda:
Localized geometric query problems. Comput. Geom. 46(3): 340-357 (2013) - [j40]Arindam Karmakar, Sandip Das, Subhas C. Nandy, Binay K. Bhattacharya:
Some variations on constrained minimum enclosing circle problem. J. Comb. Optim. 25(2): 176-190 (2013) - 2011
- [i3]John Augustine, Sandip Das, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy, Swami Sarvattomananda:
Localized Geometric Query Problems. CoRR abs/1111.2918 (2011) - 2010
- [j34]Gautam K. Das, Sandip Das, Subhas C. Nandy:
Homogeneous 2-hop broadcast in 2D. Comput. Geom. 43(2): 182-190 (2010) - [c37]Arindam Karmakar, Sandip Das, Subhas C. Nandy, Binay K. Bhattacharya:
Some Variations on Constrained Minimum Enclosing Circle Problem. COCOA (1) 2010: 354-368 - [c36]Arijit Bishnu, Sandip Das, Subhas C. Nandy, Bhargab B. Bhattacharya:
A Simple Algorithm for Approximate Partial Point Set Pattern Matching under Rigid Motion. WALCOM 2010: 102-112 - [i2]John Augustine, Sandip Das, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy, Swami Sarvattomananda:
Recognizing the Largest Empty Circle and Axis-Parallel Rectangle in a Desired Location. CoRR abs/1004.0558 (2010) - 2009
- [j31]Sasanka Roy, Arindam Karmakar, Sandip Das, Subhas C. Nandy:
Constrained minimum enclosing circle with center on a query line segment. Comput. Geom. 42(6-7): 632-638 (2009) - [j30]Sandip Das, Partha P. Goswami, Subhas C. Nandy:
Smallest Color-Spanning Object Revisited. Int. J. Comput. Geom. Appl. 19(5): 457-478 (2009) - [j29]Sasanka Roy, Subhasis Bhattacharjee, Sandip Das, Subhas C. Nandy:
A new fast heuristic for labeling points. Inf. Process. Lett. 109(10): 478-484 (2009) - [j27]Pritha Banerjee, Susmita Sur-Kolay, Arijit Bishnu, Sandip Das, Subhas C. Nandy, Subhasis Bhattacharjee:
FPGA placement using space-filling curves: Theory meets practice. ACM Trans. Embed. Comput. Syst. 9(2): 12:1-12:23 (2009) - 2008
- [j26]Gautam K. Das, Sasanka Roy, Sandip Das, Subhas C. Nandy:
Variations of Base-Station Placement Problem on the Boundary of a Convex Region. Int. J. Found. Comput. Sci. 19(2): 405-427 (2008) - 2007
- [j23]Sasanka Roy, Sandip Das, Subhas C. Nandy:
Shortest monotone descent path problem in polyhedral terrain. Comput. Geom. 37(2): 115-133 (2007) - [j21]Partha P. Goswami, Sandip Das, Subhas C. Nandy:
Chromatic distribution of k-nearest neighbors of a line segment in a planar colored point set. Inf. Process. Lett. 102(4): 163-168 (2007) - [c32]Gautam K. Das, Sasanka Roy, Sandip Das, Subhas C. Nandy:
Base Station Placement Problem on the Boundary of a Convex Region. WALCOM 2007: 151-152 - 2006
- [j20]Gautam K. Das, Sandip Das, Subhas C. Nandy, Bhabani P. Sinha:
Efficient algorithm for placing a given number of base stations to cover a convex region. J. Parallel Distributed Comput. 66(11): 1353-1358 (2006) - [j19]Arijit Bishnu, Sandip Das, Subhas C. Nandy, Bhargab B. Bhattacharya:
Simple algorithms for partial point set pattern matching under rigid motion. Pattern Recognit. 39(9): 1662-1671 (2006) - [j18]Gautam K. Das, Sandip Das, Subhas C. Nandy:
Range assignment for energy efficient broadcasting in linear radio networks. Theor. Comput. Sci. 352(1-3): 332-341 (2006) - [c30]Gautam K. Das, Sandip Das, Subhas C. Nandy:
Homogeneous 2-Hops Broadcast in 2D. ICCSA (2) 2006: 750-759 - [c29]Sasanka Roy, Arindam Karmakar, Sandip Das, Subhas C. Nandy:
Constrained Minimum Enclosing Circle with Center on a Query Line Segment. MFCS 2006: 765-776 - 2005
- [j17]Sandip Das, Partha P. Goswami, Subhas C. Nandy:
Smallest k-point enclosing rectangle and square of arbitrary orientation. Inf. Process. Lett. 94(6): 259-266 (2005) - [c28]Sasanka Roy, Subhasis Bhattacharjee, Sandip Das, Subhas C. Nandy:
A Fast Algorithm for Point Labeling Problem. CCCG 2005: 155-158 - [c27]Pritha Banerjee, Subhasis Bhattacharjee, Susmita Sur-Kolay, Sandip Das, Subhas C. Nandy:
Fast FPGA Placement using Space-filling Curve. FPL 2005: 415-420 - [c26]Sandip Das, Partha P. Goswami, Subhas C. Nandy:
Recognition of Minimum Width Color-Spanning Corridor and Minimum Area Color-Spanning Rectangle. ICCSA (1) 2005: 827-837 - [c25]Gautam K. Das, Sandip Das, Subhas C. Nandy, Bhabani P. Sinha:
Placing a Given Number of Base Stations to Cover a Convex Region. IWDC 2005: 57-62 - [c24]Sasanka Roy, Sandip Das, Subhas C. Nandy:
Shortest Monotone Descent Path Problem in Polyhedral Terrain. STACS 2005: 281-292 - 2004
- [j16]Partha P. Goswami, Sandip Das, Subhas C. Nandy:
Triangular range counting query in 2D and its application in finding k nearest neighbors of a line segment. Comput. Geom. 29(3): 163-175 (2004) - [j15]Sasanka Roy, Partha P. Goswami, Sandip Das, Subhas C. Nandy:
Optimal algorithm for a special point-labeling problem. Inf. Process. Lett. 89(2): 91-98 (2004) - [c22]Sandip Das, Partha P. Goswami, Subhas C. Nandy:
Smallest k point enclosing rectangle of arbitrary orientation. CCCG 2004: 116-119 - [c20]Gautam K. Das, Sandip Das, Subhas C. Nandy:
Efficient Algorithm for Energy Efficient Broadcasting in Linear Radio Networks. HiPC 2004: 420-429 - [c19]Sasanka Roy, Sandip Das, Subhas C. Nandy:
A Practical Algorithm for Approximating Shortest Weighted Path between a Pair of Points on Polyhedral Surface. ICCSA (3) 2004: 42-52 - 2003
- [j12]Jeet Chaudhuri, Subhas C. Nandy, Sandip Das:
Largest empty rectangle among a point set. J. Algorithms 46(1): 54-78 (2003) - [j11]Subhas C. Nandy, Sandip Das, Partha P. Goswami:
An efficient k nearest neighbors searching algorithm for a query line. Theor. Comput. Sci. 299(1-3): 273-288 (2003) - [c16]Arijit Bishnu, Sandip Das, Subhas C. Nandy, Bhargab B. Bhattacharya:
An Improved Algorithm for Point Set Pattern Matching under Rigid Motion. CIAC 2003: 36-45 - 2002
- [c15]Partha P. Goswami, Sandip Das, Subhas C. Nandy:
Simplex Range Searching and k Nearest Neighbors of a Line Segment in 2D. SWAT 2002: 69-79 - [c14]Sasanka Roy, Partha P. Goswami, Sandip Das, Subhas C. Nandy:
Optimal Algorithm for a Special Point-Labeling Problem. SWAT 2002: 110-120 - 1999
- [c7]Sandip Das, Subhas C. Nandy, Bhargab B. Bhattacharya:
High Performance MCM Routing: A New Approach. VLSI Design 1999: 564-569
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-08-05 21:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint