Subhas C. Nandy

Affiliations:
  • Indian Statistical Institute, India


According to our database1, Subhas C. Nandy authored at least 140 papers between 1987 and 2021.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Algorithms and Discrete Mathematics - celebrating the silver jubilee of IITG Guwahati.
Theor. Comput. Sci., 2021

Color-spanning localized query.
Theor. Comput. Sci., 2021

The Euclidean k-supplier problem in IR2.
Oper. Res. Lett., 2021

Sparsity of weighted networks: Measures and applications.
Inf. Sci., 2021

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

On the Geometric Red-Blue Set Cover Problem.
Proceedings of the WALCOM: Algorithms and Computation, 2021

Minimum Consistent Subset Problem for Trees.
Proceedings of the Fundamentals of Computation Theory - 23rd International Symposium, 2021

An Acrophobic Guard Watchtower Problem on Terrains.
Proceedings of the 33rd Canadian Conference on Computational Geometry, 2021

Minimum Consistent Subset of Simple Graph Classes.
Proceedings of the Algorithms and Discrete Applied Mathematics, 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].
Theor. Comput. Sci., 2020

Range assignment of base-stations maximizing coverage area without interference.
Theor. Comput. Sci., 2020

Efficient Algorithm for Computing the Triangle Maximizing the Length of Its Smallest Side Inside a Convex Polygon.
Int. J. Found. Comput. Sci., 2020

Constant work-space algorithms for facility location problems.
Discret. Appl. Math., 2020

Color spanning objects: Algorithms and hardness results.
Discret. Appl. Math., 2020

Variations of largest rectangle recognition amidst a bichromatic point set.
Discret. Appl. Math., 2020

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

Discriminating Codes in Geometric Setups.
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.
Theor. Comput. Sci., 2019

Optimization of Multi-Target Sample Preparation On-Demand With Digital Microfluidic Biochips.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2019

Partial Enclosure Range Searching.
Int. J. Comput. Geom. Appl., 2019

Two-center of the Convex Hull of a Point Set: Dynamic Model, and Restricted Streaming Model.
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.
CoRR, 2019

Covering segments with unit squares.
Comput. Geom., 2019

Sensor Networks for Structural Health Monitoring of Critical Infrastructures Using Identifying Codes.
Proceedings of the 15th International Conference on the Design of Reliable Communication Networks, 2019

Localized Query: Color Spanning Variations.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2019

2018
Minimum width color spanning annulus.
Theor. Comput. Sci., 2018

Geometric Path Problems with Violations.
Algorithmica, 2018

Guarding Polyhedral Terrain by k-Watchtowers.
Proceedings of the Frontiers in Algorithmics - 12th International Workshop, 2018

The Maximum Distance-d Independent Set Problem on Unit Disk Graphs.
Proceedings of the Frontiers in Algorithmics - 12th International Workshop, 2018

Minimum Spanning Tree of Line Segments.
Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

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

Faster approximation for maximum independent set on unit disk graph.
Inf. Process. Lett., 2017

Rectilinear path problems in restricted memory setup.
Discret. Appl. Math., 2017

An optimal algorithm for plane matchings in multipartite geometric graphs.
Comput. Geom., 2017

Computing the Triangle Maximizing the Length of Its Smallest Side Inside a Convex Polygon.
Proceedings of the Computational Science and Its Applications - ICCSA 2017, 2017

Optimal Covering and Hitting of Line Segments by Two Axis-Parallel Squares.
Proceedings of the Computing and Combinatorics - 23rd International Conference, 2017

Covering Points: Minimizing the Maximum Depth.
Proceedings of the 29th Canadian Conference on Computational Geometry, 2017

Range Assignment of Base-Stations Maximizing Coverage Area without Interference.
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<sup>2</sup>.
Theor. Comput. Sci., 2016

The Runaway Rectangle Escape Problem.
CoRR, 2016

Color Spanning Annulus: Square, Rectangle and Equilateral Triangle.
CoRR, 2016

Covering segments with axis-parallel unit squares.
CoRR, 2016

The Euclidean k-Supplier Problem in.
Proceedings of the Algorithms for Sensor Systems, 2016

2015
Prune-and-search with limited workspace.
J. Comput. Syst. Sci., 2015

Approximation algorithms for maximum independent set of a unit disk graph.
Inf. Process. Lett., 2015

Minimum Dominating Set Problem for Unit Disks Revisited.
Int. J. Comput. Geom. Appl., 2015

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

