Subhas C. Nandy

983 total citations
79 papers, 411 citations indexed

About

Subhas C. Nandy is a scholar working on Computer Graphics and Computer-Aided Design, Computer Vision and Pattern Recognition and Computer Networks and Communications. According to data from OpenAlex, Subhas C. Nandy has authored 79 papers receiving a total of 411 indexed citations (citations by other indexed papers that have themselves been cited), including 51 papers in Computer Graphics and Computer-Aided Design, 26 papers in Computer Vision and Pattern Recognition and 20 papers in Computer Networks and Communications. Recurrent topics in Subhas C. Nandy's work include Computational Geometry and Mesh Generation (51 papers), Digital Image Processing Techniques (18 papers) and Data Management and Algorithms (18 papers). Subhas C. Nandy is often cited by papers focused on Computational Geometry and Mesh Generation (51 papers), Digital Image Processing Techniques (18 papers) and Data Management and Algorithms (18 papers). Subhas C. Nandy collaborates with scholars based in India, Canada and United States. Subhas C. Nandy's co-authors include Bhargab B. Bhattacharya, Sandip Das, Gautam K. Das, Sasanka Roy, Bhaswar B. Bhattacharya, Arijit Bishnu, T. Krishnan, Bhabani P. Sinha, Susmita Sur‐Kolay and Gautam Das and has published in prestigious journals such as European Journal of Operational Research, Pattern Recognition and Computers & Mathematics with Applications.

In The Last Decade

Subhas C. Nandy

71 papers receiving 390 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Subhas C. Nandy India	11	183	101	100	96	85	79	411
Preparata United States	6	141 0.8×	131 1.3×	95 0.9×	59 0.6×	95 1.1×	7	399
Prosenjit Gupta India	9	113 0.6×	25 0.2×	76 0.8×	73 0.8×	10 0.1×	43	302
John D. Hobby United States	11	72 0.4×	207 2.0×	121 1.2×	24 0.3×	244 2.9×	32	515
Binwu Zhang China	11	53 0.3×	93 0.9×	54 0.5×	7 0.1×	19 0.2×	21	345
Bertrand Neveu France	10	40 0.2×	86 0.9×	44 0.4×	30 0.3×	13 0.2×	31	423
Pushkar Tripathi India	9	33 0.2×	104 1.0×	67 0.7×	11 0.1×	82 1.0×	27	322
Delfin Y. Montuno Canada	11	105 0.6×	507 5.0×	70 0.7×	44 0.5×	300 3.5×	55	692
Carlos Hernández Chile	11	42 0.2×	134 1.3×	329 3.3×	57 0.6×	4 0.0×	51	439
Hanbing Yan China	12	62 0.3×	204 2.0×	64 0.6×	166 1.7×	9 0.1×	36	416
Neng Hou China	9	9 0.0×	58 0.6×	131 1.3×	21 0.2×	36 0.4×	13	375

Countries citing papers authored by Subhas C. Nandy

Since Specialization

Citations

This map shows the geographic impact of Subhas C. Nandy's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Subhas C. Nandy with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Subhas C. Nandy more than expected).

Fields of papers citing papers by Subhas C. Nandy

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Subhas C. Nandy. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Subhas C. Nandy. The network helps show where Subhas C. Nandy may publish in the future.

Co-authorship network of co-authors of Subhas C. Nandy

This figure shows the co-authorship network connecting the top 25 collaborators of Subhas C. Nandy. A scholar is included among the top collaborators of Subhas C. Nandy based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Subhas C. Nandy. Subhas C. Nandy is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Maheshwari, Anil, et al.. (2023). Minimum consistent subset of simple graph classes. Discrete Applied Mathematics. 338. 255–277.

Misra, Neeldhara, et al.. (2018). Color spanning objects: Algorithms and hardness results. Discrete Applied Mathematics. 280. 14–22.

Nandy, Subhas C., et al.. (2017). Minimum width color spanning annulus. Theoretical Computer Science. 725. 16–30. 1 indexed citations

Bhattacharya, Binay, et al.. (2014). Maximum Independent Set for Interval Graphs and Trees in Space Efficient Models.. Canadian Conference on Computational Geometry.

Nandy, Subhas C., et al.. (2014). In-place algorithms for computing a largest clique in geometric intersection graphs. Discrete Applied Mathematics. 178. 58–70. 2 indexed citations

Nandy, Subhas C., et al.. (2014). Prune-and-search with limited workspace. Journal of Computer and System Sciences. 81(2). 398–414. 2 indexed citations

Maheshwari, Anil, et al.. (2012). An in-place min–max priority search tree. Computational Geometry. 46(3). 310–327. 1 indexed citations

Das, Gautam K., et al.. (2011). Approximation Algorithms for the Discrete Piercing Set Problem for Unit Disks. Canadian Conference on Computational Geometry. 5 indexed citations

Nandy, Subhas C., et al.. (2011). Space-efficient Algorithms for Empty Space Recognition among a Point Set in 2D and 3D.. Canadian Conference on Computational Geometry. 4 indexed citations

10.

Maheshwari, Anil, et al.. (2011). An In-Place Priority Search Tree. Canadian Conference on Computational Geometry. 1 indexed citations

11.

Das, Gautam K., et al.. (2010). Computing the Straight Skeleton of a Monotone Polygon in O(nlogn) Time. Canadian Conference on Computational Geometry. 207–210. 11 indexed citations

12.

Bishnu, Arijit, et al.. (2010). Cluster connecting problem inside a polygon.. Canadian Conference on Computational Geometry. 265–268. 1 indexed citations

13.

Bhattacharya, Bhaswar B. & Subhas C. Nandy. (2010). New Variations of the Reverse Facility Location Problem. Canadian Conference on Computational Geometry. 241–244. 3 indexed citations

14.

Maheshwari, Anil, et al.. (2010). On the number of shortest descending paths on the surface of a convex terrain. Journal of Discrete Algorithms. 9(2). 182–189. 2 indexed citations

15.

Roy, Sasanka, et al.. (2009). Constrained minimum enclosing circle with center on a query line segment. Computational Geometry. 42(6-7). 632–638. 6 indexed citations

16.

Das, Gautam, et al.. (2009). Homogeneous 2-hop broadcast in 2D. Computational Geometry. 43(2). 182–190. 5 indexed citations

17.

Roy, Sasanka, et al.. (2005). A Fast Algorithm for Point Labeling Problem.. Canadian Conference on Computational Geometry. 155–158. 6 indexed citations

18.

Nandy, Subhas C. & Bhargab B. Bhattacharya. (2003). On finding an empty staircase polygon of largest area (width) in a planar point-set. Computational Geometry. 26(2). 143–171. 10 indexed citations

19.

Asano, Tetsuo, et al.. (2002). Translating a convex polyhedron over monotone polyhedra. Computational Geometry. 23(3). 257–269. 4 indexed citations

20.

Nandy, Subhas C., Krishnendu Mukhopadhyaya, & Bhargab B. Bhattacharya. (1996). Shooter Location Problem. Canadian Conference on Computational Geometry. 93–98. 1 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact