B. S. Panda, Sajal K. Das An Efficient Algorithm for Computing Lower Bounds on Time and Processors for Scheduling Precedence Graphs on Multicomputer Systems. [Citation Graph (0, 0)][DBLP] HiPC, 2001, pp:47-57 [Conf]
B. S. Panda, Sajal K. Das An Efficient Parallel Algorithm for Computing Bicompatible Elimination Ordering (BCO) of Proper Interval Graphs. [Citation Graph (0, 0)][DBLP] HiPC, 2002, pp:334-346 [Conf]
B. S. Panda New Linear Time Algorithms for Generating Perfect Elimination Orderings of Chordal Graphs. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1996, v:58, n:3, pp:111-115 [Journal]
B. S. Panda The Separator Theorem for Rooted Directed Vertex Graphs. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 2001, v:81, n:1, pp:156-162 [Journal]
B. S. Panda, Sajal K. Das Parallel recognition algorithms for chordal_planar graphs and planar k-trees. [Citation Graph (0, 0)][DBLP] J. Parallel Distrib. Comput., 2005, v:65, n:8, pp:922-926 [Journal]
B. S. Panda The forbidden subgraph characterization of directed vertex graphs. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1999, v:196, n:1-3, pp:239-256 [Journal]