YAHMD - Yet another heap memory debugger.
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.
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.
J. Parallel Distributed Comput., 2014

Efficient multiple-precision integer division algorithm.
Inf. Process. Lett., 2014

In-place algorithms for computing a largest clique in geometric intersection graphs.
Discret. Appl. Math., 2014

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

Space-Efficient Algorithm for Computing a Centerpoint of a Point Set in R^2.
Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

Maximum Independent Set for Interval Graphs and Trees in Space Efficient Models.
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.
Wirel. Networks, 2013

Some variations on constrained minimum enclosing circle problem.
J. Comb. Optim., 2013

Approximation Algorithms for a Variant of discrete Piercing Set Problem for Unit Disks.
Int. J. Comput. Geom. Appl., 2013

New variations of the maximum coverage facility location problem.
Eur. J. Oper. Res., 2013

Diffuse reflection diameter and radius for convex-quadrilateralizable polygons.
Discret. Appl. Math., 2013

An in-place min-max priority search tree.
Comput. Geom., 2013

Localized geometric query problems.
Comput. Geom., 2013

2012
Algorithms for computing diffuse reflection paths in polygons.
Vis. Comput., 2012

Preface.
Theor. Comput. Sci., 2012

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

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

Space-efficient Algorithms for Visibility Problems in Simple Polygon
CoRR, 2012

Finding the Quality of Line Coverage of a Sensor Network - (Poster Paper).
Proceedings of the Distributed Computing and Networking - 13th International Conference, 2012

Minimum Enclosing Circle with Few Extra Variables.
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.
J. Discrete Algorithms, 2011

Measuring the Quality of Surveillance in a Wireless Sensor Network.
Int. J. Found. Comput. Sci., 2011

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

Space-efficient Algorithms for Empty Space Recognition among a Point Set in 2D and 3D.
Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

An In-Place Priority Search Tree.
Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

Approximation Algorithms for the Discrete Piercing Set Problem for Unit Disks.
Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

2010
Recognition of largest empty orthoconvex polygon in a point set.
Inf. Process. Lett., 2010

Separating Multi-Color Points on a Plane with Fewest Axis-Parallel Lines.
Fundam. Informaticae, 2010

Approximation Algorithm for Line Segment Coverage for Wireless Sensor Network
CoRR, 2010

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

Homogeneous 2-hop broadcast in 2D.
Comput. Geom., 2010

A Simple Algorithm for Approximate Partial Point Set Pattern Matching under Rigid Motion.
Proceedings of the WALCOM: Algorithms and Computation, 4th International Workshop, 2010

Cluster connecting problem inside a polygon.
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.
Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010

New variations of the reverse facility location problem.
Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010

2009
FPGA placement using space-filling curves: Theory meets practice.
ACM Trans. Embed. Comput. Syst., 2009

A new fast heuristic for labeling points.
Inf. Process. Lett., 2009

Improved algorithm for the widest empty 1-corner corridor.
Inf. Process. Lett., 2009

Smallest Color-Spanning Object Revisited.
Int. J. Comput. Geom. Appl., 2009

Constrained minimum enclosing circle with center on a query line segment.
Comput. Geom., 2009

Improved Algorithm for a Widest 1-Corner Corridor.
Proceedings of the WALCOM: Algorithms and Computation, Third International Workshop, 2009

2008
A Generalization of Magic Squares with Applications to Digital Halftoning.
Theory Comput. Syst., 2008

Weighted broadcast in linear radio networks.
Inf. Process. Lett., 2008

Variations of Base-Station Placement Problem on the Boundary of a Convex Region.
Int. J. Found. Comput. Sci., 2008

2007
Chromatic distribution of k-nearest neighbors of a line segment in a planar colored point set.
Inf. Process. Lett., 2007

Improved Algorithm for Minimum Cost Range Assignment Problem for Linear Radio Networks.
Int. J. Found. Comput. Sci., 2007

Shortest monotone descent path problem in polyhedral terrain.
Comput. Geom., 2007

Base Station Placement Problem on the Boundary of a Convex Region.
Proceedings of the Workshop on Algorithms and Computation 2007, 2007

2006
Range assignment for energy efficient broadcasting in linear radio networks.
Theor. Comput. Sci., 2006

Simple algorithms for partial point set pattern matching under rigid motion.
Pattern Recognit., 2006

Efficient algorithm for placing a given number of base stations to cover a convex region.
J. Parallel Distributed Comput., 2006

Homogeneous 2-Hops Broadcast in 2D.
Proceedings of the Computational Science and Its Applications, 2006

