Discriminant analysis with a stochastic supervisor. - Thriyambakam Krishnan; Subhas C. Nandy (Pattern Recognit., 1987)

Efficient algorithms for Identifying All Maximal Isothetic Empty Rectangles in VLSI Layout Design. - Subhas C. Nandy; Bhargab B. Bhattacharya; Sibabrata Ray (FSTTCS, 1990)

Efficiency of discriminant analysis when initial samples are classified stochastically. - Thriyambakam Krishnan; Subhas C. Nandy (Pattern Recognit., 1990)

Efficiency of logistic-normal stochastic supervision. - Thriyambakam Krishnan; Subhas C. Nandy (Pattern Recognit., 1990)

Location of the Largest Empty Rectangle among Arbitrary Obstacles. - Subhas C. Nandy; Arani Sinha; Bhargab B. Bhattacharya (FSTTCS, 1994)

Shooter Location Problem. - Subhas C. Nandy; Krishnendu Mukhopadhyaya; Bhargab B. Bhattacharya (CCCG, 1996)

Geometric bipartitioning problem and its applications to VLSI. - Parthasarathi Dasgupta; Anup K. Sen; Subhas C. Nandy; Bhargab B. Bhattacharya (VLSI Design, 1996)

Partitioning VLSI Floorplans by Staircase Channels for Global Routing. - Subhashis Majumder; Subhas C. Nandy; Bhargab B. Bhattacharya (VLSI Design, 1998)

Efficient Computation of Rectilinear Geodesic Voronoi Neighbor in the Presence of Obstacles. - Pinaki Mitra; Subhas C. Nandy (J. Algorithms, 1998)

Shattering a set of objects in 2d. - Subhas C. Nandy (CCCG, 1999)

Generalized Shooter Location Problem. - Jeet Chaudhuri; Subhas C. Nandy (COCOON, 1999)

Largest Empty Rectangle among a Point Set. - Jeet Chaudhuri; Subhas C. Nandy (FSTTCS, 1999)

High Performance MCM Routing: A New Approach. - Sandip Das 001; Subhas C. Nandy; Bhargab B. Bhattacharya (VLSI Design, 1999)

An Efficient k Nearest Neighbor Searching Algorithm for a Query Line. - Subhas C. Nandy (COCOON, 2000)

Safety Zone Problem. - Subhas C. Nandy; Bhargab B. Bhattacharya; Antonio Hernández-Barrera (J. Algorithms, 2000)

Area(number)-balanced hierarchy of staircase channels with minimum crossing nets. - Subhashis Majumder; Susmita Sur-Kolay; Bhargab B. Bhattacharya; Subhas C. Nandy (ISCAS (5), 2001)

Dynamically maintaining the widest k-dense corridor. - Subhas C. Nandy; Tomohiro Harayama; Tetsuo Asano (Theor. Comput. Sci., 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)

Simplex Range Searching and k Nearest Neighbors of a Line Segment in 2D. - Partha P. Goswami; Sandip Das 001; Subhas C. Nandy (SWAT, 2002)

Translating a convex polyhedron over monotone polyhedra. - Tetsuo Asano; Antonio Hernández-Barrera; Subhas C. Nandy (Comput. Geom., 2002)

Shattering a set of objects in 2D. - Subhas C. Nandy; Tetsuo Asano; Tomohiro Harayama (Discret. Appl. Math., 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)

An Improved Algorithm for Point Set Pattern Matching under Rigid Motion. - Arijit Bishnu; Sandip Das 001; Subhas C. Nandy; Bhargab B. Bhattacharya (CIAC, 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)

Largest empty rectangle among a point set. - Jeet Chaudhuri; Subhas C. Nandy; Sandip Das 001 (J. Algorithms, 2003)

An efficient k nearest neighbors searching algorithm for a query line. - Subhas C. Nandy; Sandip Das 001; Partha P. Goswami (Theor. Comput. Sci., 2003)

Smallest k point enclosing rectangle of arbitrary orientation. - Sandip Das 001; Partha P. Goswami; Subhas C. Nandy (CCCG, 2004)

An efficient heuristic algorithm for 2D h-hops range assignment problem. - Gautam K. Das; Sasthi C. Ghosh 001; Subhas C. Nandy (GLOBECOM, 2004)

Efficient Algorithm for Energy Efficient Broadcasting in Linear Radio Networks. - Gautam K. Das; Sandip Das 001; Subhas C. Nandy (HiPC, 2004)

A Practical Algorithm for Approximating Shortest Weighted Path between a Pair of Points on Polyhedral Surface. - Sasanka Roy; Sandip Das 001; Subhas C. Nandy (ICCSA (3), 2004)

