Subhas C. Nandy

According to our database, Subhas C. Nandy authored at least 146 papers between 1987 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2023

Minimum consistent subset of simple graph classes.

Sanjana Dey, Anil Maheshwari, Subhas C. Nandy

Discret. Appl. Math., October, 2023

Complexity and Approximation for Discriminating and Identifying Code Problems in Geometric Setups.

Sanjana Dey, Florent Foucaud, Subhas C. Nandy, Arunabha Sen

Algorithmica, July, 2023

Acrophobic guard watchtower problem.

Ritesh Seth, Anil Maheshwari, Subhas C. Nandy

Comput. Geom., 2023

2022

Guest Editors' Foreword.

Seok-Hee Hong, Subhas C. Nandy, Ryuhei Uehara

J. Graph Algorithms Appl., 2022

On the Construction of Planar Embedding for a Class of Orthogonal Polyhedra.

Nilanjana Karmakar, Arindam Biswas, Subhas C. Nandy, Bhargab B. Bhattacharya

Proceedings of the Combinatorial Image Analysis - 21st International Workshop, 2022

Half-Guarding Weakly-Visible Polygons and Terrains.

Nandhana Duraisamy, Hannah Miller Hillberg, Ramesh K. Jallu, Erik Krohn, Anil Maheshwari, Subhas C. Nandy, Alex Pahlow

Proceedings of the 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2022

Exact Algorithms and Hardness Results for Geometric Red-Blue Hitting Set Problem.

Raghunath Reddy Madireddy, Subhas C. Nandy, Supantha Pandit

Proceedings of the Frontiers of Algorithmic Wisdom, 2022

2021

Algorithms and Discrete Mathematics - celebrating the silver jubilee of IITG Guwahati.

Gautam Kumar Das, Subhas C. Nandy, M. Sohel Rahman

Theor. Comput. Sci., 2021

Color-spanning localized query.

Ankush Acharyya, Anil Maheshwari, Subhas C. Nandy

Theor. Comput. Sci., 2021

The Euclidean k-supplier problem in IR2.

Manjanna Basappa, Ramesh K. Jallu, Gautam K. Das, Subhas C. Nandy

Oper. Res. Lett., 2021

Sparsity of weighted networks: Measures and applications.

Swati Goswami, Asit Kumar Das, Subhas C. Nandy

Inf. Sci., 2021

On the minimum spanning tree problem in imprecise set-up.

Sanjana Dey, Ramesh K. Jallu, Subhas C. Nandy

CoRR, 2021

On the Geometric Red-Blue Set Cover Problem.

Raghunath Reddy Madireddy, Subhas C. Nandy, Supantha Pandit

Proceedings of the WALCOM: Algorithms and Computation, 2021

Minimum Consistent Subset Problem for Trees.

Sanjana Dey, Anil Maheshwari, Subhas C. Nandy

Proceedings of the Fundamentals of Computation Theory - 23rd International Symposium, 2021

An Acrophobic Guard Watchtower Problem on Terrains.

Ritesh Seth, Anil Maheshwari, Subhas C. Nandy

Proceedings of the 33rd Canadian Conference on Computational Geometry, 2021

2020

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].

Sanjib Sadhu, Xiaozhou He, Sasanka Roy, Subhas C. Nandy, Suchismita Roy

Theor. Comput. Sci., 2020

Range assignment of base-stations maximizing coverage area without interference.

Ankush Acharyya, Minati De, Subhas C. Nandy, Bodhayan Roy

Theor. Comput. Sci., 2020

Efficient Algorithm for Computing the Triangle Maximizing the Length of Its Smallest Side Inside a Convex Polygon.

Sanjib Sadhu, Sasanka Roy, Soumen Nandi, Subhas C. Nandy, Suchismita Roy

Int. J. Found. Comput. Sci., 2020

Constant work-space algorithms for facility location problems.

Binay K. Bhattacharya, Minati De, Subhas C. Nandy, Sasanka Roy

Discret. Appl. Math., 2020

Color spanning objects: Algorithms and hardness results.

Sandip Banerjee, Neeldhara Misra, Subhas C. Nandy

Discret. Appl. Math., 2020

Variations of largest rectangle recognition amidst a bichromatic point set.

