Rajiv Raman
- Computational Theory and Mathematics top 5%
- Computer Networks and Communications
- Computer Graphics and Computer-Aided Design top 5%
- Discrete Mathematics and Combinatorics top 10%
- Management Science and Operations Research
- Co-authors
- Sriram V. PemmarajuKasturi VaradarajanSaurabh RayKonrad K. DabrowskiBernard RiesVadim LozinNabil H. MustafaRahul Patil
- Topics
- Advanced Graph Theory Research (18 papers)Complexity and Algorithms in Graphs (16 papers)Optimization and Search Problems (8 papers)
- Cited by
- Computer Graphics and Computer-Aided DesignDiscrete Mathematics and CombinatoricsComputational Theory and Mathematics
- Partner nations
- United StatesIndiaGermany
In The Last Decade
Rajiv Raman
22 papers receiving 152 citations
Peers
Comparison fields: 5 of 32
- Computational Theory and Mathematics 105
- Computer Networks and Communications 48
- Computer Graphics and Computer-Aided Design 31
- Discrete Mathematics and Combinatorics 28
- Management Science and Operations Research 27
Countries citing papers authored by Rajiv Raman
This map shows the geographic impact of Rajiv Raman'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 Rajiv Raman with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Rajiv Raman more than expected).
Fields of papers citing papers by Rajiv Raman
This network shows the impact of papers produced by Rajiv Raman. 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 Rajiv Raman. The network helps show where Rajiv Raman may publish in the future.
Co-authorship network of co-authors of Rajiv Raman
This figure shows the co-authorship network connecting the top 25 collaborators of Rajiv Raman. A scholar is included among the top collaborators of Rajiv Raman 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 Rajiv Raman. Rajiv Raman is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 1 | |
| 2 | 1 | |
| 3 | 3 | |
| 4 | 5 | |
| 5 | 1 | |
| 6 | 2 | |
| 7 | 17 | |
| 8 | 14 | |
| 9 | 1 | |
| 10 | 26 | |
| 11 | 0 | |
| 12 | 7 | |
| 13 | On the Approximability of the Maximum Interval Coloring Problem | 0 |
| 14 | 7 | |
| 15 | Cardinality Constrained Graph Partitioning into Cliques with Submodular Costs | 4 |
| 16 | 5 | |
| 17 | 10 | |
| 18 | 6 | |
| 19 | 11 | |
| 20 | 31 |
About Rajiv Raman
Rajiv Raman is a scholar working on Computer Graphics and Computer-Aided Design, Computational Theory and Mathematics and Industrial and Manufacturing Engineering, having authored 25 papers that have together received 160 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (18 papers), Complexity and Algorithms in Graphs (16 papers) and Optimization and Search Problems (8 papers). The work is most often cited by research in Computer Graphics and Computer-Aided Design (31 citations), Discrete Mathematics and Combinatorics (28 citations) and Computational Theory and Mathematics (105 citations). Rajiv Raman has collaborated with scholars based in United States, India and Germany. Frequent co-authors include Sriram V. Pemmaraju, Kasturi Varadarajan, Saurabh Ray, Konrad K. Dabrowski, Bernard Ries, Vadim Lozin, Nabil H. Mustafa, Rahul Patil, Sachin Lodha and Kevin Chang. Their work appears in journals such as SIAM Journal on Computing, Computers & Industrial Engineering and Theoretical Computer Science.
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.