Some algorithms for interval interpolating polynomial. - K. L. Majumder; G. P. Bhattacharjee (Computing, 1976)

On the computation of Hermite interval interpolating polynomials. - G. P. Bhattacharjee; K. L. Majumder (Computing, 1977)

Parallel Generation of Permutations. - Phalguni Gupta; G. P. Bhattacharjee (Comput. J., 1983)

An Efficient Algorithm for Random Sampling without Replacement. - P. Gupta; G. P. Bhattacharjee (FSTTCS, 1984)

A Parallel Search Algorithm for Directed Acyclic Graphs. - Ratan K. Ghosh; G. P. Bhattacharjee (BIT, 1984)

A Parallel Selection Algorithm. - P. Gupta; G. P. Bhattacharjee (BIT, 1984)

A Distributed Algorithm for Edge-Disjoint Path Problem. - Hrushikesha Mohanty; G. P. Bhattacharjee (FSTTCS, 1986)

A Parallel Derangement Generation Algorithm. - P. Gupta; G. P. Bhattacharjee (BIT, 1989)

Optimal sequential and parallel algorithms for computing the diameter and the center of an interval graph. - Madhumangal Pal; G. P. Bhattacharjee (Int. J. Comput. Math., 1995)

The Parallel Algorithms for Determining Edge-packing and Efficient Edge Dominating Sets in Interval Graphs. - Madhumangal Pal; G. P. Bhattacharjee (Parallel Algorithms Appl., 1995)

A sequential algorithm for finding a maximum weight K-independent set on interval graphs. - Madhumangal Pal; G. P. Bhattacharjee (Int. J. Comput. Math., 1996)

An Optimal Parallel Algorithm to Color an Interval Graph. - Madhumangal Pal; G. P. Bhattacharjee (Parallel Process. Lett., 1996)

A Data Structure on Interval Graphs and Its Applications. - Madhumangal Pal; G. P. Bhattacharjee (J. Circuits Syst. Comput., 1997)

An Optimal Parallel Algorithm for All-Pairs Shortest Paths on Unweighted Interval Graphs. - Madhumangal Pal; G. P. Bhattacharjee (Nord. J. Comput., 1997)

Event scheduling using allen's algebra. - Ashis K. Pani; G. P. Bhattacharjee; R. N. Mohapatra 001 (Int. J. Comput. Math., 1998)

Uncertantty in temporal representation and reasoning. - Ashis K. Pani; G. P. Bhattacharjee (Int. J. Comput. Math., 1999)