Ankush Acharyya, Minati De, Subhas C. Nandy, Supantha Pandit

Discret. Appl. Math., 2020

The Generalized Independent and Dominating Set Problems on Unit Disk Graphs.

Sangram Kishor Jena, Ramesh K. Jallu, Gautam K. Das, Subhas C. Nandy

CoRR, 2020

Discriminating Codes in Geometric Setups.

Sanjana Dey, Florent Foucaud, Subhas C. Nandy, Arunabha Sen

Proceedings of the 31st International Symposium on Algorithms and Computation, 2020

2019

Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares.

Sanjib Sadhu, Sasanka Roy, Subhas C. Nandy, Suchismita Roy

Theor. Comput. Sci., 2019

Optimization of Multi-Target Sample Preparation On-Demand With Digital Microfluidic Biochips.

Sudip Poddar, Sukanta Bhattacharjee, Subhas C. Nandy, Krishnendu Chakrabarty, Bhargab B. Bhattacharya

IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2019

Partial Enclosure Range Searching.

Gregory Bint, Anil Maheshwari, Michiel H. M. Smid, Subhas C. Nandy

Int. J. Comput. Geom. Appl., 2019

Two-center of the Convex Hull of a Point Set: Dynamic Model, and Restricted Streaming Model.

Sanjib Sadhu, Sasanka Roy, Soumen Nandi, Anil Maheshwari, Subhas C. Nandy

Fundam. Informaticae, 2019

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.

Sanjib Sadhu, Xiaozhou He, Sasanka Roy, Subhas C. Nandy, Suchismita Roy

CoRR, 2019

Covering segments with unit squares.

Ankush Acharyya, Subhas C. Nandy, Supantha Pandit, Sasanka Roy

Comput. Geom., 2019

Sensor Networks for Structural Health Monitoring of Critical Infrastructures Using Identifying Codes.

Kaustav Basu, Sanjana Dey, Subhas C. Nandy, Arunabha Sen

Proceedings of the 15th International Conference on the Design of Reliable Communication Networks, 2019

Localized Query: Color Spanning Variations.

Ankush Acharyya, Anil Maheshwari, Subhas C. Nandy

Proceedings of the Algorithms and Discrete Applied Mathematics, 2019

2018

Minimum width color spanning annulus.

Ankush Acharyya, Subhas C. Nandy, Sasanka Roy

Theor. Comput. Sci., 2018

Geometric Path Problems with Violations.

Anil Maheshwari, Subhas C. Nandy, Drimit Pattanayak, Sasanka Roy, Michiel H. M. Smid

Algorithmica, 2018

Guarding Polyhedral Terrain by k-Watchtowers.

Nitesh Tripathi, Manjish Pal, Minati De, Gautam K. Das, Subhas C. Nandy

Proceedings of the Frontiers in Algorithmics - 12th International Workshop, 2018

The Maximum Distance-d Independent Set Problem on Unit Disk Graphs.

Sangram Kishor Jena, Ramesh K. Jallu, Gautam K. Das, Subhas C. Nandy

Proceedings of the Frontiers in Algorithmics - 12th International Workshop, 2018

Minimum Spanning Tree of Line Segments.

Sanjana Dey, Ramesh K. Jallu, Subhas C. Nandy

Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

2017

Geometric Graphs: Theory and Applications (NII Shonan Meeting 2017-16).

Naoki Katoh, Hee-Kap Ahn, Subhas C. Nandy

NII Shonan Meet. Rep., 2017

Faster approximation for maximum independent set on unit disk graph.

Subhas C. Nandy, Supantha Pandit, Sasanka Roy

Inf. Process. Lett., 2017

Rectilinear path problems in restricted memory setup.

Binay K. Bhattacharya, Minati De, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy

Discret. Appl. Math., 2017

An optimal algorithm for plane matchings in multipartite geometric graphs.

Ahmad Biniaz, Anil Maheshwari, Subhas C. Nandy, Michiel H. M. Smid

Comput. Geom., 2017

Computing the Triangle Maximizing the Length of Its Smallest Side Inside a Convex Polygon.

Sanjib Sadhu, Sasanka Roy, Soumen Nandi, Subhas C. Nandy, Suchismita Roy

