Sandeep Sen

1.8k total citations
65 papers, 715 citations indexed

About

Sandeep Sen is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Artificial Intelligence. According to data from OpenAlex, Sandeep Sen has authored 65 papers receiving a total of 715 indexed citations (citations by other indexed papers that have themselves been cited), including 31 papers in Computational Theory and Mathematics, 21 papers in Computer Networks and Communications and 20 papers in Artificial Intelligence. Recurrent topics in Sandeep Sen's work include Complexity and Algorithms in Graphs (25 papers), Computational Geometry and Mesh Generation (19 papers) and Optimization and Search Problems (13 papers). Sandeep Sen is often cited by papers focused on Complexity and Algorithms in Graphs (25 papers), Computational Geometry and Mesh Generation (19 papers) and Optimization and Search Problems (13 papers). Sandeep Sen collaborates with scholars based in India, United States and Germany. Sandeep Sen's co-authors include Surender Baswana, Amit Kumar, John H. Reif, Yogish Sabharwal, Siddhartha Chatterjee, Isaac D. Scherson, Ramesh Hariharan, Sanguthevar Rajasekaran, Manoj Gupta and Adi Shamir and has published in prestigious journals such as Journal of Clinical Oncology, SHILAP Revista de lepidopterología and Journal of the ACM.

In The Last Decade

Sandeep Sen

63 papers receiving 657 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Sandeep Sen India 17 332 320 227 181 107 65 715
Y. Bartal Israel 13 354 1.1× 654 2.0× 179 0.8× 93 0.5× 55 0.5× 24 938
Satish Rao United States 14 607 1.8× 466 1.5× 122 0.5× 199 1.1× 80 0.7× 30 956
Jeffery Westbrook United States 17 356 1.1× 479 1.5× 223 1.0× 98 0.5× 61 0.6× 34 766
Yogish Sabharwal India 16 122 0.4× 336 1.1× 234 1.0× 37 0.2× 102 1.0× 61 727
Christos Levcopoulos Sweden 16 235 0.7× 150 0.5× 129 0.6× 341 1.9× 123 1.1× 63 678
Neil Sarnak United States 6 175 0.5× 395 1.2× 379 1.7× 376 2.1× 332 3.1× 6 961
Liam Roditty Israel 19 533 1.6× 471 1.5× 199 0.9× 146 0.8× 127 1.2× 68 942
Elias Dahlhaus Germany 13 618 1.9× 287 0.9× 157 0.7× 85 0.5× 42 0.4× 45 937
Michael D. Grigoriadis United States 12 410 1.2× 295 0.9× 144 0.6× 83 0.5× 33 0.3× 27 831
Riko Jacob Denmark 12 95 0.3× 254 0.8× 141 0.6× 92 0.5× 127 1.2× 38 607

Countries citing papers authored by Sandeep Sen

Since Specialization
Citations

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

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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-authorship network of co-authors of Sandeep Sen

This figure shows the co-authorship network connecting the top 25 collaborators of Sandeep Sen. A scholar is included among the top collaborators of Sandeep Sen 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 Sandeep Sen. Sandeep Sen is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Patel, Rushin, et al.. (2022). POEMS syndrome - a diagnostic dilemma with challenging presentation. Journal of Community Hospital Internal Medicine Perspectives. 12(6). 69–72. 1 indexed citations
2.
Sabharwal, Yogish, et al.. (2015). The Update Complexity of Selection and Related Problems. Theory of Computing Systems. 59(1). 112–132. 5 indexed citations
3.
Sen, Sandeep, et al.. (2014). An MPL W515L mutation in refractory anemia with ringed sideroblasts associated with marked thrombocytosis: A case report. Oncology Letters. 9(2). 749–751. 2 indexed citations
4.
Sabharwal, Yogish, et al.. (2011). The update complexity of selection and related problems. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 13. 325–338. 3 indexed citations
5.
Pillai, Unnikrishnan, Jameel Muzaffar, Sandeep Sen, & Abigail M. Yancey. (2009). Grapefruit Juice and Verapamil: A Toxic Cocktail. Southern Medical Journal. 102(3). 308–309. 15 indexed citations
6.
Sarukkai, Sundar & Sandeep Sen. (2005). Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science. 7 indexed citations
8.
Baswana, Surender & Sandeep Sen. (2004). Approximate distance oracles for unweighted graphs in Õ (n2) time. Symposium on Discrete Algorithms. 271–280. 12 indexed citations
9.
Baswana, Surender, Ramesh Hariharan, & Sandeep Sen. (2003). Maintaining all-pairs approximate shortest paths under deletion of edges. Symposium on Discrete Algorithms. 394–403. 17 indexed citations
10.
Kamra, Abhinav, Huzur Saran, Sandeep Sen, & Rajeev Shorey. (2003). Fair adaptive bandwidth allocation: a rate control based active queue management discipline. Computer Networks. 44(2). 135–152. 15 indexed citations
11.
Gupta, Neelima & Sandeep Sen. (2003). Faster output-sensitive parallel algorithms for 3D convex hulls and vector maxima. Journal of Parallel and Distributed Computing. 63(4). 488–500. 8 indexed citations
12.
Baswana, Surender, Ramesh Hariharan, & Sandeep Sen. (2002). Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths. 117–123. 12 indexed citations
13.
Sen, Sandeep & Siddhartha Chatterjee. (2000). Towards a theory of cache-efficient algorithms. Symposium on Discrete Algorithms. 829–838. 20 indexed citations
14.
Sen, Sandeep & Neelima Gupta. (1999). Distribution-sensitive algorithms. Nordic journal of computing. 6(2). 194–211. 5 indexed citations
15.
Gupta, Neelima & Sandeep Sen. (1997). Optimal, output-sensitive algorithms for constructing planar hulls in parallel. Computational Geometry. 8(3). 151–166. 4 indexed citations
16.
Reif, John H. & Sandeep Sen. (1994). Randomized Algorithms for Binary Search and Load Balancing on Fixed Connection Networks with Geometric Applications. SIAM Journal on Computing. 23(3). 633–651. 18 indexed citations
17.
Reif, John H. & Sandeep Sen. (1987). Optimal Randomized Parallel Algorithms for Computational Geometry.. Proceedings of the International Conference on Parallel Processing. 270–277. 15 indexed citations
18.
Rajasekaran, Sanguthevar & Sandeep Sen. (1987). On Parallel Integer Sorting. 1 indexed citations
19.
Sen, Sandeep, Isaac D. Scherson, & Adi Shamir. (1986). Shear Sort: A True Two-Dimensional Sorting Techniques for VLSI Networks.. Proceedings of the International Conference on Parallel Processing. 903–908. 35 indexed citations
20.
Sen, Sandeep, et al.. (1961). EQUIVALENT PRESSURE CONCEPT IN CROSSED ELECTRIC AND MAGNETIC FIELD IN ELECTRODELESS DISCHARGE. IACS Institutional Repository (Indian Association for the Cultivation of Science). 2 indexed citations

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.

Explore authors with similar magnitude of impact

Rankless by CCL
2026