Sanjeev Saluja

405 total citations
11 papers, 171 citations indexed

About

Sanjeev Saluja is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Computer Graphics and Computer-Aided Design. According to data from OpenAlex, Sanjeev Saluja has authored 11 papers receiving a total of 171 indexed citations (citations by other indexed papers that have themselves been cited), including 5 papers in Artificial Intelligence, 5 papers in Computational Theory and Mathematics and 3 papers in Computer Graphics and Computer-Aided Design. Recurrent topics in Sanjeev Saluja's work include Computational Geometry and Mesh Generation (3 papers), Advanced Graph Theory Research (3 papers) and Complexity and Algorithms in Graphs (3 papers). Sanjeev Saluja is often cited by papers focused on Computational Geometry and Mesh Generation (3 papers), Advanced Graph Theory Research (3 papers) and Complexity and Algorithms in Graphs (3 papers). Sanjeev Saluja collaborates with scholars based in India, United States and Germany. Sanjeev Saluja's co-authors include Dimitrios Gunopulos, Heikki Mannila, Roni Khardon, Hannu Toivonen, K. V. Subrahmanyam, Subir Kumar Ghosh, Anmol Mathur, Anil Maheshwari, C. E. Veni Madhavan and V. Chandru and has published in prestigious journals such as Journal of Computer and System Sciences, ACM Transactions on Database Systems and Journal of Algorithms.

In The Last Decade

Sanjeev Saluja

10 papers receiving 162 citations

Peers

Sanjeev Saluja

IS

CTM

AI

SP

CNC

Richard Schroeppel United States

Daniel K. Blandford United States

Jesse Kamp United States

Edward Gan United States

Thijs Laarhoven Netherlands

Stefan Schamberger Germany

Sebastian Krinninger Austria

Loukas Georgiadis Greece

Daniel M. Sunday United States

Ching‐Chi Lin Taiwan

Richard Schroeppel United States

Sanjeev Saluja

73 ×0.9

IS

68 ×0.9

CTM

149 ×2.3

AI

14 ×0.2

SP

78 ×1.4

CNC

Citations per year, relative to Sanjeev Saluja Sanjeev Saluja (= 1×) peers Richard Schroeppel

Countries citing papers authored by Sanjeev Saluja

Since Specialization

Citations

This map shows the geographic impact of Sanjeev Saluja'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 Sanjeev Saluja with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Sanjeev Saluja more than expected).

Fields of papers citing papers by Sanjeev Saluja

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Sanjeev Saluja. 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 Sanjeev Saluja. The network helps show where Sanjeev Saluja may publish in the future.

Co-authorship network of co-authors of Sanjeev Saluja

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

All Works

Sort: Min cites: Since: Top N: Style:

11 of 11 papers shown

1.

Gunopulos, Dimitrios, et al.. (2003). Discovering all most specific sentences. ACM Transactions on Database Systems. 28(2). 140–174. 98 indexed citations

2.

Saluja, Sanjeev, et al.. (2003). Descriptive complexity of Hash P functions. 38. 169–184.

3.

Narayan, Sanjiv M., et al.. (2003). Graph transformations for improved tree height reduction. 474–479. 1 indexed citations

4.

Saluja, Sanjeev. (2002). Relativized limitations of left set technique and closure classes of sparse sets. 215–222. 2 indexed citations

5.

Mathur, Anmol & Sanjeev Saluja. (2001). Improved merging of datapath operators using information content and required precision analysis. 462–467. 10 indexed citations

6.

Gunopulos, Dimitrios, Heikki Mannila, & Sanjeev Saluja. (1997). Discovering all most specific sentences by randomized algorithms. Max Planck Digital Library. 215–229. 8 indexed citations

7.

Ghosh, Subir Kumar & Sanjeev Saluja. (1997). Optimal on-line algorithms for walking with minimum number of turns in unknown streets. Computational Geometry. 8(5). 241–266. 8 indexed citations

8.

Saluja, Sanjeev, et al.. (1995). Descriptive Complexity of #P Functions. Journal of Computer and System Sciences. 50(3). 493–505. 24 indexed citations

9.

Chandru, V., S. K. Ghosh, Anil Maheshwari, V. T. Rajan, & Sanjeev Saluja. (1995). -Algorithms for Minimum Link Path and Related Problems. Journal of Algorithms. 19(2). 173–203. 6 indexed citations

10.

Ghosh, Subir Kumar, et al.. (1993). Characterizing and recognizing weak visibility polygons. Computational Geometry. 3(4). 213–233. 10 indexed citations

11.

Saluja, Sanjeev. (1992). A note on the permanent value problem. Information Processing Letters. 43(1). 1–5. 4 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