Prabhakar Ragde
Impact in
-
- Complexity and Algorithms in Graphs
- Advanced Graph Theory Research
-
- Computational Geometry and Mesh Generation
Papers in
-
- Advanced Graph Theory Research 15
- Complexity and Algorithms in Graphs 15
-
- Interconnection Networks and Systems 7
- Optimization and Search Problems 4
- Co-authors
- Avi Wigderson (7 shared papers)Faith E. Fich (8 shared papers)Naomi Nishimura (13 shared papers)Vince Grolmusz (2 shared papers)Stefan Szeider (2 shared papers)Dimitrios M. Thilikos (1 shared paper)Michael Luby (1 shared paper)Dimitrios M. Thilikos (4 shared papers)
- Journals
- Algorithmica (5 papers)Journal of Computer and System Sciences (4 papers)Journal of Algorithms (4 papers)Discrete Applied Mathematics (3 papers)Journal of Functional Programming (1 paper)
- Partner nations
- CanadaUnited StatesSpain
In The Last Decade
Prabhakar Ragde
35 papers receiving 568 citations
Peers
Comparison fields: 5 of 45
- Computational Theory and Mathematics 414
- Computer Graphics and Computer-Aided Design 58
- Discrete Mathematics and Combinatorics 43
- Hardware and Architecture 86
- Computer Networks and Communications 256
Countries citing papers authored by Prabhakar Ragde
This map shows the geographic impact of Prabhakar Ragde'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 Prabhakar Ragde with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Prabhakar Ragde more than expected).
Fields of papers citing papers by Prabhakar Ragde
This network shows the impact of papers produced by Prabhakar Ragde. 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 Prabhakar Ragde. The network helps show where Prabhakar Ragde may publish in the future.
Co-authors
The 25 scholars most cited alongside Prabhakar Ragde, 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 37 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 1988 | 86 | |
| 2 | 2002 | 44 | |
| 3 | Detecting Backdoor Sets with Respect to Horn and Binary Clauses. | 2004 | 37 |
| 4 | 1985 | 34 | |
| 5 | 1984 | 31 | |
| 6 | 1996 | 30 | |
| 7 | 1993 | 29 | |
| 8 | 1989 | 28 | |
| 9 | 1988 | 27 | |
| 10 | 2007 | 25 | |
| 11 | 2004 | 25 | |
| 12 | 1987 | 24 | |
| 13 | 1998 | 21 | |
| 14 | 2006 | 20 | |
| 15 | 2007 | 20 | |
| 16 | 2005 | 20 | |
| 17 | 1996 | 16 | |
| 18 | 1988 | 13 | |
| 19 | 2007 | 11 | |
| 20 | 1991 | 11 |
About Prabhakar Ragde
Prabhakar Ragde is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications, Artificial Intelligence, Hardware and Architecture and Computer Vision and Pattern Recognition, having authored 37 papers that have together received 624 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (15 papers), Complexity and Algorithms in Graphs (15 papers), Algorithms and Data Compression (9 papers), Parallel Computing and Optimization Techniques (9 papers), Interconnection Networks and Systems (7 papers), Optimization and Search Problems (4 papers), Machine Learning and Algorithms (4 papers) and Computational Geometry and Mesh Generation (4 papers). The work is most often cited by research in Computational Theory and Mathematics (414 citations), Computer Graphics and Computer-Aided Design (58 citations), Discrete Mathematics and Combinatorics (43 citations), Hardware and Architecture (86 citations) and Computer Networks and Communications (256 citations). Prabhakar Ragde has collaborated with scholars based in Canada, United States and Spain. Frequent co-authors include Avi Wigderson, Faith E. Fich, Naomi Nishimura, Vince Grolmusz, Stefan Szeider, Dimitrios M. Thilikos, Michael Luby, Dimitrios M. Thilikos, Friedhelm Meyer auf der Heide and Jonathan F. Buss. Their work appears in journals such as Algorithmica, Journal of Computer and System Sciences, Journal of Algorithms, Discrete Applied Mathematics and Journal of Functional Programming.
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.