Triangular range counting query in 2D and its application in finding k nearest neighbors of a line segment. - Partha P. Goswami; Sandip Das 001; Subhas C. Nandy (Comput. Geom., 2004)

Optimal algorithm for a special point-labeling problem. - Sasanka Roy; Partha P. Goswami; Sandip Das 001; Subhas C. Nandy (Inf. Process. Lett., 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)

A Fast Algorithm for Point Labeling Problem. - Sasanka Roy; Subhasis Bhattacharjee; Sandip Das 001; Subhas C. Nandy (CCCG, 2005)

Fast FPGA Placement using Space-filling Curve. - Pritha Banerjee 001; Subhasis Bhattacharjee; Susmita Sur-Kolay; Sandip Das 001; Subhas C. Nandy (FPL, 2005)

Recognition of Minimum Width Color-Spanning Corridor and Minimum Area Color-Spanning Rectangle. - Sandip Das 001; Partha P. Goswami; Subhas C. Nandy (ICCSA (1), 2005)

Placing a Given Number of Base Stations to Cover a Convex Region. - Gautam K. Das; Sandip Das 001; Subhas C. Nandy; Bhabani P. Sinha (IWDC, 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 (VLSI Design, 2005)

Smallest k-point enclosing rectangle and square of arbitrary orientation. - Sandip Das 001; Partha P. Goswami; Subhas C. Nandy (Inf. Process. Lett., 2005)

Homogeneous 2-Hops Broadcast in 2D. - Gautam K. Das; Sandip Das 001; Subhas C. Nandy (ICCSA (2), 2006)

Efficient algorithm for placing a given number of base stations to cover a convex region. - Gautam K. Das; Sandip Das 001; Subhas C. Nandy; Bhabani P. Sinha (J. Parallel Distributed Comput., 2006)

Simple algorithms for partial point set pattern matching under rigid motion. - Arijit Bishnu; Sandip Das 001; Subhas C. Nandy; Bhargab B. Bhattacharya (Pattern Recognit., 2006)

Range assignment for energy efficient broadcasting in linear radio networks. - Gautam K. Das; Sandip Das 001; Subhas C. Nandy (Theor. Comput. Sci., 2006)

Base Station Placement Problem on the Boundary of a Convex Region. - Gautam K. Das; Sasanka Roy; Sandip Das 001; Subhas C. Nandy (WALCOM, 2007)

Shortest monotone descent path problem in polyhedral terrain. - Sasanka Roy; Sandip Das 001; Subhas C. Nandy (Comput. Geom., 2007)

Improved Algorithm for Minimum Cost Range Assignment Problem for Linear Radio Networks. - Gautam K. Das; Sasthi C. Ghosh 001; Subhas C. Nandy (Int. J. Found. Comput. Sci., 2007)

Chromatic distribution of k-nearest neighbors of a line segment in a planar colored point set. - Partha P. Goswami; Sandip Das 001; Subhas C. Nandy (Inf. Process. Lett., 2007)

Variations of Base-Station Placement Problem on the Boundary of a Convex Region. - Gautam K. Das; Sasanka Roy; Sandip Das 001; Subhas C. Nandy (Int. J. Found. Comput. Sci., 2008)

Weighted broadcast in linear radio networks. - Gautam K. Das; Subhas C. Nandy (Inf. Process. Lett., 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)

Improved Algorithm for a Widest 1-Corner Corridor. - Gautam K. Das; Debapriyay Mukhopadhyay; Subhas C. Nandy (WALCOM, 2009)

Constrained minimum enclosing circle with center on a query line segment. - Sasanka Roy; Arindam Karmakar; Sandip Das 001; Subhas C. Nandy (Comput. Geom., 2009)

Smallest Color-Spanning Object Revisited. - Sandip Das 001; Partha P. Goswami; Subhas C. Nandy (Int. J. Comput. Geom. Appl., 2009)

Improved algorithm for the widest empty 1-corner corridor. - Gautam K. Das; Debapriyay Mukhopadhyay; Subhas C. Nandy (Inf. Process. Lett., 2009)

A new fast heuristic for labeling points. - Sasanka Roy; Subhasis Bhattacharjee; Sandip Das 001; Subhas C. Nandy (Inf. Process. Lett., 2009)

FPGA placement using space-filling curves: Theory meets practice. - Pritha Banerjee 001; Susmita Sur-Kolay; Arijit Bishnu; Sandip Das 001; Subhas C. Nandy; Subhasis Bhattacharjee (ACM Trans. Embed. Comput. Syst., 2009)

New variations of the reverse facility location problem. - Bhaswar B. Bhattacharya; Subhas C. Nandy (CCCG, 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 001 (CCCG, 2010)

Cluster connecting problem inside a polygon. - Sanjib Sadhu; Arijit Bishnu; Subhas C. Nandy; Partha P. Goswami (CCCG, 2010)

A Simple Algorithm for Approximate Partial Point Set Pattern Matching under Rigid Motion. - Arijit Bishnu; Sandip Das 001; Subhas C. Nandy; Bhargab B. Bhattacharya (WALCOM, 2010)

Homogeneous 2-hop broadcast in 2D. - Gautam K. Das; Sandip Das 001; Subhas C. Nandy (Comput. Geom., 2010)

Recognizing the Largest Empty Circle and Axis-Parallel Rectangle in a Desired Location - John Augustine; Sandip Das 001; Anil Maheshwari; Subhas C. Nandy; Sasanka Roy; Swami Sarvattomananda (CoRR, 2010)

Approximation Algorithm for Line Segment Coverage for Wireless Sensor Network - Dinesh Dash; Arijit Bishnu; Arobinda Gupta; Subhas C. Nandy (CoRR, 2010)

Separating Multi-Color Points on a Plane with Fewest Axis-Parallel Lines. - Subhashis Majumder; Subhas C. Nandy; Bhargab B. Bhattacharya (Fundam. Informaticae, 2010)

Recognition of largest empty orthoconvex polygon in a point set. - Subhas C. Nandy; Krishnendu Mukhopadhyaya; Bhargab B. Bhattacharya (Inf. Process. Lett., 2010)

Approximation Algorithms for the Discrete Piercing Set Problem for Unit Disks. - Minati De; Gautam K. Das; Subhas C. Nandy (CCCG, 2011)

An In-Place Priority Search Tree. - Minati De; Anil Maheshwari; Subhas C. Nandy; Michiel H. M. Smid (CCCG, 2011)

Space-efficient Algorithms for Empty Space Recognition among a Point Set in 2D and 3D. - Minati De; Subhas C. Nandy (CCCG, 2011)

Inplace Algorithm for Priority Search Tree and its use in Computing Largest Empty Axis-Parallel Rectangle - Minati De; Subhas C. Nandy (CoRR, 2011)

Measuring the Quality of Surveillance in a Wireless Sensor Network. - Debashis Mondal; Abhay Kumar 006; Arijit Bishnu; Krishnendu Mukhopadhyaya; Subhas C. Nandy (Int. J. Found. Comput. Sci., 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)

Minimum Enclosing Circle with Few Extra Variables. - Minati De; Subhas C. Nandy; Sasanka Roy (FSTTCS, 2012)

Finding the Quality of Line Coverage of a Sensor Network - (Poster Paper). - Dinesh Dash; Arijit Bishnu; Arobinda Gupta; Subhas C. Nandy (ICDCN, 2012)

Space-efficient Algorithms for Visibility Problems in Simple Polygon - Minati De; Anil Maheshwari; Subhas C. Nandy (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 002; Sasanka Roy; Subhas C. Nandy (CoRR, 2012)

Convex Hull and Linear Programming in Read-only Setup with Limited Work-space - Minati De; Subhas C. Nandy; Sasanka Roy (CoRR, 2012)

Preface. - Subhas C. Nandy; Sandeep Sen (Theor. Comput. Sci., 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)

Localized geometric query problems. - John Augustine; Sandip Das 001; Anil Maheshwari; Subhas C. Nandy; Sasanka Roy; Swami Sarvattomananda (Comput. Geom., 2013)

An in-place min-max priority search tree. - Minati De; Anil Maheshwari; Subhas C. Nandy; Michiel H. M. Smid (Comput. Geom., 2013)

Diffuse reflection diameter and radius for convex-quadrilateralizable polygons. - Arindam Khan 001; Sudebkumar Prasant Pal; Mridul Aanjaneya; Arijit Bishnu; Subhas C. Nandy (Discret. Appl. Math., 2013)

New variations of the maximum coverage facility location problem. - Bhaswar B. Bhattacharya; Subhas C. Nandy (Eur. J. Oper. Res., 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)

Some variations on constrained minimum enclosing circle problem. - Arindam Karmakar; Sandip Das 001; Subhas C. Nandy; Binay K. Bhattacharya (J. Comb. Optim., 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)

Maximum Independent Set for Interval Graphs and Trees in Space Efficient Models. - Binay K. Bhattacharya; Minati De; Subhas C. Nandy; Sasanka Roy (CCCG, 2014)

Space-Efficient Algorithm for Computing a Centerpoint of a Point Set in R^2. - Binay K. Bhattacharya; Subhas C. Nandy; Sasanka Roy (CCCG, 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)

In-place algorithms for computing a largest clique in geometric intersection graphs. - Minati De; Subhas C. Nandy; Sasanka Roy (Discret. Appl. Math., 2014)

Efficient multiple-precision integer division algorithm. - Debapriyay Mukhopadhyay; Subhas C. Nandy (Inf. Process. Lett., 2014)

Line coverage measures in wireless sensor networks. - Dinesh Dash; Arobinda Gupta; Arijit Bishnu; Subhas C. Nandy (J. Parallel Distributed Comput., 2014)

On Density, Threshold and Emptiness Queries for Intervals in the Streaming Model. - Arijit Bishnu; Amit Chakrabarti; Subhas C. Nandy; Sandeep Sen (FSTTCS, 2015)

YAHMD - Yet another heap memory debugger. - Debapriyay Mukhopadhyay; Subhas C. Nandy (ReTIS, 2015)

Approximation algorithms for the two-center problem of convex polygon. - Sanjib Sadhu; Sasanka Roy; Soumen Nandi; Anil Maheshwari; Subhas C. Nandy (CoRR, 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 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)

Prune-and-search with limited workspace. - Minati De; Subhas C. Nandy; Sasanka Roy (J. Comput. Syst. Sci., 2015)

The Euclidean k-Supplier Problem in. - Manjanna Basappa; Ramesh K. Jallu; Gautam K. Das; Subhas C. Nandy (ALGOSENSORS, 2016)

Covering segments with axis-parallel unit squares. - Ankush Acharyya; Subhas C. Nandy; Supantha Pandit; Sasanka Roy (CoRR, 2016)

Color Spanning Annulus: Square, Rectangle and Equilateral Triangle. - Ankush Acharyya; Subhas C. Nandy; Sasanka Roy (CoRR, 2016)

The Runaway Rectangle Escape Problem. - Aniket Basu Roy; Anil Maheshwari; Sathish Govindarajan; Neeldhara Misra; Subhas C. Nandy; Shreyas Shetty (CoRR, 2016)

Space-efficient algorithm for computing a centerpoint of a set of points in R2. - Binay K. Bhattacharya; Subhas C. Nandy; Sasanka Roy (Theor. Comput. Sci., 2016)

Range Assignment of Base-Stations Maximizing Coverage Area without Interference. - Ankush Acharyya; Minati De; Subhas C. Nandy (CCCG, 2017)

Covering Points: Minimizing the Maximum Depth. - Subhas C. Nandy; Supantha Pandit; Sasanka Roy (CCCG, 2017)

Optimal Covering and Hitting of Line Segments by Two Axis-Parallel Squares. - Sanjib Sadhu; Sasanka Roy; Subhas C. Nandy; Suchismita Roy (COCOON, 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 (ICCSA (2), 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)

Rectilinear path problems in restricted memory setup. - Binay K. Bhattacharya; Minati De; Anil Maheshwari; Subhas C. Nandy; Sasanka Roy (Discret. Appl. Math., 2017)

Faster approximation for maximum independent set on unit disk graph. - Subhas C. Nandy; Supantha Pandit; Sasanka Roy (Inf. Process. Lett., 2017)

Geometric Graphs: Theory and Applications (NII Shonan Meeting 2017-16). - Naoki Katoh; Hee-Kap Ahn; Subhas C. Nandy (NII Shonan Meet. Rep., 2017)

Minimum Spanning Tree of Line Segments. - Sanjana Dey; Ramesh K. Jallu; Subhas C. Nandy (COCOON, 2018)

The Maximum Distance-d Independent Set Problem on Unit Disk Graphs. - Sangram Kishor Jena; Ramesh K. Jallu; Gautam K. Das; Subhas C. Nandy (FAW, 2018)

Guarding Polyhedral Terrain by k-Watchtowers. - Nitesh Tripathi; Manjish Pal; Minati De; Gautam K. Das; Subhas C. Nandy (FAW, 2018)

Geometric Path Problems with Violations. - Anil Maheshwari; Subhas C. Nandy; Drimit Pattanayak; Sasanka Roy; Michiel H. M. Smid (Algorithmica, 2018)

Minimum width color spanning annulus. - Ankush Acharyya; Subhas C. Nandy; Sasanka Roy (Theor. Comput. Sci., 2018)

Localized Query: Color Spanning Variations. - Ankush Acharyya; Anil Maheshwari; Subhas C. Nandy (CALDAM, 2019)

Sensor Networks for Structural Health Monitoring of Critical Infrastructures Using Identifying Codes. - Kaustav Basu; Sanjana Dey; Subhas C. Nandy; Arunabha Sen (DRCN, 2019)

Covering segments with unit squares. - Ankush Acharyya; Subhas C. Nandy; Supantha Pandit; Sasanka Roy (Comput. Geom., 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)

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)

Partial Enclosure Range Searching. - Gregory Bint; Anil Maheshwari; Michiel H. M. Smid; Subhas C. Nandy (Int. J. Comput. Geom. Appl., 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)

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)

Discriminating Codes in Geometric Setups. - Sanjana Dey; Florent Foucaud; Subhas C. Nandy; Arunabha Sen (ISAAC, 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)

Variations of largest rectangle recognition amidst a bichromatic point set. - Ankush Acharyya; Minati De; Subhas C. Nandy; Supantha Pandit (Discret. Appl. Math., 2020)

Color spanning objects: Algorithms and hardness results. - Sandip Banerjee; Neeldhara Misra; Subhas C. Nandy (Discret. Appl. Math., 2020)

Constant work-space algorithms for facility location problems. - Binay K. Bhattacharya; Minati De; Subhas C. Nandy; Sasanka Roy (Discret. Appl. Math., 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)

Range assignment of base-stations maximizing coverage area without interference. - Ankush Acharyya; Minati De; Subhas C. Nandy; Bodhayan Roy (Theor. Comput. Sci., 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)

An Acrophobic Guard Watchtower Problem on Terrains. - Ritesh Seth; Anil Maheshwari; Subhas C. Nandy (CCCG, 2021)

Minimum Consistent Subset Problem for Trees. - Sanjana Dey; Anil Maheshwari; Subhas C. Nandy (FCT, 2021)

On the minimum spanning tree problem in imprecise set-up. - Sanjana Dey; Ramesh K. Jallu; Subhas C. Nandy (CoRR, 2021)

Sparsity of weighted networks: Measures and applications. - Swati Goswami; Asit Kumar Das; Subhas C. Nandy (Inf. Sci., 2021)

The Euclidean k-supplier problem in IR2. - Manjanna Basappa; Ramesh K. Jallu; Gautam K. Das; Subhas C. Nandy (Oper. Res. Lett., 2021)

Color-spanning localized query. - Ankush Acharyya; Anil Maheshwari; Subhas C. Nandy (Theor. Comput. Sci., 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)

Exact Algorithms and Hardness Results for Geometric Red-Blue Hitting Set Problem. - Raghunath Reddy Madireddy; Subhas C. Nandy; Supantha Pandit (FAW, 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 (FSTTCS, 2022)

On the Construction of Planar Embedding for a Class of Orthogonal Polyhedra. - Nilanjana Karmakar; Arindam Biswas 002; Subhas C. Nandy; Bhargab B. Bhattacharya (IWCIA, 2022)

Guest Editors' Foreword. - Seok-Hee Hong 001; Subhas C. Nandy; Ryuhei Uehara (J. Graph Algorithms Appl., 2022)

Acrophobic guard watchtower problem. - Ritesh Seth; Anil Maheshwari; Subhas C. Nandy (Comput. Geom., 2023)

Complexity and Approximation for Discriminating and Identifying Code Problems in Geometric Setups. - Sanjana Dey; Florent Foucaud; Subhas C. Nandy; Arunabha Sen (Algorithmica, 2023)

Minimum consistent subset of simple graph classes. - Sanjana Dey; Anil Maheshwari; Subhas C. Nandy (Discret. Appl. Math., 2023)

Set Cover and Hitting Set Problems for Some Restricted Classes of Rectangles. - Minati De; Ratnadip Mandal; Subhas C. Nandy (CCCG, 2024)

Minimum Consistent Subset in Trees and Interval Graphs. - Aritra Banik; Sayani Das; Anil Maheshwari; Bubai Manna; Subhas C. Nandy; Krishna Priya K. M.; Bodhayan Roy; Sasanka Roy; Abhishek Sahu (FSTTCS, 2024)

Partial Domination in Some Geometric Intersection Graphs. - Madhura Dutta; Anil Maheshwari; Subhas C. Nandy (CALDAM, 2025)

On the geometric red-blue set cover problem. - Raghunath Reddy Madireddy; Subhas C. Nandy; Supantha Pandit (Theor. Comput. Sci., 2025)

Partial Domination in Some Geometric Intersection Graphs and Some Complexity Results. - Madhura Dutta; Anil Maheshwari; Subhas C. Nandy; Bodhayan Roy (CoRR, 2025)