2005
Smallest <i>k</i>-point enclosing rectangle and square of arbitrary orientation.
Inf. Process. Lett., 2005

Hot Spots and Zones in a Chip: A Geometrician's View.
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.
Proceedings of the Distributed Computing, 2005

Recognition of Minimum Width Color-Spanning Corridor and Minimum Area Color-Spanning Rectangle.
Proceedings of the Computational Science and Its Applications, 2005

Fast FPGA Placement using Space-filling Curve.
Proceedings of the 2005 International Conference on Field Programmable Logic and Applications (FPL), 2005

A Fast Algorithm for Point Labeling Problem.
Proceedings of the 17th Canadian Conference on Computational Geometry, 2005

2004
On Finding A Staircase Channel With Minimum Crossing Nets In A VLSI Floorplan.
J. Circuits Syst. Comput., 2004

Optimal algorithm for a special point-labeling problem.
Inf. Process. Lett., 2004

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

A Practical Algorithm for Approximating Shortest Weighted Path between a Pair of Points on Polyhedral Surface.
Proceedings of the Computational Science and Its Applications, 2004

Efficient Algorithm for Energy Efficient Broadcasting in Linear Radio Networks.
Proceedings of the High Performance Computing, 2004

An efficient heuristic algorithm for 2D h-hops range assignment problem.
Proceedings of the Global Telecommunications Conference, 2004. GLOBECOM '04, Dallas, Texas, USA, 29 November, 2004

Smallest k point enclosing rectangle of arbitrary orientation.
Proceedings of the 16th Canadian Conference on Computational Geometry, 2004

2003
An efficient k nearest neighbors searching algorithm for a query line.
Theor. Comput. Sci., 2003

Largest empty rectangle among a point set.
J. Algorithms, 2003

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

An Improved Algorithm for Point Set Pattern Matching under Rigid Motion.
Proceedings of the Algorithms and Complexity, 5th Italian Conference, 2003

2002
Monotone bipartitioning problem in a planar point set with applications to VLSI.
ACM Trans. Design Autom. Electr. Syst., 2002

Shattering a set of objects in 2D.
Discret. Appl. Math., 2002

Translating a convex polyhedron over monotone polyhedra.
Comput. Geom., 2002

Simplex Range Searching and k Nearest Neighbors of a Line Segment in 2D.
Proceedings of the Algorithm Theory, 2002

2001
Searching networks with unrestricted edge costs.
IEEE Trans. Syst. Man Cybern. Part A, 2001

Dynamically maintaining the widest k-dense corridor.
Theor. Comput. Sci., 2001

Area(number)-balanced hierarchy of staircase channels with minimum crossing nets.
Proceedings of the 2001 International Symposium on Circuits and Systems, 2001

2000
Safety Zone Problem.
J. Algorithms, 2000

An Efficient k Nearest Neighbor Searching Algorithm for a Query Line.
Proceedings of the Computing and Combinatorics, 6th Annual International Conference, 2000

1999
High Performance MCM Routing: A New Approach.
Proceedings of the 12th International Conference on VLSI Design (VLSI Design 1999), 1999

Largest Empty Rectangle among a Point Set.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1999

Generalized Shooter Location Problem.
Proceedings of the Computing and Combinatorics, 5th Annual International Conference, 1999

Shattering a set of objects in 2d.
Proceedings of the 11th Canadian Conference on Computational Geometry, 1999

1998
Efficient Computation of Rectilinear Geodesic Voronoi Neighbor in the Presence of Obstacles.
J. Algorithms, 1998

Partitioning VLSI Floorplans by Staircase Channels for Global Routing.
Proceedings of the 11th International Conference on VLSI Design (VLSI Design 1991), 1998

1996
Geometric bipartitioning problem and its applications to VLSI.
Proceedings of the 9th International Conference on VLSI Design (VLSI Design 1996), 1996

Shooter Location Problem.
Proceedings of the 8th Canadian Conference on Computational Geometry, 1996

1994
Location of the Largest Empty Rectangle among Arbitrary Obstacles.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1994

1990
Efficiency of logistic-normal stochastic supervision.
Pattern Recognit., 1990

Efficiency of discriminant analysis when initial samples are classified stochastically.
Pattern Recognit., 1990

Efficient algorithms for Identifying All Maximal Isothetic Empty Rectangles in VLSI Layout Design.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1990

1987
Discriminant analysis with a stochastic supervisor.
Pattern Recognit., 1987


  Loading...