Subhas C. Nandy
Affiliations: Indian Statistical Institute, India
According to our database^{1},
Subhas C. Nandy
authored at least 140 papers
between 1987 and 2021.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Online presence:

on orcid.org

on isical.ac.in
On csauthors.net:
Bibliography
2021
Algorithms and Discrete Mathematics  celebrating the silver jubilee of IITG Guwahati.
Theor. Comput. Sci., 2021
Theor. Comput. Sci., 2021
Oper. Res. Lett., 2021
Inf. Sci., 2021
CoRR, 2021
Proceedings of the WALCOM: Algorithms and Computation, 2021
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
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 axisparallel squares" [Theor. Comput. Sci. 769 (2019) 6374].
Theor. Comput. Sci., 2020
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
Discret. Appl. Math., 2020
Discret. Appl. Math., 2020
Discret. Appl. Math., 2020
CoRR, 2020
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 axisparallel squares.
Theor. Comput. Sci., 2019
Optimization of MultiTarget Sample Preparation OnDemand With Digital Microfluidic Biochips.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2019
Int. J. Comput. Geom. Appl., 2019
Twocenter 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 axisparallel squares", Theoretical Computer Science 769 (2019) 6374.
CoRR, 2019
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
Proceedings of the Algorithms and Discrete Applied Mathematics, 2019
2018
Theor. Comput. Sci., 2018
Algorithmica, 2018
Proceedings of the Frontiers in Algorithmics  12th International Workshop, 2018
Proceedings of the Frontiers in Algorithmics  12th International Workshop, 2018
Proceedings of the Computing and Combinatorics  24th International Conference, 2018
2017
NII Shonan Meet. Rep., 2017
Inf. Process. Lett., 2017
Discret. Appl. Math., 2017
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
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 BaseStations Maximizing Coverage Area without Interference.
Proceedings of the 29th Canadian Conference on Computational Geometry, 2017
2016
Spaceefficient algorithm for computing a centerpoint of a set of points in R<sup>2</sup>.
Theor. Comput. Sci., 2016
CoRR, 2016
CoRR, 2016
CoRR, 2016
Proceedings of the Algorithms for Sensor Systems, 2016
2015
J. Comput. Syst. Sci., 2015
Inf. Process. Lett., 2015
Int. J. Comput. Geom. Appl., 2015
CoRR, 2015
Proceedings of the 2nd IEEE International Conference on Recent Trends in Information Systems, 2015
Proceedings of the 35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science, 2015
2014
J. Parallel Distributed Comput., 2014
Inf. Process. Lett., 2014
Inplace algorithms for computing a largest clique in geometric intersection graphs.
Discret. Appl. Math., 2014
CoRR, 2014
Proceedings of the 26th Canadian Conference on Computational Geometry, 2014
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
J. Comb. Optim., 2013
Approximation Algorithms for a Variant of discrete Piercing Set Problem for Unit Disks.
Int. J. Comput. Geom. Appl., 2013
Eur. J. Oper. Res., 2013
Discret. Appl. Math., 2013
Comput. Geom., 2013
Comput. Geom., 2013
2012
Vis. Comput., 2012
Theor. Comput. Sci., 2012
CoRR, 2012
Greedy is good: An experimental study on minimum clique cover and maximum independent set problems for randomly generated rectangles
CoRR, 2012
CoRR, 2012
Proceedings of the Distributed Computing and Networking  13th International Conference, 2012
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2012
2011
J. Discrete Algorithms, 2011
Int. J. Found. Comput. Sci., 2011
Inplace Algorithm for Priority Search Tree and its use in Computing Largest Empty AxisParallel Rectangle
CoRR, 2011
Spaceefficient Algorithms for Empty Space Recognition among a Point Set in 2D and 3D.
Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011
Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011
Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011
2010
Inf. Process. Lett., 2010
Fundam. Informaticae, 2010
CoRR, 2010
Recognizing the Largest Empty Circle and AxisParallel Rectangle in a Desired Location
CoRR, 2010
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
Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010
Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010
Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010
2009
ACM Trans. Embed. Comput. Syst., 2009
Inf. Process. Lett., 2009
Inf. Process. Lett., 2009
Int. J. Comput. Geom. Appl., 2009
Comput. Geom., 2009
Proceedings of the WALCOM: Algorithms and Computation, Third International Workshop, 2009
2008
Theory Comput. Syst., 2008
Inf. Process. Lett., 2008
Int. J. Found. Comput. Sci., 2008
2007
Chromatic distribution of knearest 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
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
Theor. Comput. Sci., 2006
Pattern Recognit., 2006
Efficient algorithm for placing a given number of base stations to cover a convex region.
J. Parallel Distributed Comput., 2006
Proceedings of the Computational Science and Its Applications, 2006
2005
Inf. Process. Lett., 2005
Proceedings of the 18th International Conference on VLSI Design (VLSI Design 2005), 2005
Proceedings of the Distributed Computing, 2005
Recognition of Minimum Width ColorSpanning Corridor and Minimum Area ColorSpanning Rectangle.
Proceedings of the Computational Science and Its Applications, 2005
Proceedings of the 2005 International Conference on Field Programmable Logic and Applications (FPL), 2005
Proceedings of the 17th Canadian Conference on Computational Geometry, 2005
2004
J. Circuits Syst. Comput., 2004
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
Proceedings of the High Performance Computing, 2004
Proceedings of the Global Telecommunications Conference, 2004. GLOBECOM '04, Dallas, Texas, USA, 29 November, 2004
Proceedings of the 16th Canadian Conference on Computational Geometry, 2004
2003
Theor. Comput. Sci., 2003
J. Algorithms, 2003
On finding an empty staircase polygon of largest area (width) in a planar pointset.
Comput. Geom., 2003
Proceedings of the Algorithms and Complexity, 5th Italian Conference, 2003
2002
ACM Trans. Design Autom. Electr. Syst., 2002
Discret. Appl. Math., 2002
Comput. Geom., 2002
Proceedings of the Algorithm Theory, 2002
2001
IEEE Trans. Syst. Man Cybern. Part A, 2001
Theor. Comput. Sci., 2001
Proceedings of the 2001 International Symposium on Circuits and Systems, 2001
2000
J. Algorithms, 2000
Proceedings of the Computing and Combinatorics, 6th Annual International Conference, 2000
1999
Proceedings of the 12th International Conference on VLSI Design (VLSI Design 1999), 1999
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1999
Proceedings of the Computing and Combinatorics, 5th Annual International Conference, 1999
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
Proceedings of the 11th International Conference on VLSI Design (VLSI Design 1991), 1998
1996
Proceedings of the 9th International Conference on VLSI Design (VLSI Design 1996), 1996
Proceedings of the 8th Canadian Conference on Computational Geometry, 1996
1994
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1994
1990
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
Pattern Recognit., 1987