Proceedings of the Computational Science and Its Applications - ICCSA 2017, 2017

Optimal Covering and Hitting of Line Segments by Two Axis-Parallel Squares.

Sanjib Sadhu, Sasanka Roy, Subhas C. Nandy, Suchismita Roy

Proceedings of the Computing and Combinatorics - 23rd International Conference, 2017

Covering Points: Minimizing the Maximum Depth.

Subhas C. Nandy, Supantha Pandit, Sasanka Roy

Proceedings of the 29th Canadian Conference on Computational Geometry, 2017

Range Assignment of Base-Stations Maximizing Coverage Area without Interference.

Ankush Acharyya, Minati De, Subhas C. Nandy

Proceedings of the 29th Canadian Conference on Computational Geometry, 2017

2016

Space-efficient algorithm for computing a centerpoint of a set of points in R².

Binay K. Bhattacharya, Subhas C. Nandy, Sasanka Roy

Theor. Comput. Sci., 2016

The Runaway Rectangle Escape Problem.

Aniket Basu Roy, Anil Maheshwari, Sathish Govindarajan, Neeldhara Misra, Subhas C. Nandy, Shreyas Shetty

CoRR, 2016

Color Spanning Annulus: Square, Rectangle and Equilateral Triangle.

Ankush Acharyya, Subhas C. Nandy, Sasanka Roy

CoRR, 2016

Covering segments with axis-parallel unit squares.

Ankush Acharyya, Subhas C. Nandy, Supantha Pandit, Sasanka Roy

CoRR, 2016

The Euclidean k-Supplier Problem in.

Manjanna Basappa, Ramesh K. Jallu, Gautam K. Das, Subhas C. Nandy

Proceedings of the Algorithms for Sensor Systems, 2016

2015

Prune-and-search with limited workspace.

Minati De, Subhas C. Nandy, Sasanka Roy

J. Comput. Syst. Sci., 2015

Approximation algorithms for maximum independent set of a unit disk graph.

Gautam K. Das, Minati De, Sudeshna Kolay, Subhas C. Nandy, Susmita Sur-Kolay

Inf. Process. Lett., 2015

Minimum Dominating Set Problem for Unit Disks Revisited.

Paz Carmi, Gautam K. Das, Ramesh K. Jallu, Subhas C. Nandy, Prajwal R. Prasad, Yael Stein

Int. J. Comput. Geom. Appl., 2015

Approximation algorithms for the two-center problem of convex polygon.

Sanjib Sadhu, Sasanka Roy, Soumen Nandi, Anil Maheshwari, Subhas C. Nandy

CoRR, 2015

YAHMD - Yet another heap memory debugger.

Debapriyay Mukhopadhyay, Subhas C. Nandy

Proceedings of the 2nd IEEE International Conference on Recent Trends in Information Systems, 2015

On Density, Threshold and Emptiness Queries for Intervals in the Streaming Model.

Arijit Bishnu, Amit Chakrabarti, Subhas C. Nandy, Sandeep Sen

Proceedings of the 35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science, 2015

2014

Line coverage measures in wireless sensor networks.

Dinesh Dash, Arobinda Gupta, Arijit Bishnu, Subhas C. Nandy

J. Parallel Distributed Comput., 2014

Efficient multiple-precision integer division algorithm.

Debapriyay Mukhopadhyay, Subhas C. Nandy

Inf. Process. Lett., 2014

In-place algorithms for computing a largest clique in geometric intersection graphs.

Minati De, Subhas C. Nandy, Sasanka Roy

Discret. Appl. Math., 2014

Facility location problems in the constant work-space read-only memory model.

Binay K. Bhattacharya, Minati De, Subhas C. Nandy, Sasanka Roy

CoRR, 2014

Space-Efficient Algorithm for Computing a Centerpoint of a Point Set in R^2.

Binay K. Bhattacharya, Subhas C. Nandy, Sasanka Roy

Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

Maximum Independent Set for Interval Graphs and Trees in Space Efficient Models.

Binay K. Bhattacharya, Minati De, Subhas C. Nandy, Sasanka Roy

Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

2013

Approximation algorithms for deployment of sensors for line segment coverage in wireless sensor networks.

