Sandeep Sen
Impact in
-
- Computational Geometry and Mesh Generation
-
- Complexity and Algorithms in Graphs
- Advanced Graph Theory Research
Papers in
-
- Complexity and Algorithms in Graphs 25
- Advanced Graph Theory Research 11
-
- Optimization and Search Problems 13
- Co-authors
- Surender Baswana (13 shared papers)John H. Reif (4 shared papers)Amit Kumar (5 shared papers)Yogish Sabharwal (7 shared papers)Siddhartha Chatterjee (2 shared papers)Isaac D. Scherson (3 shared papers)Ramesh Hariharan (4 shared papers)Sanguthevar Rajasekaran (3 shared papers)
- Journals
- SIAM Journal on Computing (4 papers)Algorithmica (3 papers)Journal of Algorithms (3 papers)Computational Geometry (2 papers)Theoretical Computer Science (2 papers)
- Partner nations
- IndiaUnited StatesGermany
In The Last Decade
Sandeep Sen
63 papers receiving 657 citations
Peers
Comparison fields: 5 of 81
- Computer Graphics and Computer-Aided Design 181
- Computational Theory and Mathematics 332
- Hardware and Architecture 98
- Computer Networks and Communications 320
- Signal Processing 107
Countries citing papers authored by Sandeep Sen
This map shows the geographic impact of Sandeep Sen'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 Sandeep Sen with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Sandeep Sen more than expected).
Fields of papers citing papers by Sandeep Sen
This network shows the impact of papers produced by Sandeep Sen. 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 Sandeep Sen. The network helps show where Sandeep Sen may publish in the future.
Co-authors
The 25 scholars most cited alongside Sandeep Sen, 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 65 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2010 | 52 | |
| 2 | 2006 | 47 | |
| 3 | 2002 | 43 | |
| 4 | 2006 | 40 | |
| 5 | Shear Sort: A True Two-Dimensional Sorting Techniques for VLSI Networks. | 1986 | 35 |
| 6 | 2011 | 26 | |
| 7 | 1986 | 26 | |
| 8 | 2004 | 23 | |
| 9 | 2013 | 22 | |
| 10 | 2000 | 20 | |
| 11 | 1992 | 20 | |
| 12 | 1992 | 19 | |
| 13 | 1992 | 19 | |
| 14 | 1994 | 18 | |
| 15 | 2003 | 17 | |
| 16 | 2015 | 17 | |
| 17 | 1997 | 16 | |
| 18 | Optimal Randomized Parallel Algorithms for Computational Geometry. | 1987 | 15 |
| 19 | 2009 | 15 | |
| 20 | 2003 | 15 |
About Sandeep Sen
Sandeep Sen is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications, Artificial Intelligence, Computer Graphics and Computer-Aided Design and Signal Processing, having authored 65 papers that have together received 715 indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (25 papers), Computational Geometry and Mesh Generation (19 papers), Optimization and Search Problems (13 papers), Algorithms and Data Compression (12 papers), Advanced Graph Theory Research (11 papers), Data Management and Algorithms (10 papers), DNA and Biological Computing (4 papers) and Machine Learning and Algorithms (4 papers). The work is most often cited by research in Computer Graphics and Computer-Aided Design (181 citations), Computational Theory and Mathematics (332 citations), Hardware and Architecture (98 citations), Computer Networks and Communications (320 citations) and Signal Processing (107 citations). Sandeep Sen has collaborated with scholars based in India, United States and Germany. Frequent co-authors include Surender Baswana, John H. Reif, Amit Kumar, Yogish Sabharwal, Siddhartha Chatterjee, Isaac D. Scherson, Ramesh Hariharan, Sanguthevar Rajasekaran, Manoj Gupta and Adi Shamir. Their work appears in journals such as SIAM Journal on Computing, Algorithmica, Journal of Algorithms, Computational Geometry 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.