Stop the war!Остановите войну!
for scientists:
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
- 2023
[j74]Ritesh Seth, Anil Maheshwari, Subhas C. Nandy:
Acrophobic guard watchtower problem. Comput. Geom. 109: 101918 (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 K. 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 K. 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]