Dinesh Dash, Arijit Bishnu, Arobinda Gupta, Subhas C. Nandy

Wirel. Networks, 2013

Some variations on constrained minimum enclosing circle problem.

Arindam Karmakar, Sandip Das, Subhas C. Nandy, Binay K. Bhattacharya

J. Comb. Optim., 2013

Approximation Algorithms for a Variant of discrete Piercing Set Problem for Unit Disks.

Minati De, Gautam K. Das, Paz Carmi, Subhas C. Nandy

Int. J. Comput. Geom. Appl., 2013

New variations of the maximum coverage facility location problem.

Bhaswar B. Bhattacharya, Subhas C. Nandy

Eur. J. Oper. Res., 2013

Diffuse reflection diameter and radius for convex-quadrilateralizable polygons.

Arindam Khan, Sudebkumar Prasant Pal, Mridul Aanjaneya, Arijit Bishnu, Subhas C. Nandy

Discret. Appl. Math., 2013

An in-place min-max priority search tree.

Minati De, Anil Maheshwari, Subhas C. Nandy, Michiel H. M. Smid

Comput. Geom., 2013

Localized geometric query problems.

John Augustine, Sandip Das, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy, Swami Sarvattomananda

Comput. Geom., 2013

2012

Algorithms for computing diffuse reflection paths in polygons.

Subir Kumar Ghosh, Partha P. Goswami, Anil Maheshwari, Subhas C. Nandy, Sudebkumar Prasant Pal, Swami Sarvattomananda

Vis. Comput., 2012

Preface.

Subhas C. Nandy, Sandeep Sen

Theor. Comput. Sci., 2012

Convex Hull and Linear Programming in Read-only Setup with Limited Work-space

Minati De, Subhas C. Nandy, Sasanka Roy

CoRR, 2012

Greedy is good: An experimental study on minimum clique cover and maximum independent set problems for randomly generated rectangles

Ritankar Mandal, Anirban Ghosh, Sasanka Roy, Subhas C. Nandy

CoRR, 2012

Space-efficient Algorithms for Visibility Problems in Simple Polygon

Minati De, Anil Maheshwari, Subhas C. Nandy

CoRR, 2012

Finding the Quality of Line Coverage of a Sensor Network - (Poster Paper).

Dinesh Dash, Arijit Bishnu, Arobinda Gupta, Subhas C. Nandy

Proceedings of the Distributed Computing and Networking - 13th International Conference, 2012

Minimum Enclosing Circle with Few Extra Variables.

Minati De, Subhas C. Nandy, Sasanka Roy

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2012

2011

On the number of shortest descending paths on the surface of a convex terrain.

Mustaq Ahmed, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy

J. Discrete Algorithms, 2011

Measuring the Quality of Surveillance in a Wireless Sensor Network.

Debashis Mondal, Abhay Kumar, Arijit Bishnu, Krishnendu Mukhopadhyaya, Subhas C. Nandy

Int. J. Found. Comput. Sci., 2011

Inplace Algorithm for Priority Search Tree and its use in Computing Largest Empty Axis-Parallel Rectangle

Minati De, Subhas C. Nandy

CoRR, 2011

Space-efficient Algorithms for Empty Space Recognition among a Point Set in 2D and 3D.

Minati De, Subhas C. Nandy

Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

An In-Place Priority Search Tree.

Minati De, Anil Maheshwari, Subhas C. Nandy, Michiel H. M. Smid

Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

Approximation Algorithms for the Discrete Piercing Set Problem for Unit Disks.

Minati De, Gautam K. Das, Subhas C. Nandy

Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

2010

Recognition of largest empty orthoconvex polygon in a point set.

Subhas C. Nandy, Krishnendu Mukhopadhyaya, Bhargab B. Bhattacharya

Inf. Process. Lett., 2010

Separating Multi-Color Points on a Plane with Fewest Axis-Parallel Lines.

Subhashis Majumder, Subhas C. Nandy, Bhargab B. Bhattacharya

Fundam. Informaticae, 2010

Approximation Algorithm for Line Segment Coverage for Wireless Sensor Network

Dinesh Dash, Arijit Bishnu, Arobinda Gupta, Subhas C. Nandy

CoRR, 2010

