Surender Baswana
Impact in
-
- Complexity and Algorithms in Graphs
- Advanced Graph Theory Research
-
- Computational Geometry and Mesh Generation
Papers in
-
- Complexity and Algorithms in Graphs 28
- Advanced Graph Theory Research 15
-
- Optimization and Search Problems 13
- Co-authors
- Sandeep Sen (13 shared papers)Telikepalli Kavitha (2 shared papers)Ramesh Hariharan (4 shared papers)Manoj Gupta (2 shared papers)Seth Pettie (2 shared papers)Kurt Mehlhorn (2 shared papers)Yashodhan Kanoria (2 shared papers)Benjamin Doerr (1 shared paper)
- Journals
- Algorithmica (6 papers)SIAM Journal on Computing (5 papers)ACM Transactions on Algorithms (4 papers)Random Structures and Algorithms (1 paper)Journal of Algorithms (1 paper)
- Partner nations
- IndiaGermanyUnited States
In The Last Decade
Surender Baswana
35 papers receiving 467 citations
Peers
Comparison fields: 5 of 42
- Computational Theory and Mathematics 388
- Computer Graphics and Computer-Aided Design 80
- Computer Networks and Communications 252
- Artificial Intelligence 155
- Signal Processing 48
Countries citing papers authored by Surender Baswana
This map shows the geographic impact of Surender Baswana'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 Surender Baswana with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Surender Baswana more than expected).
Fields of papers citing papers by Surender Baswana
This network shows the impact of papers produced by Surender Baswana. 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 Surender Baswana. The network helps show where Surender Baswana may publish in the future.
Co-authors
The 18 scholars most cited alongside Surender Baswana, 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 | 2006 | 47 | |
| 2 | 2010 | 43 | |
| 3 | 2006 | 40 | |
| 4 | 2006 | 39 | |
| 5 | 2012 | 32 | |
| 6 | 2007 | 31 | |
| 7 | 2009 | 30 | |
| 8 | 2011 | 26 | |
| 9 | 2004 | 23 | |
| 10 | 2003 | 17 | |
| 11 | 2015 | 17 | |
| 12 | 2010 | 16 | |
| 13 | 2019 | 14 | |
| 14 | 2012 | 13 | |
| 15 | 2004 | 12 | |
| 16 | 2002 | 12 | |
| 17 | 2019 | 12 | |
| 18 | 2008 | 10 | |
| 19 | 2018 | 9 | |
| 20 | 2010 | 8 |
About Surender Baswana
Surender Baswana is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications, Artificial Intelligence, Computer Graphics and Computer-Aided Design and Electrical and Electronic Engineering, having authored 37 papers that have together received 504 indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (28 papers), Advanced Graph Theory Research (15 papers), Optimization and Search Problems (13 papers), Algorithms and Data Compression (6 papers), Computational Geometry and Mesh Generation (5 papers), Software Testing and Debugging Techniques (3 papers), VLSI and FPGA Design Techniques (3 papers) and Cryptography and Data Security (3 papers). The work is most often cited by research in Computational Theory and Mathematics (388 citations), Computer Graphics and Computer-Aided Design (80 citations), Computer Networks and Communications (252 citations), Artificial Intelligence (155 citations) and Signal Processing (48 citations). Surender Baswana has collaborated with scholars based in India, Germany and United States. Frequent co-authors include Sandeep Sen, Telikepalli Kavitha, Ramesh Hariharan, Manoj Gupta, Telikepalli Kavitha, Seth Pettie, Kurt Mehlhorn, Yashodhan Kanoria, Benjamin Doerr and Frank Neumann. Their work appears in journals such as Algorithmica, SIAM Journal on Computing, ACM Transactions on Algorithms, Random Structures and Algorithms and Journal of Algorithms.
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.