Subhas C. Nandy

ORCID

Publication Activity (10 Years)

Years Active: 1987-2024
Publications (10 Years): 61

Top Venues

Publications

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 (2024)
Sanjana Dey, Florent Foucaud, Subhas C. Nandy, Arunabha Sen
Complexity and Approximation for Discriminating and Identifying Code Problems in Geometric Setups. Algorithmica 85 (7) (2023)
Sanjana Dey, Anil Maheshwari, Subhas C. Nandy
Minimum consistent subset of simple graph classes. Discret. Appl. Math. 338 (2023)
Ritesh Seth, Anil Maheshwari, Subhas C. Nandy
Acrophobic guard watchtower problem. Comput. Geom. 109 (2023)
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)
Nilanjana Karmakar, Arindam Biswas, Subhas C. Nandy, Bhargab B. Bhattacharya
On the Construction of Planar Embedding for a Class of Orthogonal Polyhedra. IWCIA (2022)
Raghunath Reddy Madireddy, Subhas C. Nandy, Supantha Pandit
Exact Algorithms and Hardness Results for Geometric Red-Blue Hitting Set Problem. FAW (2022)
Seok-Hee Hong, Subhas C. Nandy, Ryuhei Uehara
Guest Editors' Foreword. J. Graph Algorithms Appl. 26 (2) (2022)
Raghunath Reddy Madireddy, Subhas C. Nandy, Supantha Pandit
On the Geometric Red-Blue Set Cover Problem. WALCOM (2021)
Ritesh Seth, Anil Maheshwari, Subhas C. Nandy
An Acrophobic Guard Watchtower Problem on Terrains. CCCG (2021)
Swati Goswami, Asit Kumar Das, Subhas C. Nandy
Sparsity of weighted networks: Measures and applications. Inf. Sci. 577 (2021)
Manjanna Basappa, Ramesh K. Jallu, Gautam K. Das, Subhas C. Nandy
The Euclidean k-supplier problem in IR2. Oper. Res. Lett. 49 (1) (2021)
Ankush Acharyya, Anil Maheshwari, Subhas C. Nandy
Color-spanning localized query. Theor. Comput. Sci. 861 (2021)
Sanjana Dey, Ramesh K. Jallu, Subhas C. Nandy
On the minimum spanning tree problem in imprecise set-up. CoRR (2021)
Sanjana Dey, Anil Maheshwari, Subhas C. Nandy
Minimum Consistent Subset of Simple Graph Classes. CALDAM (2021)
Sanjana Dey, Anil Maheshwari, Subhas C. Nandy
Minimum Consistent Subset Problem for Trees. FCT (2021)
Gautam Kumar Das, Subhas C. Nandy, M. Sohel Rahman
Algorithms and Discrete Mathematics - celebrating the silver jubilee of IITG Guwahati. Theor. Comput. Sci. 864 (2021)
Ankush Acharyya, Minati De, Subhas C. Nandy, Bodhayan Roy
Range assignment of base-stations maximizing coverage area without interference. Theor. Comput. Sci. 804 (2020)
Sanjana Dey, Florent Foucaud, Subhas C. Nandy, Arunabha Sen
Discriminating Codes in Geometric Setups. CoRR (2020)
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 (2020)
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) (2020)
Binay K. Bhattacharya, Minati De, Subhas C. Nandy, Sasanka Roy
Constant work-space algorithms for facility location problems. Discret. Appl. Math. 283 (2020)
Sandip Banerjee, Neeldhara Misra, Subhas C. Nandy
Color spanning objects: Algorithms and hardness results. Discret. Appl. Math. 280 (2020)
Swati Goswami, Asit Kumar Das, Subhas C. Nandy
Sparsity of weighted networks: measures and applications. CoRR (2020)
Ankush Acharyya, Minati De, Subhas C. Nandy, Supantha Pandit
Variations of largest rectangle recognition amidst a bichromatic point set. Discret. Appl. Math. 286 (2020)
Sanjana Dey, Florent Foucaud, Subhas C. Nandy, Arunabha Sen
Discriminating Codes in Geometric Setups. ISAAC (2020)
Sangram K. Jena, Ramesh K. Jallu, Gautam K. Das, Subhas C. Nandy
The Generalized Independent and Dominating Set Problems on Unit Disk Graphs. CoRR (2020)
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) (2019)
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 (2019)
Ankush Acharyya, Subhas C. Nandy, Supantha Pandit, Sasanka Roy
Covering segments with unit squares. Comput. Geom. 79 (2019)
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 (2019)
Ankush Acharyya, Minati De, Subhas C. Nandy, Supantha Pandit
Variations of largest rectangle recognition amidst a bichromatic point set. CoRR (2019)
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) (2019)
Ankush Acharyya, Anil Maheshwari, Subhas C. Nandy
Localized Query: Color Spanning Variations. CALDAM (2019)
Kaustav Basu, Sanjana Dey, Subhas C. Nandy, Arunabha Sen
Sensor Networks for Structural Health Monitoring of Critical Infrastructures Using Identifying Codes. DRCN (2019)
Gregory Bint, Anil Maheshwari, Michiel H. M. Smid, Subhas C. Nandy
Partial Enclosure Range Searching. Int. J. Comput. Geom. Appl. 29 (1) (2019)
Ankush Acharyya, Anil Maheshwari, Subhas C. Nandy
Color spanning Localized query. CoRR (2019)
Sanjana Dey, Ramesh K. Jallu, Subhas C. Nandy
Minimum Spanning Tree of Line Segments. COCOON (2018)
Nitesh Tripathi, Manjish Pal, Minati De, Gautam K. Das, Subhas C. Nandy
Guarding Polyhedral Terrain by k-Watchtowers. FAW (2018)
Ankush Acharyya, Subhas C. Nandy, Sasanka Roy
Minimum width color spanning annulus. Theor. Comput. Sci. 725 (2018)
Anil Maheshwari, Subhas C. Nandy, Drimit Pattanayak, Sasanka Roy, Michiel H. M. Smid
Geometric Path Problems with Violations. Algorithmica 80 (2) (2018)
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)
Subhas C. Nandy, Supantha Pandit, Sasanka Roy
Covering Points: Minimizing the Maximum Depth. CCCG (2017)
Ankush Acharyya, Subhas C. Nandy, Supantha Pandit, Sasanka Roy
Covering Segments with Unit Squares. WADS (2017)
Ankush Acharyya, Minati De, Subhas C. Nandy, Bodhayan Roy
Range Assignment of Base-Stations Maximizing Coverage Area without Interference. CoRR (2017)
Ankush Acharyya, Minati De, Subhas C. Nandy
Range Assignment of Base-Stations Maximizing Coverage Area without Interference. CCCG (2017)
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 (2017)
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)
Naoki Katoh, Hee-Kap Ahn, Subhas C. Nandy
Geometric Graphs: Theory and Applications (NII Shonan Meeting 2017-16). NII Shonan Meet. Rep. 2017 (2017)
Binay K. Bhattacharya, Minati De, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy
Rectilinear path problems in restricted memory setup. Discret. Appl. Math. 228 (2017)
Ahmad Biniaz, Anil Maheshwari, Subhas C. Nandy, Michiel H. M. Smid
An optimal algorithm for plane matchings in multipartite geometric graphs. Comput. Geom. 63 (2017)
Subhas C. Nandy, Supantha Pandit, Sasanka Roy
Faster approximation for maximum independent set on unit disk graph. Inf. Process. Lett. 127 (2017)
Sanjib Sadhu, Sasanka Roy, Subhas C. Nandy, Suchismita Roy
Optimal Covering and Hitting of Line Segments by Two Axis-Parallel Squares. COCOON (2017)
Ankush Acharyya, Subhas C. Nandy, Sasanka Roy
Color Spanning Annulus: Square, Rectangle and Equilateral Triangle. CoRR (2016)
Ankush Acharyya, Subhas C. Nandy, Supantha Pandit, Sasanka Roy
Covering segments with axis-parallel unit squares. CoRR (2016)
Sandip Banerjee, Neeldhara Misra, Subhas C. Nandy
Color Spanning Objects: Algorithms and Hardness Results. CALDAM (2016)
Aniket Basu Roy, Anil Maheshwari, Sathish Govindarajan, Neeldhara Misra, Subhas C. Nandy, Shreyas Shetty
The Runaway Rectangle Escape Problem. CoRR (2016)
Binay K. Bhattacharya, Subhas C. Nandy, Sasanka Roy
. Theor. Comput. Sci. 615 (2016)
Manjanna Basappa, Ramesh K. Jallu, Gautam K. Das, Subhas C. Nandy
The Euclidean k-Supplier Problem in. ALGOSENSORS (2016)
Subhas C. Nandy, Supantha Pandit, Sasanka Roy
Faster Approximation for Maximum Independent Set on Unit Disk Graph. CoRR (2016)
Ankush Acharyya, Subhas C. Nandy, Sasanka Roy
Minimum Width Color Spanning Annulus. COCOON (2016)
Arijit Bishnu, Amit Chakrabarti, Subhas C. Nandy, Sandeep Sen
On Density, Threshold and Emptiness Queries for Intervals in the Streaming Model. FSTTCS (2015)
Minati De, Subhas C. Nandy, Sasanka Roy
Prune-and-search with limited workspace. J. Comput. Syst. Sci. 81 (2) (2015)
Ahmad Biniaz, Anil Maheshwari, Subhas C. Nandy, Michiel H. M. Smid
An Optimal Algorithm for Plane Matchings in Multipartite Geometric Graphs. WADS (2015)
Debapriyay Mukhopadhyay, Subhas C. Nandy
YAHMD - Yet another heap memory debugger. ReTIS (2015)
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) (2015)
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) (2015)
Binay K. Bhattacharya, Minati De, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy
Rectilinear Path Problems in Restricted Memory Setup. CALDAM (2015)
Sanjib Sadhu, Sasanka Roy, Soumen Nandi, Anil Maheshwari, Subhas C. Nandy
Approximation algorithms for the two-center problem of convex polygon. CoRR (2015)
Debapriyay Mukhopadhyay, Subhas C. Nandy
Efficient multiple-precision integer division algorithm. Inf. Process. Lett. 114 (3) (2014)
Binay K. Bhattacharya, Minati De, Subhas C. Nandy, Sasanka Roy
Facility location problems in the constant work-space read-only memory model. CoRR (2014)
Minati De, Subhas C. Nandy, Sasanka Roy
In-place algorithms for computing a largest clique in geometric intersection graphs. Discret. Appl. Math. 178 (2014)
Binay K. Bhattacharya, Subhas C. Nandy, Sasanka Roy
Space-Efficient Algorithm for Computing a Centerpoint of a Point Set in R^2. CCCG (2014)
Dinesh Dash, Arobinda Gupta, Arijit Bishnu, Subhas C. Nandy
Line coverage measures in wireless sensor networks. J. Parallel Distributed Comput. 74 (7) (2014)
Binay K. Bhattacharya, Minati De, Subhas C. Nandy, Sasanka Roy
Maximum Independent Set for Interval Graphs and Trees in Space Efficient Models. CCCG (2014)
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) (2013)
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) (2013)
Minati De, Anil Maheshwari, Subhas C. Nandy, Michiel H. M. Smid
An in-place min-max priority search tree. Comput. Geom. 46 (3) (2013)
Bhaswar B. Bhattacharya, Subhas C. Nandy
New variations of the maximum coverage facility location problem. Eur. J. Oper. Res. 224 (3) (2013)
John Augustine, Sandip Das, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy, Swami Sarvattomananda
Localized geometric query problems. Comput. Geom. 46 (3) (2013)
Arindam Karmakar, Sandip Das, Subhas C. Nandy, Binay K. Bhattacharya
Some variations on constrained minimum enclosing circle problem. J. Comb. Optim. 25 (2) (2013)
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) (2013)
Minati De, Subhas C. Nandy, Sasanka Roy
Minimum Enclosing Circle with Few Extra Variables. FSTTCS (2012)
Minati De, Subhas C. Nandy, Sasanka Roy
Convex Hull and Linear Programming in Read-only Setup with Limited Work-space CoRR (2012)
Minati De, Subhas C. Nandy, Sasanka Roy
In-Place Algorithms for Computing a Largest Clique in Geometric Intersection Graphs. FAW-AAIM (2012)
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)
Minati De, Anil Maheshwari, Subhas C. Nandy
Space-efficient Algorithms for Visibility Problems in Simple Polygon CoRR (2012)
Subhas C. Nandy, Sandeep Sen
Preface. Theor. Comput. Sci. 442 (2012)
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) (2012)
Dinesh Dash, Arijit Bishnu, Arobinda Gupta, Subhas C. Nandy
Finding the Quality of Line Coverage of a Sensor Network - (Poster Paper). ICDCN (2012)
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 (2012)
Minati De, Subhas C. Nandy
Space-efficient Algorithms for Empty Space Recognition among a Point Set in 2D and 3D. CCCG (2011)
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) (2011)
Minati De, Subhas C. Nandy
Inplace Algorithm for Priority Search Tree and its use in Computing Largest Empty Axis-Parallel Rectangle CoRR (2011)
Minati De, Gautam K. Das, Subhas C. Nandy
Approximation Algorithms for the Discrete Piercing Set Problem for Unit Disks. CCCG (2011)
Minati De, Anil Maheshwari, Subhas C. Nandy, Michiel H. M. Smid
An In-Place Priority Search Tree. CCCG (2011)
John Augustine, Sandip Das, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy, Swami Sarvattomananda
Localized Geometric Query Problems CoRR (2011)
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) (2011)
Bhaswar B. Bhattacharya, Subhas C. Nandy
New variations of the reverse facility location problem. CCCG (2010)
Gautam K. Das, Sandip Das, Subhas C. Nandy
Homogeneous 2-hop broadcast in 2D. Comput. Geom. 43 (2) (2010)

Subhas C. Nandy

Publication Activity (10 Years)

Top Topics

Top Venues