Recognizing the Largest Empty Circle and Axis-Parallel Rectangle in a Desired Location

John Augustine, Sandip Das, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy, Swami Sarvattomananda

CoRR, 2010

Homogeneous 2-hop broadcast in 2D.

Gautam K. Das, Sandip Das, Subhas C. Nandy

Comput. Geom., 2010

A Simple Algorithm for Approximate Partial Point Set Pattern Matching under Rigid Motion.

Arijit Bishnu, Sandip Das, Subhas C. Nandy, Bhargab B. Bhattacharya

Proceedings of the WALCOM: Algorithms and Computation, 4th International Workshop, 2010

Cluster connecting problem inside a polygon.

Sanjib Sadhu, Arijit Bishnu, Subhas C. Nandy, Partha P. Goswami

Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010

Computing the straight skeleton of a monotone polygon in O(n log n) time.

Gautam K. Das, Asish Mukhopadhyay, Subhas C. Nandy, Sangameswar Patil, S. V. Rao

Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010

New variations of the reverse facility location problem.

Bhaswar B. Bhattacharya, Subhas C. Nandy

Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010

2009

FPGA placement using space-filling curves: Theory meets practice.

Pritha Banerjee, Susmita Sur-Kolay, Arijit Bishnu, Sandip Das, Subhas C. Nandy, Subhasis Bhattacharjee

ACM Trans. Embed. Comput. Syst., 2009

A new fast heuristic for labeling points.

Sasanka Roy, Subhasis Bhattacharjee, Sandip Das, Subhas C. Nandy

Inf. Process. Lett., 2009

Improved algorithm for the widest empty 1-corner corridor.

Gautam K. Das, Debapriyay Mukhopadhyay, Subhas C. Nandy

Inf. Process. Lett., 2009

Smallest Color-Spanning Object Revisited.

Sandip Das, Partha P. Goswami, Subhas C. Nandy

Int. J. Comput. Geom. Appl., 2009

Constrained minimum enclosing circle with center on a query line segment.

Sasanka Roy, Arindam Karmakar, Sandip Das, Subhas C. Nandy

Comput. Geom., 2009

Improved Algorithm for a Widest 1-Corner Corridor.

Gautam K. Das, Debapriyay Mukhopadhyay, Subhas C. Nandy

Proceedings of the WALCOM: Algorithms and Computation, Third International Workshop, 2009

2008

A Generalization of Magic Squares with Applications to Digital Halftoning.

Boris Aronov, Tetsuo Asano, Yosuke Kikuchi, Subhas C. Nandy, Shinji Sasahara, Takeaki Uno

Theory Comput. Syst., 2008

Weighted broadcast in linear radio networks.

Gautam K. Das, Subhas C. Nandy

Inf. Process. Lett., 2008

Variations of Base-Station Placement Problem on the Boundary of a Convex Region.

Gautam K. Das, Sasanka Roy, Sandip Das, Subhas C. Nandy

Int. J. Found. Comput. Sci., 2008

2007

Chromatic distribution of k-nearest neighbors of a line segment in a planar colored point set.

Partha P. Goswami, Sandip Das, Subhas C. Nandy

Inf. Process. Lett., 2007

Improved Algorithm for Minimum Cost Range Assignment Problem for Linear Radio Networks.

Gautam K. Das, Sasthi C. Ghosh, Subhas C. Nandy

Int. J. Found. Comput. Sci., 2007

Shortest monotone descent path problem in polyhedral terrain.

Sasanka Roy, Sandip Das, Subhas C. Nandy

Comput. Geom., 2007

Base Station Placement Problem on the Boundary of a Convex Region.

Gautam K. Das, Sasanka Roy, Sandip Das, Subhas C. Nandy

Proceedings of the Workshop on Algorithms and Computation 2007, 2007

2006

Range assignment for energy efficient broadcasting in linear radio networks.

Gautam K. Das, Sandip Das, Subhas C. Nandy

Theor. Comput. Sci., 2006

Simple algorithms for partial point set pattern matching under rigid motion.

Arijit Bishnu, Sandip Das, Subhas C. Nandy, Bhargab B. Bhattacharya

Pattern Recognit., 2006

Efficient algorithm for placing a given number of base stations to cover a convex region.

