 | 1997 |
| 10 |  | Madhumangal Pal,
G. P. Bhattacharjee:
An Optimal Parallel Algorithm for All-Pairs Shortest Paths on Unweighted Interval Graphs.
Nord. J. Comput. 4(4): 342-356 (1997) |
| 1996 |
| 9 |  | Madhumangal Pal,
G. P. Bhattacharjee:
An Optimal Parallel Algorithm to Color an Interval Graph.
Parallel Processing Letters 6(4): 439-449 (1996) |
| 1995 |
| 8 |  | Madhumangal Pal,
G. P. Bhattacharjee:
The Parallel Algorithms for Determining Edge-packing and Efficient Edge Dominating Sets in Interval Graphs.
Parallel Algorithms Appl. 7(3-4): 193-207 (1995) |
| 1989 |
| 7 |  | P. Gupta,
G. P. Bhattacharjee:
A Parallel Derangement Generation Algorithm.
BIT 29(1): 14-22 (1989) |
| 1986 |
| 6 |  | Hrushikesha Mohanty,
G. P. Bhattacharjee:
A Distributed Algorithm for Edge-Disjoint Path Problem.
FSTTCS 1986: 344-361 |
| 1984 |
| 5 |  | P. Gupta,
G. P. Bhattacharjee:
An Efficient Algorithm for Random Sampling without Replacement.
FSTTCS 1984: 435-465 |
| 4 |  | Ratan K. Ghosh,
G. P. Bhattacharjee:
A Parallel Search Algorithm for Directed Acyclic Graphs.
BIT 24(2): 134-150 (1984) |
| 3 |  | P. Gupta,
G. P. Bhattacharjee:
A Parallel Selection Algorithm.
BIT 24(3): 274-287 (1984) |
| 1983 |
| 2 |  | Phalguni Gupta,
G. P. Bhattacharjee:
Parallel Generation of Permutations.
Comput. J. 26(2): 97-105 (1983) |
| 1976 |
| 1 |  | K. L. Majumder,
G. P. Bhattacharjee:
Some algorithms for interval interpolating polynomial.
Computing 16(4): 305-317 (1976) |