S. R. Mohan

799 total citations
28 papers, 501 citations indexed

About

S. R. Mohan is a scholar working on Computational Theory and Mathematics, Numerical Analysis and Electrical and Electronic Engineering. According to data from OpenAlex, S. R. Mohan has authored 28 papers receiving a total of 501 indexed citations (citations by other indexed papers that have themselves been cited), including 19 papers in Computational Theory and Mathematics, 13 papers in Numerical Analysis and 8 papers in Electrical and Electronic Engineering. Recurrent topics in S. R. Mohan's work include Matrix Theory and Algorithms (16 papers), Advanced Optimization Algorithms Research (13 papers) and graph theory and CDMA systems (8 papers). S. R. Mohan is often cited by papers focused on Matrix Theory and Algorithms (16 papers), Advanced Optimization Algorithms Research (13 papers) and graph theory and CDMA systems (8 papers). S. R. Mohan collaborates with scholars based in India, United States and Ireland. S. R. Mohan's co-authors include Sarmistha Neogy, R. Sridhar, T. Parthasarathy, Ashok Kumar Das, T. E. S. Raghavan, Michael Neumann and Suman Sinha and has published in prestigious journals such as SHILAP Revista de lepidopterología, Journal of Mathematical Analysis and Applications and Mathematical Programming.

In The Last Decade

S. R. Mohan

26 papers receiving 458 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
S. R. Mohan India 11 322 207 190 63 61 28 501
Hristo S. Sendov Canada 9 198 0.6× 142 0.7× 93 0.5× 63 1.0× 25 0.4× 34 375
Fabián Flores-Bazán Chile 17 704 2.2× 507 2.4× 137 0.7× 207 3.3× 30 0.5× 56 737
D. H. Martin South Africa 10 282 0.9× 220 1.1× 59 0.3× 53 0.8× 19 0.3× 18 366
Paul R. Beesack Canada 15 129 0.4× 103 0.5× 552 2.9× 157 2.5× 32 0.5× 47 766
Sorin‐Mihai Grad Germany 12 497 1.5× 360 1.7× 76 0.4× 97 1.5× 60 1.0× 39 544
Jean-Bernard Baillon France 13 529 1.6× 270 1.3× 184 1.0× 261 4.1× 21 0.3× 28 742
Adam B. Levy United States 12 423 1.3× 310 1.5× 86 0.5× 91 1.4× 25 0.4× 31 488
D. Azé France 11 418 1.3× 208 1.0× 136 0.7× 192 3.0× 31 0.5× 28 514
Jon D. Vanderwerff Canada 11 238 0.7× 110 0.5× 124 0.7× 103 1.6× 25 0.4× 36 395
Roman Sznajder United States 10 544 1.7× 440 2.1× 62 0.3× 43 0.7× 22 0.4× 27 611

Countries citing papers authored by S. R. Mohan

Since Specialization
Citations

This map shows the geographic impact of S. R. Mohan'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 S. R. Mohan with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites S. R. Mohan more than expected).

Fields of papers citing papers by S. R. Mohan

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by S. R. Mohan. 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 S. R. Mohan. The network helps show where S. R. Mohan may publish in the future.

Co-authorship network of co-authors of S. R. Mohan

This figure shows the co-authorship network connecting the top 25 collaborators of S. R. Mohan. A scholar is included among the top collaborators of S. R. Mohan 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 S. R. Mohan. S. R. Mohan is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Mohan, S. R., et al.. (2021). Solution of intuitionistic fuzzy linear programming problem by dual simplex algorithm and sensitivity analysis. Computational Intelligence. 37(2). 852–872. 3 indexed citations
2.
Mohan, S. R., et al.. (2020). A new approach for ranking of intuitionistic fuzzy numbers. SHILAP Revista de lepidopterología. 4 indexed citations
3.
Mohan, S. R., et al.. (2006). An Optimization Model to Determine Master Designs and Runs for Advertisement Printing. Journal of Mathematical Modelling and Algorithms. 6(2). 259–271. 10 indexed citations
4.
Mohan, S. R., et al.. (2005). Cone complementarity problems with finite solution sets. Operations Research Letters. 34(2). 121–126. 9 indexed citations
5.
Mohan, S. R., et al.. (2004). On Q and R0 properties of a quadratic representation in linear complementarity problems over the second-order cone. Linear Algebra and its Applications. 397. 85–97. 14 indexed citations
6.
Mohan, S. R., Sarmistha Neogy, & Ashok Kumar Das. (2004). A note on linear complementarity problems and multiple objective programming. Mathematical Programming. 100(2). 339–344.
7.
Mohan, S. R., Sarmistha Neogy, & Ashok Kumar Das. (2001). More on positive subdefinite matrices and the linear complementarity problem. Linear Algebra and its Applications. 338(1-3). 275–285. 12 indexed citations
8.
Mohan, S. R., Sarmistha Neogy, & T. Parthasarathy. (2001). PIVOTING ALGORITHMS FOR SOME CLASSES OF STOCHASTIC GAMES: A SURVEY. International Game Theory Review. 3(02n03). 253–281. 13 indexed citations
9.
Mohan, S. R., Sarmistha Neogy, & Ashok Kumar Das. (2001). On the classes of fully copositive and fully semimonotone matrices. Linear Algebra and its Applications. 323(1-3). 87–97. 11 indexed citations
10.
Mohan, S. R.. (1997). Degeneracy Subgraph of the Lemke Complementary Pivot Algorithm and Anticycling Rule. Journal of Optimization Theory and Applications. 94(2). 409–423. 2 indexed citations
11.
Mohan, S. R. & Sarmistha Neogy. (1996). The role of representative submatrices in vertical linear complementarity theory. Linear and Multilinear Algebra. 41(2). 175–187. 3 indexed citations
12.
Mohan, S. R. & Sarmistha Neogy. (1996). Generalized linear complementarity in a problem ofn-person games. OR Spectrum. 18(4). 231–239. 5 indexed citations
13.
Mohan, S. R. & Sarmistha Neogy. (1995). On Invex Sets and Preinvex Functions. Journal of Mathematical Analysis and Applications. 189(3). 901–908. 293 indexed citations
14.
Mohan, S. R., T. Parthasarathy, & R. Sridhar. (1994). The Linear Complementarity Problem with Exact Order Matrices. Mathematics of Operations Research. 19(3). 618–644. 8 indexed citations
15.
Mohan, S. R. & R. Sridhar. (1992). On characterizing N-matrices using linear complementarity. Linear Algebra and its Applications. 160. 231–245. 15 indexed citations
16.
Mohan, S. R., et al.. (1990). On Some Classes of Linear Complementarity Problems with Matrices of Order n and Rank (n − 1). Mathematics of Operations Research. 15(2). 243–257. 5 indexed citations
17.
Mohan, S. R. & T. E. S. Raghavan. (1987). An algorithm for discounted Switching Control Stochastic Games. OR Spectrum. 9(1). 41–45. 10 indexed citations
18.
Mohan, S. R., et al.. (1985). Nonnegativity of principal minors of generalized inverses of P0-matrices. Linear Algebra and its Applications. 65. 125–131. 4 indexed citations
19.
Mohan, S. R., et al.. (1984). Nonnegativity of principal minors of generalized inverses of M-matrices. Linear Algebra and its Applications. 58. 247–259. 8 indexed citations
20.
Mohan, S. R.. (1976). On the simplex method and a class of linear complementary problems. Linear Algebra and its Applications. 14(1). 1–9. 10 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

Rankless by CCL
2026