Gautam K. Das, Sandip Das, Subhas C. Nandy, Bhabani P. Sinha

J. Parallel Distributed Comput., 2006

Homogeneous 2-Hops Broadcast in 2D.

Gautam K. Das, Sandip Das, Subhas C. Nandy

Proceedings of the Computational Science and Its Applications, 2006

2005

Smallest <i>k</i>-point enclosing rectangle and square of arbitrary orientation.

Sandip Das, Partha P. Goswami, Subhas C. Nandy

Inf. Process. Lett., 2005

Hot Spots and Zones in a Chip: A Geometrician's View.

Subhashis Majumder, Susmita Sur-Kolay, Subhas C. Nandy, Bhargab B. Bhattacharya, B. Chakraborty

Proceedings of the 18th International Conference on VLSI Design (VLSI Design 2005), 2005

Placing a Given Number of Base Stations to Cover a Convex Region.

Gautam K. Das, Sandip Das, Subhas C. Nandy, Bhabani P. Sinha

Proceedings of the Distributed Computing, 2005

Recognition of Minimum Width Color-Spanning Corridor and Minimum Area Color-Spanning Rectangle.

Sandip Das, Partha P. Goswami, Subhas C. Nandy

Proceedings of the Computational Science and Its Applications, 2005

Fast FPGA Placement using Space-filling Curve.

Pritha Banerjee, Subhasis Bhattacharjee, Susmita Sur-Kolay, Sandip Das, Subhas C. Nandy

Proceedings of the 2005 International Conference on Field Programmable Logic and Applications (FPL), 2005

A Fast Algorithm for Point Labeling Problem.

Sasanka Roy, Subhasis Bhattacharjee, Sandip Das, Subhas C. Nandy

Proceedings of the 17th Canadian Conference on Computational Geometry, 2005

2004

On Finding A Staircase Channel With Minimum Crossing Nets In A VLSI Floorplan.

Subhashis Majumder, Subhas C. Nandy, Bhargab B. Bhattacharya

J. Circuits Syst. Comput., 2004

Optimal algorithm for a special point-labeling problem.

Sasanka Roy, Partha P. Goswami, Sandip Das, Subhas C. Nandy

Inf. Process. Lett., 2004

Triangular range counting query in 2D and its application in finding k nearest neighbors of a line segment.

Partha P. Goswami, Sandip Das, Subhas C. Nandy

Comput. Geom., 2004

A Practical Algorithm for Approximating Shortest Weighted Path between a Pair of Points on Polyhedral Surface.

Sasanka Roy, Sandip Das, Subhas C. Nandy

Proceedings of the Computational Science and Its Applications, 2004

Efficient Algorithm for Energy Efficient Broadcasting in Linear Radio Networks.

Gautam K. Das, Sandip Das, Subhas C. Nandy

Proceedings of the High Performance Computing, 2004

An efficient heuristic algorithm for 2D h-hops range assignment problem.

Gautam K. Das, Sasthi C. Ghosh, Subhas C. Nandy

Proceedings of the Global Telecommunications Conference, 2004. GLOBECOM '04, Dallas, Texas, USA, 29 November, 2004

Smallest k point enclosing rectangle of arbitrary orientation.

Sandip Das, Partha P. Goswami, Subhas C. Nandy

Proceedings of the 16th Canadian Conference on Computational Geometry, 2004

2003

An efficient k nearest neighbors searching algorithm for a query line.

Subhas C. Nandy, Sandip Das, Partha P. Goswami

Theor. Comput. Sci., 2003

Largest empty rectangle among a point set.

Jeet Chaudhuri, Subhas C. Nandy, Sandip Das

J. Algorithms, 2003

On finding an empty staircase polygon of largest area (width) in a planar point-set.

Subhas C. Nandy, Bhargab B. Bhattacharya

Comput. Geom., 2003

An Improved Algorithm for Point Set Pattern Matching under Rigid Motion.

Arijit Bishnu, Sandip Das, Subhas C. Nandy, Bhargab B. Bhattacharya

Proceedings of the Algorithms and Complexity, 5th Italian Conference, 2003

2002

Monotone bipartitioning problem in a planar point set with applications to VLSI.

Parthasarathi Dasgupta, Peichen Pan, Subhas C. Nandy, Bhargab B. Bhattacharya

ACM Trans. Design Autom. Electr. Syst., 2002

Shattering a set of objects in 2D.

Subhas C. Nandy, Tetsuo Asano, Tomohiro Harayama

Discret. Appl. Math., 2002

Translating a convex polyhedron over monotone polyhedra.

Tetsuo Asano, Antonio Hernández-Barrera, Subhas C. Nandy

Comput. Geom., 2002

Simplex Range Searching and k Nearest Neighbors of a Line Segment in 2D.

Partha P. Goswami, Sandip Das, Subhas C. Nandy

Proceedings of the Algorithm Theory, 2002

2001

Searching networks with unrestricted edge costs.

Parthasarathi Dasgupta, Anup K. Sen, Subhas C. Nandy, Bhargab B. Bhattacharya

IEEE Trans. Syst. Man Cybern. Part A, 2001

Dynamically maintaining the widest k-dense corridor.

Subhas C. Nandy, Tomohiro Harayama, Tetsuo Asano

Theor. Comput. Sci., 2001

Area(number)-balanced hierarchy of staircase channels with minimum crossing nets.

Subhashis Majumder, Susmita Sur-Kolay, Bhargab B. Bhattacharya, Subhas C. Nandy

Proceedings of the 2001 International Symposium on Circuits and Systems, 2001

2000

Safety Zone Problem.

Subhas C. Nandy, Bhargab B. Bhattacharya, Antonio Hernández-Barrera

J. Algorithms, 2000

An Efficient k Nearest Neighbor Searching Algorithm for a Query Line.

Subhas C. Nandy

Proceedings of the Computing and Combinatorics, 6th Annual International Conference, 2000

1999

High Performance MCM Routing: A New Approach.

Sandip Das, Subhas C. Nandy, Bhargab B. Bhattacharya

Proceedings of the 12th International Conference on VLSI Design (VLSI Design 1999), 1999

Largest Empty Rectangle among a Point Set.

Jeet Chaudhuri, Subhas C. Nandy

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1999

Generalized Shooter Location Problem.

Jeet Chaudhuri, Subhas C. Nandy

Proceedings of the Computing and Combinatorics, 5th Annual International Conference, 1999

Shattering a set of objects in 2d.

Subhas C. Nandy

Proceedings of the 11th Canadian Conference on Computational Geometry, 1999

1998

Efficient Computation of Rectilinear Geodesic Voronoi Neighbor in the Presence of Obstacles.

Pinaki Mitra, Subhas C. Nandy

J. Algorithms, 1998

Partitioning VLSI Floorplans by Staircase Channels for Global Routing.

Subhashis Majumder, Subhas C. Nandy, Bhargab B. Bhattacharya

Proceedings of the 11th International Conference on VLSI Design (VLSI Design 1991), 1998

1996

Geometric bipartitioning problem and its applications to VLSI.

Parthasarathi Dasgupta, Anup K. Sen, Subhas C. Nandy, Bhargab B. Bhattacharya

Proceedings of the 9th International Conference on VLSI Design (VLSI Design 1996), 1996

Shooter Location Problem.

Subhas C. Nandy, Krishnendu Mukhopadhyaya, Bhargab B. Bhattacharya

Proceedings of the 8th Canadian Conference on Computational Geometry, 1996

1994

Location of the Largest Empty Rectangle among Arbitrary Obstacles.

Subhas C. Nandy, Arani Sinha, Bhargab B. Bhattacharya

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1994

1990

Efficiency of logistic-normal stochastic supervision.

Thriyambakam Krishnan, Subhas C. Nandy

Pattern Recognit., 1990

Efficiency of discriminant analysis when initial samples are classified stochastically.

Thriyambakam Krishnan, Subhas C. Nandy

Pattern Recognit., 1990

Efficient algorithms for Identifying All Maximal Isothetic Empty Rectangles in VLSI Layout Design.

Subhas C. Nandy, Bhargab B. Bhattacharya, Sibabrata Ray

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1990

1987

Discriminant analysis with a stochastic supervisor.

Thriyambakam Krishnan, Subhas C. Nandy

Pattern Recognit., 1987