Computing the Shortest Path Tree in a Weak Visibility Polygon. - Subir Kumar Ghosh; Anil Maheshwari; Sudebkumar Prasant Pal; Sanjeev Saluja; C. E. Veni Madhavan (FSTTCS, 1991)

A Note on the Permanent Value Problem. - Sanjeev Saluja (Inf. Process. Lett., 1992)

On the Power of Enumerative Counting. - Sanjeev Saluja; K. V. Subrahmanyam 001 (Inf. Process. Lett., 1992)

Relativized limitations of left set technique and closure classes of sparse sets (Extended Abstract). - Sanjeev Saluja (SCT, 1993)

Characterizing and Recognizing Weak Visibility Polygons. - Subir Kumar Ghosh; Anil Maheshwari; Sudebkumar Prasant Pal; Sanjeev Saluja; C. E. Veni Madhavan (Comput. Geom., 1993)

NC-Algorithms for Minimum Link Path and Related Problems. - Vijay Chandru; Subir Kumar Ghosh; Anil Maheshwari; V. T. Rajan; Sanjeev Saluja (J. Algorithms, 1995)

Descriptive Complexity of #P Functions. - Sanjeev Saluja; K. V. Subrahmanyam 001; Madhukar N. Thakur (J. Comput. Syst. Sci., 1995)

Discovering All Most Specific Sentences by Randomized Algorithms. - Dimitrios Gunopulos; Heikki Mannila; Sanjeev Saluja (ICDT, 1997)

Optimal On-line Algorithms for Walking with Minimum Number of Turns in Unknown Streets. - Subir Kumar Ghosh; Sanjeev Saluja (Comput. Geom., 1997)

Improved Merging of Datapath Operators using Information Content and Required Precision Analysis. - Anmol Mathur; Sanjeev Saluja (DAC, 2001)

Graph Transformations for Improved Tree Height Reduction. - G. N. Mangalam; Sanjiv Narayan; Paul van Besouw; LaNae J. Avra; Anmol Mathur; Sanjeev Saluja (VLSI Design, 2003)

Discovering all most specific sentences. - Dimitrios Gunopulos; Roni Khardon; Heikki Mannila; Sanjeev Saluja; Hannu Toivonen; Ram Sewak Sharm (ACM Trans. Database Syst., 2003)