default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSubhas C. Nandy
Person information
- affiliation: Indian Statistical Institute, India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c75]Aritra Banik, Sayani Das, Anil Maheshwari, Bubai Manna, Subhas C. Nandy, Krishna Priya K. M., Bodhayan Roy, Sasanka Roy, Abhishek Sahu:
Minimum Consistent Subset in Trees and Interval Graphs. FSTTCS 2024: 7:1-7:15- [i24]Aritra Banik, Sayani Das, Anil Maheshwari, Bubai Manna, Subhas C. Nandy, Krishna Priya K. M., Bodhayan Roy, Sasanka Roy, Abhishek Sahu:
Minimum Consistent Subset in Trees and Interval Graphs. CoRR abs/2404.15487 (2024) - 2023
- [j76]Sanjana Dey, Florent Foucaud, Subhas C. Nandy, Arunabha Sen:
Complexity and Approximation for Discriminating and Identifying Code Problems in Geometric Setups. Algorithmica 85(7): 1850-1882 (2023) - [j75]Ritesh Seth, Anil Maheshwari, Subhas C. Nandy:
Acrophobic guard watchtower problem. Comput. Geom. 109: 101918 (2023) - [j74]Sanjana Dey, Anil Maheshwari, Subhas C. Nandy:
Minimum consistent subset of simple graph classes. Discret. Appl. Math. 338: 255-277 (2023) - 2022
- [j73]Seok-Hee Hong, Subhas C. Nandy, Ryuhei Uehara:
Guest Editors' Foreword. J. Graph Algorithms Appl. 26(2): 207-208 (2022) - [c74]Raghunath Reddy Madireddy, Subhas C. Nandy, Supantha Pandit:
Exact Algorithms and Hardness Results for Geometric Red-Blue Hitting Set Problem. FAW 2022: 176-191 - [c73]Nandhana Duraisamy, Hannah Miller Hillberg
, Ramesh K. Jallu, Erik Krohn, Anil Maheshwari, Subhas C. Nandy, Alex Pahlow:
Half-Guarding Weakly-Visible Polygons and Terrains. FSTTCS 2022: 18:1-18:17 - [c72]Nilanjana Karmakar, Arindam Biswas, Subhas C. Nandy, Bhargab B. Bhattacharya:
On the Construction of Planar Embedding for a Class of Orthogonal Polyhedra. IWCIA 2022: 84-104 - 2021
- [j72]Swati Goswami, Asit Kumar Das, Subhas C. Nandy:
Sparsity of weighted networks: Measures and applications. Inf. Sci. 577: 557-578 (2021) - [j71]Manjanna Basappa, Ramesh K. Jallu, Gautam K. Das, Subhas C. Nandy:
The Euclidean k-supplier problem in IR2. Oper. Res. Lett. 49(1): 48-54 (2021) - [j70]Ankush Acharyya, Anil Maheshwari, Subhas C. Nandy:
Color-spanning localized query. Theor. Comput. Sci. 861: 85-101 (2021) - [j69]Gautam Kumar Das, Subhas C. Nandy, M. Sohel Rahman:
Algorithms and Discrete Mathematics - celebrating the silver jubilee of IITG Guwahati. Theor. Comput. Sci. 864: 139-140 (2021) - [c71]Sanjana Dey, Anil Maheshwari, Subhas C. Nandy:
Minimum Consistent Subset of Simple Graph Classes. CALDAM 2021: 471-484 - [c70]Ritesh Seth, Anil Maheshwari, Subhas C. Nandy:
An Acrophobic Guard Watchtower Problem on Terrains. CCCG 2021: 351-361 - [c69]Sanjana Dey, Anil Maheshwari, Subhas C. Nandy:
Minimum Consistent Subset Problem for Trees. FCT 2021: 204-216 - [c68]Raghunath Reddy Madireddy, Subhas C. Nandy, Supantha Pandit:
On the Geometric Red-Blue Set Cover Problem. WALCOM 2021: 129-141 - [e1]Ryuhei Uehara, Seok-Hee Hong, Subhas C. Nandy:
WALCOM: Algorithms and Computation - 15th International Conference and Workshops, WALCOM 2021, Yangon, Myanmar, February 28 - March 2, 2021, Proceedings. Lecture Notes in Computer Science 12635, Springer 2021, ISBN 978-3-030-68210-1 [contents] - [i23]Sanjana Dey, Ramesh K. Jallu, Subhas C. Nandy:
On the minimum spanning tree problem in imprecise set-up. CoRR abs/2104.04229 (2021) - 2020
- [j68]Sandip Banerjee, Neeldhara Misra, Subhas C. Nandy:
Color spanning objects: Algorithms and hardness results. Discret. Appl. Math. 280: 14-22 (2020) - [j67]Binay K. Bhattacharya, Minati De, Subhas C. Nandy, Sasanka Roy:
Constant work-space algorithms for facility location problems. Discret. Appl. Math. 283: 456-472 (2020) - [j66]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) - [j65]Sanjib Sadhu, Sasanka Roy, Soumen Nandi, Subhas C. Nandy, Suchismita Roy:
Efficient Algorithm for Computing the Triangle Maximizing the Length of Its Smallest Side Inside a Convex Polygon. Int. J. Found. Comput. Sci. 31(4): 421-443 (2020) - [j64]Ankush Acharyya, Minati De, Subhas C. Nandy, Bodhayan Roy:
Range assignment of base-stations maximizing coverage area without interference. Theor. Comput. Sci. 804: 81-97 (2020) - [j63]Sanjib Sadhu, Xiaozhou He, Sasanka Roy, Subhas C. Nandy, Suchismita Roy:
Corrigendum to: "Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares" [Theor. Comput. Sci. 769 (2019) 63-74]. Theor. Comput. Sci. 806: 632-640 (2020) - [c67]Sanjana Dey, Florent Foucaud, Subhas C. Nandy, Arunabha Sen:
Discriminating Codes in Geometric Setups. ISAAC 2020: 24:1-24:16 - [i22]Sangram Kishor Jena, Ramesh K. Jallu, Gautam K. Das, Subhas C. Nandy:
The Generalized Independent and Dominating Set Problems on Unit Disk Graphs. CoRR abs/2006.15381 (2020) - [i21]Swati Goswami, Asit Kumar Das, Subhas C. Nandy:
Sparsity of weighted networks: measures and applications. CoRR abs/2009.06310 (2020) - [i20]Sanjana Dey, Florent Foucaud, Subhas C. Nandy, Arunabha Sen:
Discriminating Codes in Geometric Setups. CoRR abs/2009.10353 (2020)
2010 – 2019
- 2019
- [j62]Ankush Acharyya, Subhas C. Nandy, Supantha Pandit, Sasanka Roy:
Covering segments with unit squares. Comput. Geom. 79: 1-13 (2019) - [j61]Sanjib Sadhu, Sasanka Roy, Soumen Nandi, Anil Maheshwari, Subhas C. Nandy:
Two-center of the Convex Hull of a Point Set: Dynamic Model, and Restricted Streaming Model. Fundam. Informaticae 164(1): 119-138 (2019) - [j60]Gregory Bint, Anil Maheshwari, Michiel H. M. Smid, Subhas C. Nandy:
Partial Enclosure Range Searching. Int. J. Comput. Geom. Appl. 29(1): 73-93 (2019) - [j59]Sudip Poddar, Sukanta Bhattacharjee, Subhas C. Nandy, Krishnendu Chakrabarty, Bhargab B. Bhattacharya:
Optimization of Multi-Target Sample Preparation On-Demand With Digital Microfluidic Biochips. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 38(2): 253-266 (2019) - [j58]Sanjib Sadhu, Sasanka Roy, Subhas C. Nandy, Suchismita Roy:
Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares. Theor. Comput. Sci. 769: 63-74 (2019) - [c66]Ankush Acharyya, Anil Maheshwari, Subhas C. Nandy:
Localized Query: Color Spanning Variations. CALDAM 2019: 150-160 - [c65]Kaustav Basu, Sanjana Dey, Subhas C. Nandy, Arunabha Sen:
Sensor Networks for Structural Health Monitoring of Critical Infrastructures Using Identifying Codes. DRCN 2019: 43-50 - [i19]Ankush Acharyya, Anil Maheshwari, Subhas C. Nandy:
Color spanning Localized query. CoRR abs/1905.05066 (2019) - [i18]Ankush Acharyya, Minati De, Subhas C. Nandy, Supantha Pandit:
Variations of largest rectangle recognition amidst a bichromatic point set. CoRR abs/1905.07124 (2019) - [i17]Sanjib Sadhu, Xiaozhou He, Sasanka Roy, Subhas C. Nandy, Suchismita Roy:
Corrigendum to: "Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares", Theoretical Computer Science 769 (2019) 63-74. CoRR abs/1909.09445 (2019) - 2018
- [j57]Anil Maheshwari, Subhas C. Nandy, Drimit Pattanayak, Sasanka Roy, Michiel H. M. Smid:
Geometric Path Problems with Violations. Algorithmica 80(2): 448-471 (2018) - [j56]Ankush Acharyya, Subhas C. Nandy, Sasanka Roy:
Minimum width color spanning annulus. Theor. Comput. Sci. 725: 16-30 (2018) - [c64]Sanjana Dey, Ramesh K. Jallu, Subhas C. Nandy:
Minimum Spanning Tree of Line Segments. COCOON 2018: 529-541 - [c63]Sangram Kishor Jena, Ramesh K. Jallu, Gautam K. Das, Subhas C. Nandy:
The Maximum Distance-d Independent Set Problem on Unit Disk Graphs. FAW 2018: 68-80 - [c62]Nitesh Tripathi, Manjish Pal, Minati De, Gautam K. Das, Subhas C. Nandy:
Guarding Polyhedral Terrain by k-Watchtowers. FAW 2018: 112-125 - 2017
- [j55]Ahmad Biniaz, Anil Maheshwari, Subhas C. Nandy, Michiel H. M. Smid:
An optimal algorithm for plane matchings in multipartite geometric graphs. Comput. Geom. 63: 1-9 (2017) - [j54]Binay K. Bhattacharya, Minati De, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy:
Rectilinear path problems in restricted memory setup. Discret. Appl. Math. 228: 80-87 (2017) - [j53]Subhas C. Nandy, Supantha Pandit, Sasanka Roy:
Faster approximation for maximum independent set on unit disk graph. Inf. Process. Lett. 127: 58-61 (2017) - [c61]Subhas C. Nandy, Supantha Pandit, Sasanka Roy:
Covering Points: Minimizing the Maximum Depth. CCCG 2017: 37-42 - [c60]Ankush Acharyya, Minati De, Subhas C. Nandy:
Range Assignment of Base-Stations Maximizing Coverage Area without Interference. CCCG 2017: 126-131 - [c59]Sanjib Sadhu, Sasanka Roy, Subhas C. Nandy, Suchismita Roy:
Optimal Covering and Hitting of Line Segments by Two Axis-Parallel Squares. COCOON 2017: 457-468 - [c58]Sanjib Sadhu, Sasanka Roy, Soumen Nandi, Subhas C. Nandy, Suchismita Roy:
Computing the Triangle Maximizing the Length of Its Smallest Side Inside a Convex Polygon. ICCSA (2) 2017: 509-524 - [c57]Ankush Acharyya, Subhas C. Nandy, Supantha Pandit, Sasanka Roy:
Covering Segments with Unit Squares. WADS 2017: 1-12 - [i16]Ankush Acharyya, Minati De, Subhas C. Nandy, Bodhayan Roy:
Range Assignment of Base-Stations Maximizing Coverage Area without Interference. CoRR abs/1705.09346 (2017) - [i15]Sanjib Sadhu, Sasanka Roy, Subhas C. Nandy, Suchismita Roy:
A linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares. CoRR abs/1709.04870 (2017) - [i14]Naoki Katoh, Hee-Kap Ahn, Subhas C. Nandy:
Geometric Graphs: Theory and Applications (NII Shonan Meeting 2017-16). NII Shonan Meet. Rep. 2017 (2017) - 2016
- [j52]Binay K. Bhattacharya, Subhas C. Nandy, Sasanka Roy:
Space-efficient algorithm for computing a centerpoint of a set of points in R2. Theor. Comput. Sci. 615: 61-70 (2016) - [c56]Manjanna Basappa, Ramesh K. Jallu, Gautam K. Das, Subhas C. Nandy:
The Euclidean k-Supplier Problem in. ALGOSENSORS 2016: 129-140 - [c55]Sandip Banerjee, Neeldhara Misra, Subhas C. Nandy:
Color Spanning Objects: Algorithms and Hardness Results. CALDAM 2016: 37-48 - [c54]Ankush Acharyya, Subhas C. Nandy, Sasanka Roy:
Minimum Width Color Spanning Annulus. COCOON 2016: 431-442 - [i13]Aniket Basu Roy, Anil Maheshwari, Sathish Govindarajan, Neeldhara Misra, Subhas C. Nandy, Shreyas Shetty:
The Runaway Rectangle Escape Problem. CoRR abs/1603.04210 (2016) - [i12]Ankush Acharyya, Subhas C. Nandy, Supantha Pandit, Sasanka Roy:
Covering segments with axis-parallel unit squares. CoRR abs/1607.07256 (2016) - [i11]Ankush Acharyya, Subhas C. Nandy, Sasanka Roy:
Color Spanning Annulus: Square, Rectangle and Equilateral Triangle. CoRR abs/1609.04148 (2016) - [i10]Subhas C. Nandy, Supantha Pandit, Sasanka Roy:
Faster Approximation for Maximum Independent Set on Unit Disk Graph. CoRR abs/1611.03260 (2016) - 2015
- [j51]Paz Carmi, Gautam K. Das, Ramesh K. Jallu, Subhas C. Nandy, Prajwal R. Prasad, Yael Stein:
Minimum Dominating Set Problem for Unit Disks Revisited. Int. J. Comput. Geom. Appl. 25(3): 227- (2015) - [j50]Gautam K. Das, Minati De, Sudeshna Kolay, Subhas C. Nandy, Susmita Sur-Kolay:
Approximation algorithms for maximum independent set of a unit disk graph. Inf. Process. Lett. 115(3): 439-446 (2015) - [j49]Minati De, Subhas C. Nandy, Sasanka Roy:
Prune-and-search with limited workspace. J. Comput. Syst. Sci. 81(2): 398-414 (2015) - [c53]Binay K. Bhattacharya, Minati De, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy:
Rectilinear Path Problems in Restricted Memory Setup. CALDAM 2015: 69-80 - [c52]Arijit Bishnu, Amit Chakrabarti, Subhas C. Nandy, Sandeep Sen:
On Density, Threshold and Emptiness Queries for Intervals in the Streaming Model. FSTTCS 2015: 336-349 - [c51]Debapriyay Mukhopadhyay, Subhas C. Nandy:
YAHMD - Yet another heap memory debugger. ReTIS 2015: 144-150 - [c50]Ahmad Biniaz, Anil Maheshwari, Subhas C. Nandy, Michiel H. M. Smid:
An Optimal Algorithm for Plane Matchings in Multipartite Geometric Graphs. WADS 2015: 66-78 - [i9]Sanjib Sadhu, Sasanka Roy, Soumen Nandi, Anil Maheshwari, Subhas C. Nandy:
Approximation algorithms for the two-center problem of convex polygon. CoRR abs/1512.02356 (2015) - 2014
- [j48]Minati De, Subhas C. Nandy, Sasanka Roy:
In-place algorithms for computing a largest clique in geometric intersection graphs. Discret. Appl. Math. 178: 58-70 (2014) - [j47]Debapriyay Mukhopadhyay, Subhas C. Nandy:
Efficient multiple-precision integer division algorithm. Inf. Process. Lett. 114(3): 152-157 (2014) - [j46]Dinesh Dash, Arobinda Gupta, Arijit Bishnu, Subhas C. Nandy:
Line coverage measures in wireless sensor networks. J. Parallel Distributed Comput. 74(7): 2596-2614 (2014) - [c49]Binay K. Bhattacharya, Minati De, Subhas C. Nandy, Sasanka Roy:
Maximum Independent Set for Interval Graphs and Trees in Space Efficient Models. CCCG 2014 - [c48]Binay K. Bhattacharya, Subhas C. Nandy, Sasanka Roy:
Space-Efficient Algorithm for Computing a Centerpoint of a Point Set in R^2. CCCG 2014 - [i8]Binay K. Bhattacharya, Minati De, Subhas C. Nandy, Sasanka Roy:
Facility location problems in the constant work-space read-only memory model. CoRR abs/1409.4092 (2014) - 2013
- [j45]Minati De, Anil Maheshwari, Subhas C. Nandy, Michiel H. M. Smid:
An in-place min-max priority search tree. Comput. Geom. 46(3): 310-327 (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) - [j43]Arindam Khan, Sudebkumar Prasant Pal, Mridul Aanjaneya, Arijit Bishnu, Subhas C. Nandy:
Diffuse reflection diameter and radius for convex-quadrilateralizable polygons. Discret. Appl. Math. 161(10-11): 1496-1505 (2013) - [j42]Bhaswar B. Bhattacharya, Subhas C. Nandy:
New variations of the maximum coverage facility location problem. Eur. J. Oper. Res. 224(3): 477-485 (2013) - [j41]Minati De, Gautam K. Das, Paz Carmi, Subhas C. Nandy:
Approximation Algorithms for a Variant of discrete Piercing Set Problem for Unit Disks. Int. J. Comput. Geom. Appl. 23(6): 461- (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) - [j39]Dinesh Dash, Arijit Bishnu, Arobinda Gupta, Subhas C. Nandy:
Approximation algorithms for deployment of sensors for line segment coverage in wireless sensor networks. Wirel. Networks 19(5): 857-870 (2013) - 2012
- [j38]Subhas C. Nandy, Sandeep Sen:
Preface. Theor. Comput. Sci. 442: 1 (2012) - [j37]Subir Kumar Ghosh, Partha P. Goswami, Anil Maheshwari, Subhas C. Nandy, Sudebkumar Prasant Pal, Swami Sarvattomananda:
Algorithms for computing diffuse reflection paths in polygons. Vis. Comput. 28(12): 1229-1237 (2012) - [c47]Minati De, Subhas C. Nandy, Sasanka Roy:
In-Place Algorithms for Computing a Largest Clique in Geometric Intersection Graphs. FAW-AAIM 2012: 327-338 - [c46]Dinesh Dash, Arijit Bishnu, Arobinda Gupta, Subhas C. Nandy:
Approximation algorithms for deployment of sensors for line segment coverage in wireless sensor networks. COMSNETS 2012: 1-10 - [c45]Minati De, Subhas C. Nandy, Sasanka Roy:
Minimum Enclosing Circle with Few Extra Variables. FSTTCS 2012: 510-521 - [c44]Dinesh Dash, Arijit Bishnu, Arobinda Gupta, Subhas C. Nandy:
Finding the Quality of Line Coverage of a Sensor Network - (Poster Paper). ICDCN 2012: 214-217 - [i7]Minati De, Anil Maheshwari, Subhas C. Nandy:
Space-efficient Algorithms for Visibility Problems in Simple Polygon. CoRR abs/1204.2634 (2012) - [i6]Ritankar Mandal, Anirban Ghosh, Sasanka Roy, Subhas C. Nandy:
Greedy is good: An experimental study on minimum clique cover and maximum independent set problems for randomly generated rectangles. CoRR abs/1212.0640 (2012) - [i5]Minati De, Subhas C. Nandy, Sasanka Roy:
Convex Hull and Linear Programming in Read-only Setup with Limited Work-space. CoRR abs/1212.5353 (2012) - 2011
- [j36]Debashis Mondal, Abhay Kumar, Arijit Bishnu, Krishnendu Mukhopadhyaya, Subhas C. Nandy:
Measuring the Quality of Surveillance in a Wireless Sensor Network. Int. J. Found. Comput. Sci. 22(4): 983-998 (2011) - [j35]Mustaq Ahmed, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy:
On the number of shortest descending paths on the surface of a convex terrain. J. Discrete Algorithms 9(2): 182-189 (2011) - [c43]Minati De, Gautam K. Das, Subhas C. Nandy:
Approximation Algorithms for the Discrete Piercing Set Problem for Unit Disks. CCCG 2011 - [c42]Minati De, Anil Maheshwari, Subhas C. Nandy, Michiel H. M. Smid:
An In-Place Priority Search Tree. CCCG 2011 - [c41]Minati De, Subhas C. Nandy:
Space-efficient Algorithms for Empty Space Recognition among a Point Set in 2D and 3D. CCCG 2011 - [i4]Minati De, Subhas C. Nandy:
Inplace Algorithm for Priority Search Tree and its use in Computing Largest Empty Axis-Parallel Rectangle. CoRR abs/1104.3076 (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) - [j33]Subhashis Majumder, Subhas C. Nandy, Bhargab B. Bhattacharya:
Separating Multi-Color Points on a Plane with Fewest Axis-Parallel Lines. Fundam. Informaticae 99(3): 315-324 (2010) - [j32]Subhas C. Nandy, Krishnendu Mukhopadhyaya, Bhargab B. Bhattacharya:
Recognition of largest empty orthoconvex polygon in a point set. Inf. Process. Lett. 110(17): 746-752 (2010) - [c40]Gautam K. Das, Asish Mukhopadhyay, Subhas C. Nandy, Sangameswar Patil, S. V. Rao:
Computing the straight skeleton of a monotone polygon in O(n log n) time. CCCG 2010: 207-210 - [c39]Bhaswar B. Bhattacharya, Subhas C. Nandy:
New variations of the reverse facility location problem. CCCG 2010: 241-244 - [c38]Sanjib Sadhu, Arijit Bishnu, Subhas C. Nandy, Partha P. Goswami:
Cluster connecting problem inside a polygon. CCCG 2010: 265-268 - [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) - [i1]Dinesh Dash, Arijit Bishnu, Arobinda Gupta, Subhas C. Nandy:
Approximation Algorithm for Line Segment Coverage for Wireless Sensor Network. CoRR abs/1006.2955 (2010)
2000 – 2009
- 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) - [j28]Gautam K. Das, Debapriyay Mukhopadhyay, Subhas C. Nandy:
Improved algorithm for the widest empty 1-corner corridor. Inf. Process. Lett. 109(18): 1060-1065 (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) - [c35]Subir Kumar Ghosh, Partha P. Goswami, Anil Maheshwari, Subhas C. Nandy, Sudebkumar Prasant Pal, Swami Sarvattomananda:
Algorithms for Computing Diffuse Reflection Paths in Polygons. WALCOM 2009: 47-58 - [c34]Gautam K. Das, Debapriyay Mukhopadhyay, Subhas C. Nandy:
Improved Algorithm for a Widest 1-Corner Corridor. WALCOM 2009: 83-92 - 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) - [j25]Gautam K. Das, Subhas C. Nandy:
Weighted broadcast in linear radio networks. Inf. Process. Lett. 106(4): 136-143 (2008) - [j24]Boris Aronov, Tetsuo Asano, Yosuke Kikuchi, Subhas C. Nandy, Shinji Sasahara, Takeaki Uno:
A Generalization of Magic Squares with Applications to Digital Halftoning. Theory Comput. Syst. 42(2): 143-156 (2008) - [c33]Subhas C. Nandy, Krishnendu Mukhopadhyaya, Bhargab B. Bhattacharya:
Recognition of Largest Empty Orthoconvex Polygon in a Point Set. CCCG 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) - [j22]Gautam K. Das, Sasthi C. Ghosh, Subhas C. Nandy:
Improved Algorithm for Minimum Cost Range Assignment Problem for Linear Radio Networks. Int. J. Found. Comput. Sci. 18(3): 619-635 (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) - [c31]Gautam K. Das, Subhas C. Nandy:
Weighted Broadcast in Linear Radio Networks. AAIM 2006: 343-353 - [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 - [c23]Subhashis Majumder, Susmita Sur-Kolay, Subhas C. Nandy, Bhargab B. Bhattacharya, B. Chakraborty:
Hot Spots and Zones in a Chip: A Geometrician's View. VLSI Design 2005: 691-696 - 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) - [j14]Subhashis Majumder, Subhas C. Nandy, Bhargab B. Bhattacharya:
On Finding A Staircase Channel With Minimum Crossing Nets In A VLSI Floorplan. J. Circuits Syst. Comput. 13(5): 1019-1038 (2004) - [c22]Sandip Das, Partha P. Goswami, Subhas C. Nandy:
Smallest k point enclosing rectangle of arbitrary orientation. CCCG 2004: 116-119 - [c21]Gautam K. Das, Sasthi C. Ghosh, Subhas C. Nandy:
An efficient heuristic algorithm for 2D h-hops range assignment problem. GLOBECOM 2004: 1051-1055 - [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 - [c18]Boris Aronov, Tetsuo Asano, Yosuke Kikuchi, Subhas C. Nandy, Shinji Sasahara, Takeaki Uno:
A Generalization of Magic Squares with Applications to Digital Halftoning. ISAAC 2004: 89-100 - [c17]Gautam K. Das, Sasthi C. Ghosh, Subhas C. Nandy:
Improved Algorithm for Minimum Cost Range Assignment Problem for Linear Radio Networks. IWDC 2004: 412-423 - 2003
- [j13]Subhas C. Nandy, Bhargab B. Bhattacharya:
On finding an empty staircase polygon of largest area (width) in a planar point-set. Comput. Geom. 26(2): 143-171 (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
- [j10]Tetsuo Asano, Antonio Hernández-Barrera, Subhas C. Nandy:
Translating a convex polyhedron over monotone polyhedra. Comput. Geom. 23(3): 257-269 (2002) - [j9]Subhas C. Nandy, Tetsuo Asano, Tomohiro Harayama:
Shattering a set of objects in 2D. Discret. Appl. Math. 122(1-3): 183-194 (2002) - [j8]Parthasarathi Dasgupta, Peichen Pan, Subhas C. Nandy, Bhargab B. Bhattacharya:
Monotone bipartitioning problem in a planar point set with applications to VLSI. ACM Trans. Design Autom. Electr. Syst. 7(2): 231-248 (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 - 2001
- [j7]Subhas C. Nandy, Tomohiro Harayama, Tetsuo Asano:
Dynamically maintaining the widest k-dense corridor. Theor. Comput. Sci. 255(1-2): 627-639 (2001) - [j6]Parthasarathi Dasgupta, Anup K. Sen, Subhas C. Nandy, Bhargab B. Bhattacharya:
Searching networks with unrestricted edge costs. IEEE Trans. Syst. Man Cybern. Part A 31(6): 497-507 (2001) - [c13]Subhashis Majumder, Susmita Sur-Kolay, Bhargab B. Bhattacharya, Subhas C. Nandy:
Area(number)-balanced hierarchy of staircase channels with minimum crossing nets. ISCAS (5) 2001: 395-398 - 2000
- [j5]Subhas C. Nandy, Bhargab B. Bhattacharya, Antonio Hernández-Barrera:
Safety Zone Problem. J. Algorithms 37(2): 538-569 (2000) - [c12]Subhas C. Nandy, Tomohiro Harayama, Tetsuo Asano:
Dynamically Maintaining the Widest k -Dense Corridor. CIAC 2000: 187-198 - [c11]Subhas C. Nandy:
An Efficient k Nearest Neighbor Searching Algorithm for a Query Line. COCOON 2000: 281-290
1990 – 1999
- 1999
- [c10]Subhas C. Nandy:
Shattering a set of objects in 2d. CCCG 1999 - [c9]Jeet Chaudhuri, Subhas C. Nandy:
Generalized Shooter Location Problem. COCOON 1999: 389-399 - [c8]Jeet Chaudhuri, Subhas C. Nandy:
Largest Empty Rectangle among a Point Set. FSTTCS 1999: 34-46 - [c7]Sandip Das, Subhas C. Nandy, Bhargab B. Bhattacharya:
High Performance MCM Routing: A New Approach. VLSI Design 1999: 564-569 - 1998
- [j4]Pinaki Mitra, Subhas C. Nandy:
Efficient Computation of Rectilinear Geodesic Voronoi Neighbor in the Presence of Obstacles. J. Algorithms 28(2): 315-338 (1998) - [c6]Subhashis Majumder, Subhas C. Nandy, Bhargab B. Bhattacharya:
Partitioning VLSI Floorplans by Staircase Channels for Global Routing. VLSI Design 1998: 59-64 - 1996
- [c5]Subhas C. Nandy, Krishnendu Mukhopadhyaya, Bhargab B. Bhattacharya:
Shooter Location Problem. CCCG 1996: 93-98 - [c4]Pinaki Mitra, Subhas C. Nandy:
Efficient Computation of Rectilinear Geodesic Voronoi Neighbor in Presence of Obstacles. FSTTCS 1996: 76-87 - [c3]Parthasarathi Dasgupta, Anup K. Sen, Subhas C. Nandy, Bhargab B. Bhattacharya:
Geometric bipartitioning problem and its applications to VLSI. VLSI Design 1996: 400-405 - 1994
- [c2]Subhas C. Nandy, Arani Sinha, Bhargab B. Bhattacharya:
Location of the Largest Empty Rectangle among Arbitrary Obstacles. FSTTCS 1994: 159-170 - 1990
- [j3]Thriyambakam Krishnan, Subhas C. Nandy:
Efficiency of discriminant analysis when initial samples are classified stochastically. Pattern Recognit. 23(5): 529-537 (1990) - [j2]Thriyambakam Krishnan, Subhas C. Nandy:
Efficiency of logistic-normal stochastic supervision. Pattern Recognit. 23(11): 1275-1279 (1990) - [c1]Subhas C. Nandy, Bhargab B. Bhattacharya, Sibabrata Ray:
Efficient algorithms for Identifying All Maximal Isothetic Empty Rectangles in VLSI Layout Design. FSTTCS 1990: 255-269
1980 – 1989
- 1987
- [j1]Thriyambakam Krishnan, Subhas C. Nandy:
Discriminant analysis with a stochastic supervisor. Pattern Recognit. 20(4): 379-384 (1987)
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 2025-01-20 23:03 CET 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:
