Pruning by Upperbounds in Heuristic Search: Use of Approximate Algorithms. - U. K. Sarkar; P. P. Chakrabarti 001; Sujoy Ghose; S. C. De Sarkar (KBCS, 1989)

Reducing Reexpansions in Iterative-Deepening Search by Controlling Cutoff Bounds. - U. K. Sarkar; P. P. Chakrabarti 001; Sujoy Ghose; S. C. De Sarkar (Artif. Intell., 1991)

Multiple Stack Branch and Bound. - U. K. Sarkar; P. P. Chakrabarti 001; Sujoy Ghose; S. C. De Sarkar (Inf. Process. Lett., 1991)

Effective Use of Memory in Iterative Deepening Search. - U. K. Sarkar; P. P. Chakrabarti 001; Sujoy Ghose; S. C. De Sarkar (Inf. Process. Lett., 1992)

A Simple 0.5-Bounded Greedy Algorithm for the 0/1 Knapsack Problem. - U. K. Sarkar; P. P. Chakrabarti 001; Sujoy Ghose; S. C. De Sarkar (Inf. Process. Lett., 1992)

Improving Greedy Algorithms by Lookahead-Search. - U. K. Sarkar; P. P. Chakrabarti 001; Sujoy Ghose; S. C. De Sarkar (J. Algorithms, 1994)

On the design of a constructive algorithm to solve the multi-peg towers of Hanoi problem. - U. K. Sarkar (Theor. Comput. Sci., 2000)

On uniqueness of solution to the multi-peg towers of hanoi. - U. K. Sarkar (Int. J. Comput. Math., 2001)