R. Sritharan
Impact in
-
- Limits and Structures in Graph Theory
-
- Advanced Graph Theory Research
- Complexity and Algorithms in Graphs
- Graph Labeling and Dimension Problems
Papers in
-
- Advanced Graph Theory Research 36
- Graph Labeling and Dimension Problems 17
- Complexity and Algorithms in Graphs 17
-
- Limits and Structures in Graph Theory 10
- Co-authors
- Jeremy Spinrad (7 shared papers)Kathie Cameron (4 shared papers)Chı́nh T. Hoàng (9 shared papers)Ryan Hayward (3 shared papers)Andreas Brandstädt (2 shared papers)Van Bang Lê (1 shared paper)Celina M.H. de Figueiredo (1 shared paper)Sulamita Klein (1 shared paper)
- Journals
- Discrete Applied Mathematics (8 papers)Discrete Mathematics (6 papers)Theoretical Computer Science (3 papers)SIAM Journal on Discrete Mathematics (3 papers)Graphs and Combinatorics (2 papers)
- Partner nations
- United StatesCanadaNorway
In The Last Decade
R. Sritharan
33 papers receiving 419 citations
Peers
Comparison fields: 5 of 23
- Discrete Mathematics and Combinatorics 88
- Computational Theory and Mathematics 409
- Computer Networks and Communications 172
- Geometry and Topology 49
- Computer Graphics and Computer-Aided Design 15
Countries citing papers authored by R. Sritharan
This map shows the geographic impact of R. Sritharan'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 R. Sritharan with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites R. Sritharan more than expected).
Fields of papers citing papers by R. Sritharan
This network shows the impact of papers produced by R. Sritharan. 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 R. Sritharan. The network helps show where R. Sritharan may publish in the future.
Co-authors
The 24 scholars most cited alongside R. Sritharan, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 38 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2003 | 63 | |
| 2 | 1995 | 53 | |
| 3 | 2008 | 35 | |
| 4 | 2000 | 33 | |
| 5 | 2007 | 25 | |
| 6 | 2007 | 25 | |
| 7 | 2004 | 24 | |
| 8 | 2007 | 21 | |
| 9 | 2007 | 17 | |
| 10 | 2007 | 14 | |
| 11 | 2010 | 13 | |
| 12 | 2006 | 12 | |
| 13 | 2001 | 11 | |
| 14 | 2008 | 11 | |
| 15 | 1996 | 10 | |
| 16 | 2010 | 9 | |
| 17 | 2002 | 9 | |
| 18 | 2012 | 9 | |
| 19 | 2003 | 7 | |
| 20 | 1995 | 7 |
About R. Sritharan
R. Sritharan is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Computer Networks and Communications, Electrical and Electronic Engineering and Geometry and Topology, having authored 38 papers that have together received 440 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (36 papers), Graph Labeling and Dimension Problems (17 papers), Complexity and Algorithms in Graphs (17 papers), Limits and Structures in Graph Theory (10 papers), graph theory and CDMA systems (9 papers), Interconnection Networks and Systems (8 papers), Graph theory and applications (3 papers) and Optimization and Search Problems (2 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (88 citations), Computational Theory and Mathematics (409 citations), Computer Networks and Communications (172 citations), Geometry and Topology (49 citations) and Computer Graphics and Computer-Aided Design (15 citations). R. Sritharan has collaborated with scholars based in United States, Canada and Norway. Frequent co-authors include Jeremy Spinrad, Kathie Cameron, Chı́nh T. Hoàng, Ryan Hayward, Andreas Brandstädt, Van Bang Lê, Celina M.H. de Figueiredo, Sulamita Klein, Luérbio Faria and Vašek Chvátal. Their work appears in journals such as Discrete Applied Mathematics, Discrete Mathematics, Theoretical Computer Science, SIAM Journal on Discrete Mathematics and Graphs and Combinatorics.
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.