Subhas C. Nandy

182 papers A 1B 14C 5Misc 15Journal 103Unranked 43

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Set cover, hitting set, and independent set problems for some restricted classes of geometric objects. Theor. Comput. Sci. Minati De, Ratnadip Mandal, Subhas C. Nandy
2025	—	`ed.`	Applied Algorithms - Second International Conference, ICAA 2025, Kolkata, India, January 8-10, 2025, Proceedings ICAA Subhas C. Nandy, Rajat K. De, Prosenjit Gupta
2025	J	`jnl`	On the geometric red-blue set cover problem. Theor. Comput. Sci. Raghunath Reddy Madireddy, Subhas C. Nandy, Supantha Pandit
2025	J	`jnl`	Partial Domination in Some Geometric Intersection Graphs and Some Complexity Results. CoRR Madhura Dutta, Anil Maheshwari, Subhas C. Nandy, Bodhayan Roy
2025	—	`conf`	Partial Domination in Some Geometric Intersection Graphs. CALDAM Madhura Dutta, Anil Maheshwari, Subhas C. Nandy
2024	—	`conf`	Minimum Consistent Subset in Trees and Interval Graphs. FSTTCS Aritra Banik, Sayani Das, Anil Maheshwari, Bubai Manna, Subhas C. Nandy, Krishna Priya K. M., Bodhayan Roy, Sasanka Roy, Abhishek Sahu
2024	J	`jnl`	Minimum Consistent Subset in Trees and Interval Graphs. CoRR Aritra Banik, Sayani Das, Anil Maheshwari, Bubai Manna, Subhas C. Nandy, Krishna Priya K. M., Bodhayan Roy, Sasanka Roy, Abhishek Sahu
2024	—	`conf`	Set Cover and Hitting Set Problems for Some Restricted Classes of Rectangles. CCCG Minati De, Ratnadip Mandal, Subhas C. Nandy
2023	J	`jnl`	Acrophobic guard watchtower problem. Comput. Geom. Ritesh Seth, Anil Maheshwari, Subhas C. Nandy
2023	J	`jnl`	Complexity and Approximation for Discriminating and Identifying Code Problems in Geometric Setups. Algorithmica Sanjana Dey, Florent Foucaud, Subhas C. Nandy, Arunabha Sen
2023	J	`jnl`	Minimum consistent subset of simple graph classes. Discret. Appl. Math. Sanjana Dey, Anil Maheshwari, Subhas C. Nandy
2022	Misc	`conf`	Exact Algorithms and Hardness Results for Geometric Red-Blue Hitting Set Problem. FAW Raghunath Reddy Madireddy, Subhas C. Nandy, Supantha Pandit
2022	J	`jnl`	Guest Editors' Foreword. J. Graph Algorithms Appl. Seok-Hee Hong, Subhas C. Nandy, Ryuhei Uehara
2022	—	`conf`	Half-Guarding Weakly-Visible Polygons and Terrains. FSTTCS Nandhana Duraisamy, Hannah Miller Hillberg, Ramesh K. Jallu, Erik Krohn, Anil Maheshwari, Subhas C. Nandy, Alex Pahlow
2022	C	`conf`	On the Construction of Planar Embedding for a Class of Orthogonal Polyhedra. IWCIA Nilanjana Karmakar, Arindam Biswas, Subhas C. Nandy, Bhargab B. Bhattacharya
2021	J	`jnl`	Algorithms and Discrete Mathematics - celebrating the silver jubilee of IITG Guwahati. Theor. Comput. Sci. Gautam Kumar Das, Subhas C. Nandy, M. Sohel Rahman
2021	—	`conf`	An Acrophobic Guard Watchtower Problem on Terrains. CCCG Ritesh Seth, Anil Maheshwari, Subhas C. Nandy
2021	J	`jnl`	Color-spanning localized query. Theor. Comput. Sci. Ankush Acharyya, Anil Maheshwari, Subhas C. Nandy
2021	B	`conf`	Minimum Consistent Subset Problem for Trees. FCT Sanjana Dey, Anil Maheshwari, Subhas C. Nandy
2021	—	`conf`	Minimum Consistent Subset of Simple Graph Classes. CALDAM Sanjana Dey, Anil Maheshwari, Subhas C. Nandy
2021	B	`conf`	On the Geometric Red-Blue Set Cover Problem. WALCOM Raghunath Reddy Madireddy, Subhas C. Nandy, Supantha Pandit
2021	J	`jnl`	On the minimum spanning tree problem in imprecise set-up. CoRR Sanjana Dey, Ramesh K. Jallu, Subhas C. Nandy
2021	J	`jnl`	Sparsity of weighted networks: Measures and applications. Inf. Sci. Swati Goswami, Asit Kumar Das, Subhas C. Nandy
2021	J	`jnl`	The Euclidean k-supplier problem in IR2. Oper. Res. Lett. Manjanna Basappa, Ramesh K. Jallu, Gautam K. Das, Subhas C. Nandy
2021	B	`ed.`	WALCOM: Algorithms and Computation - 15th International Conference and Workshops, WALCOM 2021, Yangon, Myanmar, February 28 - March 2, 2021, Proceedings WALCOM Ryuhei Uehara, Seok-Hee Hong, Subhas C. Nandy
2020	J	`jnl`	Color spanning objects: Algorithms and hardness results. Discret. Appl. Math. Sandip Banerjee, Neeldhara Misra, Subhas C. Nandy
2020	J	`jnl`	Constant work-space algorithms for facility location problems. Discret. Appl. Math. Binay K. Bhattacharya, Minati De, Subhas C. Nandy, Sasanka Roy
2020	J	`jnl`	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. Sanjib Sadhu, Xiaozhou He, Sasanka Roy, Subhas C. Nandy, Suchismita Roy
2020	B	`conf`	Discriminating Codes in Geometric Setups. ISAAC Sanjana Dey, Florent Foucaud, Subhas C. Nandy, Arunabha Sen
2020	J	`jnl`	Discriminating Codes in Geometric Setups. CoRR Sanjana Dey, Florent Foucaud, Subhas C. Nandy, Arunabha Sen
2020	J	`jnl`	Efficient Algorithm for Computing the Triangle Maximizing the Length of Its Smallest Side Inside a Convex Polygon. Int. J. Found. Comput. Sci. Sanjib Sadhu, Sasanka Roy, Soumen Nandi, Subhas C. Nandy, Suchismita Roy
2020	J	`jnl`	Range assignment of base-stations maximizing coverage area without interference. Theor. Comput. Sci. Ankush Acharyya, Minati De, Subhas C. Nandy, Bodhayan Roy
2020	J	`jnl`	Sparsity of weighted networks: measures and applications. CoRR Swati Goswami, Asit Kumar Das, Subhas C. Nandy
2020	J	`jnl`	The Generalized Independent and Dominating Set Problems on Unit Disk Graphs. CoRR Sangram Kishor Jena, Ramesh K. Jallu, Gautam K. Das, Subhas C. Nandy
2020	J	`jnl`	Variations of largest rectangle recognition amidst a bichromatic point set. Discret. Appl. Math. Ankush Acharyya, Minati De, Subhas C. Nandy, Supantha Pandit
2019	J	`jnl`	Color spanning Localized query. CoRR Ankush Acharyya, Anil Maheshwari, Subhas C. Nandy
2019	J	`jnl`	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 Sanjib Sadhu, Xiaozhou He, Sasanka Roy, Subhas C. Nandy, Suchismita Roy
2019	J	`jnl`	Covering segments with unit squares. Comput. Geom. Ankush Acharyya, Subhas C. Nandy, Supantha Pandit, Sasanka Roy
2019	J	`jnl`	Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares. Theor. Comput. Sci. Sanjib Sadhu, Sasanka Roy, Subhas C. Nandy, Suchismita Roy
2019	—	`conf`	Localized Query: Color Spanning Variations. CALDAM Ankush Acharyya, Anil Maheshwari, Subhas C. Nandy
2019	J	`jnl`	Optimization of Multi-Target Sample Preparation On-Demand With Digital Microfluidic Biochips. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. Sudip Poddar, Sukanta Bhattacharjee, Subhas C. Nandy, Krishnendu Chakrabarty, Bhargab B. Bhattacharya
2019	J	`jnl`	Partial Enclosure Range Searching. Int. J. Comput. Geom. Appl. Gregory Bint, Anil Maheshwari, Michiel H. M. Smid, Subhas C. Nandy
2019	—	`conf`	Sensor Networks for Structural Health Monitoring of Critical Infrastructures Using Identifying Codes. DRCN Kaustav Basu, Sanjana Dey, Subhas C. Nandy, Arunabha Sen
2019	J	`jnl`	Two-center of the Convex Hull of a Point Set: Dynamic Model, and Restricted Streaming Model. Fundam. Informaticae Sanjib Sadhu, Sasanka Roy, Soumen Nandi, Anil Maheshwari, Subhas C. Nandy
2019	J	`jnl`	Variations of largest rectangle recognition amidst a bichromatic point set. CoRR Ankush Acharyya, Minati De, Subhas C. Nandy, Supantha Pandit
2018	J	`jnl`	Geometric Path Problems with Violations. Algorithmica Anil Maheshwari, Subhas C. Nandy, Drimit Pattanayak, Sasanka Roy, Michiel H. M. Smid
2018	Misc	`conf`	Guarding Polyhedral Terrain by k-Watchtowers. FAW Nitesh Tripathi, Manjish Pal, Minati De, Gautam K. Das, Subhas C. Nandy
2018	Misc	`conf`	Minimum Spanning Tree of Line Segments. COCOON Sanjana Dey, Ramesh K. Jallu, Subhas C. Nandy
2018	J	`jnl`	Minimum width color spanning annulus. Theor. Comput. Sci. Ankush Acharyya, Subhas C. Nandy, Sasanka Roy
2018	Misc	`conf`	The Maximum Distance-d Independent Set Problem on Unit Disk Graphs. FAW Sangram Kishor Jena, Ramesh K. Jallu, Gautam K. Das, Subhas C. Nandy
2017	J	`jnl`	A linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares. CoRR Sanjib Sadhu, Sasanka Roy, Subhas C. Nandy, Suchismita Roy
2017	J	`jnl`	An optimal algorithm for plane matchings in multipartite geometric graphs. Comput. Geom. Ahmad Biniaz, Anil Maheshwari, Subhas C. Nandy, Michiel H. M. Smid
2017	—	`conf`	Computing the Triangle Maximizing the Length of Its Smallest Side Inside a Convex Polygon. ICCSA (2) Sanjib Sadhu, Sasanka Roy, Soumen Nandi, Subhas C. Nandy, Suchismita Roy
2017	—	`conf`	Covering Points: Minimizing the Maximum Depth. CCCG Subhas C. Nandy, Supantha Pandit, Sasanka Roy
2017	B	`conf`	Covering Segments with Unit Squares. WADS Ankush Acharyya, Subhas C. Nandy, Supantha Pandit, Sasanka Roy
2017	J	`jnl`	Faster approximation for maximum independent set on unit disk graph. Inf. Process. Lett. Subhas C. Nandy, Supantha Pandit, Sasanka Roy
2017	J	`jnl`	Geometric Graphs: Theory and Applications (NII Shonan Meeting 2017-16). NII Shonan Meet. Rep. Naoki Katoh, Hee-Kap Ahn, Subhas C. Nandy
2017	Misc	`conf`	Optimal Covering and Hitting of Line Segments by Two Axis-Parallel Squares. COCOON Sanjib Sadhu, Sasanka Roy, Subhas C. Nandy, Suchismita Roy
2017	—	`conf`	Range Assignment of Base-Stations Maximizing Coverage Area without Interference. CCCG Ankush Acharyya, Minati De, Subhas C. Nandy
2017	J	`jnl`	Range Assignment of Base-Stations Maximizing Coverage Area without Interference. CoRR Ankush Acharyya, Minati De, Subhas C. Nandy, Bodhayan Roy
2017	J	`jnl`	Rectilinear path problems in restricted memory setup. Discret. Appl. Math. Binay K. Bhattacharya, Minati De, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy
2016	J	`jnl`	Color Spanning Annulus: Square, Rectangle and Equilateral Triangle. CoRR Ankush Acharyya, Subhas C. Nandy, Sasanka Roy
2016	—	`conf`	Color Spanning Objects: Algorithms and Hardness Results. CALDAM Sandip Banerjee, Neeldhara Misra, Subhas C. Nandy
2016	J	`jnl`	Covering segments with axis-parallel unit squares. CoRR Ankush Acharyya, Subhas C. Nandy, Supantha Pandit, Sasanka Roy
2016	J	`jnl`	Faster Approximation for Maximum Independent Set on Unit Disk Graph. CoRR Subhas C. Nandy, Supantha Pandit, Sasanka Roy
2016	Misc	`conf`	Minimum Width Color Spanning Annulus. COCOON Ankush Acharyya, Subhas C. Nandy, Sasanka Roy
2016	J	`jnl`	Space-efficient algorithm for computing a centerpoint of a set of points in R Theor. Comput. Sci. Binay K. Bhattacharya, Subhas C. Nandy, Sasanka Roy
2016	C	`conf`	The Euclidean k-Supplier Problem in. ALGOSENSORS Manjanna Basappa, Ramesh K. Jallu, Gautam K. Das, Subhas C. Nandy
2016	J	`jnl`	The Runaway Rectangle Escape Problem. CoRR Aniket Basu Roy, Anil Maheshwari, Sathish Govindarajan, Neeldhara Misra, Subhas C. Nandy, Shreyas Shetty
2015	B	`conf`	An Optimal Algorithm for Plane Matchings in Multipartite Geometric Graphs. WADS Ahmad Biniaz, Anil Maheshwari, Subhas C. Nandy, Michiel H. M. Smid
2015	J	`jnl`	Approximation algorithms for maximum independent set of a unit disk graph. Inf. Process. Lett. Gautam K. Das, Minati De, Sudeshna Kolay, Subhas C. Nandy, Susmita Sur-Kolay
2015	J	`jnl`	Approximation algorithms for the two-center problem of convex polygon. CoRR Sanjib Sadhu, Sasanka Roy, Soumen Nandi, Anil Maheshwari, Subhas C. Nandy
2015	J	`jnl`	Minimum Dominating Set Problem for Unit Disks Revisited. Int. J. Comput. Geom. Appl. Paz Carmi, Gautam K. Das, Ramesh K. Jallu, Subhas C. Nandy, Prajwal R. Prasad, Yael Stein
2015	—	`conf`	On Density, Threshold and Emptiness Queries for Intervals in the Streaming Model. FSTTCS Arijit Bishnu, Amit Chakrabarti, Subhas C. Nandy, Sandeep Sen
2015	J	`jnl`	Prune-and-search with limited workspace. J. Comput. Syst. Sci. Minati De, Subhas C. Nandy, Sasanka Roy
2015	—	`conf`	Rectilinear Path Problems in Restricted Memory Setup. CALDAM Binay K. Bhattacharya, Minati De, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy
2015	—	`conf`	YAHMD - Yet another heap memory debugger. ReTIS Debapriyay Mukhopadhyay, Subhas C. Nandy
2014	J	`jnl`	Efficient multiple-precision integer division algorithm. Inf. Process. Lett. Debapriyay Mukhopadhyay, Subhas C. Nandy
2014	J	`jnl`	Facility location problems in the constant work-space read-only memory model. CoRR Binay K. Bhattacharya, Minati De, Subhas C. Nandy, Sasanka Roy
2014	J	`jnl`	In-place algorithms for computing a largest clique in geometric intersection graphs. Discret. Appl. Math. Minati De, Subhas C. Nandy, Sasanka Roy
2014	J	`jnl`	Line coverage measures in wireless sensor networks. J. Parallel Distributed Comput. Dinesh Dash, Arobinda Gupta, Arijit Bishnu, Subhas C. Nandy
2014	—	`conf`	Maximum Independent Set for Interval Graphs and Trees in Space Efficient Models. CCCG Binay K. Bhattacharya, Minati De, Subhas C. Nandy, Sasanka Roy
2014	—	`conf`	Space-Efficient Algorithm for Computing a Centerpoint of a Point Set in R^2. CCCG Binay K. Bhattacharya, Subhas C. Nandy, Sasanka Roy
2013	J	`jnl`	An in-place min-max priority search tree. Comput. Geom. Minati De, Anil Maheshwari, Subhas C. Nandy, Michiel H. M. Smid
2013	J	`jnl`	Approximation Algorithms for a Variant of discrete Piercing Set Problem for Unit Disks. Int. J. Comput. Geom. Appl. Minati De, Gautam K. Das, Paz Carmi, Subhas C. Nandy
2013	J	`jnl`	Approximation algorithms for deployment of sensors for line segment coverage in wireless sensor networks. Wirel. Networks Dinesh Dash, Arijit Bishnu, Arobinda Gupta, Subhas C. Nandy
2013	J	`jnl`	Diffuse reflection diameter and radius for convex-quadrilateralizable polygons. Discret. Appl. Math. Arindam Khan, Sudebkumar Prasant Pal, Mridul Aanjaneya, Arijit Bishnu, Subhas C. Nandy
2013	J	`jnl`	Localized geometric query problems. Comput. Geom. John Augustine, Sandip Das, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy, Swami Sarvattomananda
2013	J	`jnl`	New variations of the maximum coverage facility location problem. Eur. J. Oper. Res. Bhaswar B. Bhattacharya, Subhas C. Nandy
2013	J	`jnl`	Some variations on constrained minimum enclosing circle problem. J. Comb. Optim. Arindam Karmakar, Sandip Das, Subhas C. Nandy, Binay K. Bhattacharya
2012	J	`jnl`	Algorithms for computing diffuse reflection paths in polygons. Vis. Comput. Subir Kumar Ghosh, Partha P. Goswami, Anil Maheshwari, Subhas C. Nandy, Sudebkumar Prasant Pal, Swami Sarvattomananda
2012	Misc	`conf`	Approximation algorithms for deployment of sensors for line segment coverage in wireless sensor networks. COMSNETS Dinesh Dash, Arijit Bishnu, Arobinda Gupta, Subhas C. Nandy
2012	J	`jnl`	Convex Hull and Linear Programming in Read-only Setup with Limited Work-space CoRR Minati De, Subhas C. Nandy, Sasanka Roy
2012	Misc	`conf`	Finding the Quality of Line Coverage of a Sensor Network - (Poster Paper). ICDCN Dinesh Dash, Arijit Bishnu, Arobinda Gupta, Subhas C. Nandy
2012	J	`jnl`	Greedy is good: An experimental study on minimum clique cover and maximum independent set problems for randomly generated rectangles CoRR Ritankar Mandal, Anirban Ghosh, Sasanka Roy, Subhas C. Nandy
2012	—	`conf`	In-Place Algorithms for Computing a Largest Clique in Geometric Intersection Graphs. FAW-AAIM Minati De, Subhas C. Nandy, Sasanka Roy
2012	—	`conf`	Minimum Enclosing Circle with Few Extra Variables. FSTTCS Minati De, Subhas C. Nandy, Sasanka Roy
2012	J	`jnl`	Preface. Theor. Comput. Sci. Subhas C. Nandy, Sandeep Sen
2012	J	`jnl`	Space-efficient Algorithms for Visibility Problems in Simple Polygon CoRR Minati De, Anil Maheshwari, Subhas C. Nandy
2011	—	`conf`	An In-Place Priority Search Tree. CCCG Minati De, Anil Maheshwari, Subhas C. Nandy, Michiel H. M. Smid
2011	—	`conf`	Approximation Algorithms for the Discrete Piercing Set Problem for Unit Disks. CCCG Minati De, Gautam K. Das, Subhas C. Nandy
2011	J	`jnl`	Inplace Algorithm for Priority Search Tree and its use in Computing Largest Empty Axis-Parallel Rectangle CoRR Minati De, Subhas C. Nandy
2011	J	`jnl`	Localized Geometric Query Problems CoRR John Augustine, Sandip Das, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy, Swami Sarvattomananda
2011	J	`jnl`	Measuring the Quality of Surveillance in a Wireless Sensor Network. Int. J. Found. Comput. Sci. Debashis Mondal, Abhay Kumar, Arijit Bishnu, Krishnendu Mukhopadhyaya, Subhas C. Nandy
2011	J	`jnl`	On the number of shortest descending paths on the surface of a convex terrain. J. Discrete Algorithms Mustaq Ahmed, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy
2011	—	`conf`	Space-efficient Algorithms for Empty Space Recognition among a Point Set in 2D and 3D. CCCG Minati De, Subhas C. Nandy
2010	B	`conf`	A Simple Algorithm for Approximate Partial Point Set Pattern Matching under Rigid Motion. WALCOM Arijit Bishnu, Sandip Das, Subhas C. Nandy, Bhargab B. Bhattacharya
2010	J	`jnl`	Approximation Algorithm for Line Segment Coverage for Wireless Sensor Network CoRR Dinesh Dash, Arijit Bishnu, Arobinda Gupta, Subhas C. Nandy
2010	—	`conf`	Cluster connecting problem inside a polygon. CCCG Sanjib Sadhu, Arijit Bishnu, Subhas C. Nandy, Partha P. Goswami
2010	—	`conf`	Computing the straight skeleton of a monotone polygon in O(n log n) time. CCCG Gautam K. Das, Asish Mukhopadhyay, Subhas C. Nandy, Sangameswar Patil, S. V. Rao
2010	J	`jnl`	Homogeneous 2-hop broadcast in 2D. Comput. Geom. Gautam K. Das, Sandip Das, Subhas C. Nandy
2010	—	`conf`	New variations of the reverse facility location problem. CCCG Bhaswar B. Bhattacharya, Subhas C. Nandy
2010	J	`jnl`	Recognition of largest empty orthoconvex polygon in a point set. Inf. Process. Lett. Subhas C. Nandy, Krishnendu Mukhopadhyaya, Bhargab B. Bhattacharya
2010	J	`jnl`	Recognizing the Largest Empty Circle and Axis-Parallel Rectangle in a Desired Location CoRR John Augustine, Sandip Das, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy, Swami Sarvattomananda
2010	J	`jnl`	Separating Multi-Color Points on a Plane with Fewest Axis-Parallel Lines. Fundam. Informaticae Subhashis Majumder, Subhas C. Nandy, Bhargab B. Bhattacharya
2010	—	`conf`	Some Variations on Constrained Minimum Enclosing Circle Problem. COCOA (1) Arindam Karmakar, Sandip Das, Subhas C. Nandy, Binay K. Bhattacharya
2009	J	`jnl`	A new fast heuristic for labeling points. Inf. Process. Lett. Sasanka Roy, Subhasis Bhattacharjee, Sandip Das, Subhas C. Nandy
2009	B	`conf`	Algorithms for Computing Diffuse Reflection Paths in Polygons. WALCOM Subir Kumar Ghosh, Partha P. Goswami, Anil Maheshwari, Subhas C. Nandy, Sudebkumar Prasant Pal, Swami Sarvattomananda
2009	J	`jnl`	Constrained minimum enclosing circle with center on a query line segment. Comput. Geom. Sasanka Roy, Arindam Karmakar, Sandip Das, Subhas C. Nandy
2009	J	`jnl`	FPGA placement using space-filling curves: Theory meets practice. ACM Trans. Embed. Comput. Syst. Pritha Banerjee, Susmita Sur-Kolay, Arijit Bishnu, Sandip Das, Subhas C. Nandy, Subhasis Bhattacharjee
2009	B	`conf`	Improved Algorithm for a Widest 1-Corner Corridor. WALCOM Gautam K. Das, Debapriyay Mukhopadhyay, Subhas C. Nandy
2009	J	`jnl`	Improved algorithm for the widest empty 1-corner corridor. Inf. Process. Lett. Gautam K. Das, Debapriyay Mukhopadhyay, Subhas C. Nandy
2009	J	`jnl`	Smallest Color-Spanning Object Revisited. Int. J. Comput. Geom. Appl. Sandip Das, Partha P. Goswami, Subhas C. Nandy
2008	J	`jnl`	A Generalization of Magic Squares with Applications to Digital Halftoning. Theory Comput. Syst. Boris Aronov, Tetsuo Asano, Yosuke Kikuchi, Subhas C. Nandy, Shinji Sasahara, Takeaki Uno
2008	—	`conf`	Recognition of Largest Empty Orthoconvex Polygon in a Point Set. CCCG Subhas C. Nandy, Krishnendu Mukhopadhyaya, Bhargab B. Bhattacharya
2008	J	`jnl`	Variations of Base-Station Placement Problem on the Boundary of a Convex Region. Int. J. Found. Comput. Sci. Gautam K. Das, Sasanka Roy, Sandip Das, Subhas C. Nandy
2008	J	`jnl`	Weighted broadcast in linear radio networks. Inf. Process. Lett. Gautam K. Das, Subhas C. Nandy
2007	B	`conf`	Base Station Placement Problem on the Boundary of a Convex Region. WALCOM Gautam K. Das, Sasanka Roy, Sandip Das, Subhas C. Nandy
2007	J	`jnl`	Chromatic distribution of k-nearest neighbors of a line segment in a planar colored point set. Inf. Process. Lett. Partha P. Goswami, Sandip Das, Subhas C. Nandy
2007	J	`jnl`	Improved Algorithm for Minimum Cost Range Assignment Problem for Linear Radio Networks. Int. J. Found. Comput. Sci. Gautam K. Das, Sasthi C. Ghosh, Subhas C. Nandy
2007	J	`jnl`	Shortest monotone descent path problem in polyhedral terrain. Comput. Geom. Sasanka Roy, Sandip Das, Subhas C. Nandy
2006	B	`conf`	Constrained Minimum Enclosing Circle with Center on a Query Line Segment. MFCS Sasanka Roy, Arindam Karmakar, Sandip Das, Subhas C. Nandy
2006	J	`jnl`	Efficient algorithm for placing a given number of base stations to cover a convex region. J. Parallel Distributed Comput. Gautam K. Das, Sandip Das, Subhas C. Nandy, Bhabani P. Sinha
2006	—	`conf`	Homogeneous 2-Hops Broadcast in 2D. ICCSA (2) Gautam K. Das, Sandip Das, Subhas C. Nandy
2006	J	`jnl`	Range assignment for energy efficient broadcasting in linear radio networks. Theor. Comput. Sci. Gautam K. Das, Sandip Das, Subhas C. Nandy
2006	J	`jnl`	Simple algorithms for partial point set pattern matching under rigid motion. Pattern Recognit. Arijit Bishnu, Sandip Das, Subhas C. Nandy, Bhargab B. Bhattacharya
2006	C	`conf`	Weighted Broadcast in Linear Radio Networks. AAIM Gautam K. Das, Subhas C. Nandy
2005	—	`conf`	A Fast Algorithm for Point Labeling Problem. CCCG Sasanka Roy, Subhasis Bhattacharjee, Sandip Das, Subhas C. Nandy
2005	B	`conf`	Fast FPGA Placement using Space-filling Curve. FPL Pritha Banerjee, Subhasis Bhattacharjee, Susmita Sur-Kolay, Sandip Das, Subhas C. Nandy
2005	Misc	`conf`	Hot Spots and Zones in a Chip: A Geometrician's View. VLSI Design Subhashis Majumder, Susmita Sur-Kolay, Subhas C. Nandy, Bhargab B. Bhattacharya, B. Chakraborty
2005	—	`conf`	Placing a Given Number of Base Stations to Cover a Convex Region. IWDC Gautam K. Das, Sandip Das, Subhas C. Nandy, Bhabani P. Sinha
2005	—	`conf`	Recognition of Minimum Width Color-Spanning Corridor and Minimum Area Color-Spanning Rectangle. ICCSA (1) Sandip Das, Partha P. Goswami, Subhas C. Nandy
2005	A	`conf`	Shortest Monotone Descent Path Problem in Polyhedral Terrain. STACS Sasanka Roy, Sandip Das, Subhas C. Nandy
2005	J	`jnl`	Smallest Inf. Process. Lett. Sandip Das, Partha P. Goswami, Subhas C. Nandy
2004	B	`conf`	A Generalization of Magic Squares with Applications to Digital Halftoning. ISAAC Boris Aronov, Tetsuo Asano, Yosuke Kikuchi, Subhas C. Nandy, Shinji Sasahara, Takeaki Uno
2004	—	`conf`	A Practical Algorithm for Approximating Shortest Weighted Path between a Pair of Points on Polyhedral Surface. ICCSA (3) Sasanka Roy, Sandip Das, Subhas C. Nandy
2004	B	`conf`	An efficient heuristic algorithm for 2D h-hops range assignment problem. GLOBECOM Gautam K. Das, Sasthi C. Ghosh, Subhas C. Nandy
2004	Misc	`conf`	Efficient Algorithm for Energy Efficient Broadcasting in Linear Radio Networks. HiPC Gautam K. Das, Sandip Das, Subhas C. Nandy
2004	—	`conf`	Improved Algorithm for Minimum Cost Range Assignment Problem for Linear Radio Networks. IWDC Gautam K. Das, Sasthi C. Ghosh, Subhas C. Nandy
2004	J	`jnl`	On Finding A Staircase Channel With Minimum Crossing Nets In A VLSI Floorplan. J. Circuits Syst. Comput. Subhashis Majumder, Subhas C. Nandy, Bhargab B. Bhattacharya
2004	J	`jnl`	Optimal algorithm for a special point-labeling problem. Inf. Process. Lett. Sasanka Roy, Partha P. Goswami, Sandip Das, Subhas C. Nandy
2004	—	`conf`	Smallest k point enclosing rectangle of arbitrary orientation. CCCG Sandip Das, Partha P. Goswami, Subhas C. Nandy
2004	J	`jnl`	Triangular range counting query in 2D and its application in finding k nearest neighbors of a line segment. Comput. Geom. Partha P. Goswami, Sandip Das, Subhas C. Nandy
2003	C	`conf`	An Improved Algorithm for Point Set Pattern Matching under Rigid Motion. CIAC Arijit Bishnu, Sandip Das, Subhas C. Nandy, Bhargab B. Bhattacharya
2003	J	`jnl`	An efficient k nearest neighbors searching algorithm for a query line. Theor. Comput. Sci. Subhas C. Nandy, Sandip Das, Partha P. Goswami
2003	J	`jnl`	Largest empty rectangle among a point set. J. Algorithms Jeet Chaudhuri, Subhas C. Nandy, Sandip Das
2003	J	`jnl`	On finding an empty staircase polygon of largest area (width) in a planar point-set. Comput. Geom. Subhas C. Nandy, Bhargab B. Bhattacharya
2002	J	`jnl`	Monotone bipartitioning problem in a planar point set with applications to VLSI. ACM Trans. Design Autom. Electr. Syst. Parthasarathi Dasgupta, Peichen Pan, Subhas C. Nandy, Bhargab B. Bhattacharya
2002	—	`conf`	Optimal Algorithm for a Special Point-Labeling Problem. SWAT Sasanka Roy, Partha P. Goswami, Sandip Das, Subhas C. Nandy
2002	J	`jnl`	Shattering a set of objects in 2D. Discret. Appl. Math. Subhas C. Nandy, Tetsuo Asano, Tomohiro Harayama
2002	—	`conf`	Simplex Range Searching and k Nearest Neighbors of a Line Segment in 2D. SWAT Partha P. Goswami, Sandip Das, Subhas C. Nandy
2002	J	`jnl`	Translating a convex polyhedron over monotone polyhedra. Comput. Geom. Tetsuo Asano, Antonio Hernández-Barrera, Subhas C. Nandy
2001	—	`conf`	Area(number)-balanced hierarchy of staircase channels with minimum crossing nets. ISCAS (5) Subhashis Majumder, Susmita Sur-Kolay, Bhargab B. Bhattacharya, Subhas C. Nandy
2001	J	`jnl`	Dynamically maintaining the widest k-dense corridor. Theor. Comput. Sci. Subhas C. Nandy, Tomohiro Harayama, Tetsuo Asano
2001	J	`jnl`	Searching networks with unrestricted edge costs. IEEE Trans. Syst. Man Cybern. Part A Parthasarathi Dasgupta, Anup K. Sen, Subhas C. Nandy, Bhargab B. Bhattacharya
2000	Misc	`conf`	An Efficient k Nearest Neighbor Searching Algorithm for a Query Line. COCOON Subhas C. Nandy
2000	C	`conf`	Dynamically Maintaining the Widest k -Dense Corridor. CIAC Subhas C. Nandy, Tomohiro Harayama, Tetsuo Asano
2000	J	`jnl`	Safety Zone Problem. J. Algorithms Subhas C. Nandy, Bhargab B. Bhattacharya, Antonio Hernández-Barrera
1999	Misc	`conf`	Generalized Shooter Location Problem. COCOON Jeet Chaudhuri, Subhas C. Nandy
1999	Misc	`conf`	High Performance MCM Routing: A New Approach. VLSI Design Sandip Das, Subhas C. Nandy, Bhargab B. Bhattacharya
1999	—	`conf`	Largest Empty Rectangle among a Point Set. FSTTCS Jeet Chaudhuri, Subhas C. Nandy
1999	—	`conf`	Shattering a set of objects in 2d. CCCG Subhas C. Nandy
1998	J	`jnl`	Efficient Computation of Rectilinear Geodesic Voronoi Neighbor in the Presence of Obstacles. J. Algorithms Pinaki Mitra, Subhas C. Nandy
1998	Misc	`conf`	Partitioning VLSI Floorplans by Staircase Channels for Global Routing. VLSI Design Subhashis Majumder, Subhas C. Nandy, Bhargab B. Bhattacharya
1996	—	`conf`	Efficient Computation of Rectilinear Geodesic Voronoi Neighbor in Presence of Obstacles. FSTTCS Pinaki Mitra, Subhas C. Nandy
1996	Misc	`conf`	Geometric bipartitioning problem and its applications to VLSI. VLSI Design Parthasarathi Dasgupta, Anup K. Sen, Subhas C. Nandy, Bhargab B. Bhattacharya
1996	—	`conf`	Shooter Location Problem. CCCG Subhas C. Nandy, Krishnendu Mukhopadhyaya, Bhargab B. Bhattacharya
1994	—	`conf`	Location of the Largest Empty Rectangle among Arbitrary Obstacles. FSTTCS Subhas C. Nandy, Arani Sinha, Bhargab B. Bhattacharya
1990	J	`jnl`	Efficiency of discriminant analysis when initial samples are classified stochastically. Pattern Recognit. Thriyambakam Krishnan, Subhas C. Nandy
1990	J	`jnl`	Efficiency of logistic-normal stochastic supervision. Pattern Recognit. Thriyambakam Krishnan, Subhas C. Nandy
1990	—	`conf`	Efficient algorithms for Identifying All Maximal Isothetic Empty Rectangles in VLSI Layout Design. FSTTCS Subhas C. Nandy, Bhargab B. Bhattacharya, Sibabrata Ray
1987	J	`jnl`	Discriminant analysis with a stochastic supervisor. Pattern Recognit. Thriyambakam Krishnan, Subhas C. Nandy