The SCEAS System
| |||||||

## Search the dblp DataBase
B. S. Panda:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- B. S. Panda, Anita Das
**A Linear Time Algorithm for Constructing Tree 4-Spanner in 2-Trees.**[Citation Graph (0, 0)][DBLP] CIT, 2004, pp:21-30 [Conf] - Anita Das, B. S. Panda, Rajendra P. Lal
**A linear time algorithm for constructing tree 3-spanner in simple chordal bipartite graphs.**[Citation Graph (0, 0)][DBLP] ICIT, 2006, pp:301-304 [Conf] - 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, Sajal K. Das
**A Linear Time Algorithm for Finding Tree 3-Spanner on 2-Trees.**[Citation Graph (0, 0)][DBLP] IFIP TCS, 2002, pp:292-309 [Conf] - B. S. Panda, Vijay Natarajan, Sajal K. Das
**Parallel Algortithms for Hamiltonian 2-Separator Chordal Graphs.**[Citation Graph (0, 0)][DBLP] IPDPS, 2001, pp:35- [Conf] - B. S. Panda, Sajal K. Das
**Performance Evaluation of a Two Level Error Recovery Scheme for Distributed Systems.**[Citation Graph (0, 0)][DBLP] IWDC, 2002, pp:88-97 [Conf] - B. S. Panda, Mahesh Kumar, Sajal K. Das
**Optimal Schemes for Channel Assignment Problem in Wireless Networks Modeled as 2-Dimensional Square Grids.**[Citation Graph (0, 0)][DBLP] IWDC, 2004, pp:424-434 [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, Sajal K. Das
**A linear time recognition algorithm for proper interval graphs.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2003, v:87, n:3, pp:153-161 [Journal] - B. S. Panda, S. P. Mohanty
**Recognition Algorithm for Intersection Graphs of Edge Disjoint Paths in a Tree.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1994, v:49, n:3, pp:139-143 [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**[Citation Graph (0, 0)][DBLP]*k*-trees. J. Parallel Distrib. Comput., 2005, v:65, n:8, pp:922-926 [Journal] - B. S. Panda, Vijay Natarajan, Sajal K. Das
**Parallel Algorithms for Hamiltonian 2-Separator Chordal Graphs.**[Citation Graph (0, 0)][DBLP] Parallel Processing Letters, 2002, v:12, n:1, pp:51-64 [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] - B. S. Panda, S. P. Mohanty
**Intersection graphs of vertex disjoint paths in a tree.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1995, v:146, n:1-3, pp:179-209 [Journal] **NP-Completeness of Hamiltonian Cycle Problem on Rooted Directed Path Graphs**[Citation Graph (, )][DBLP]**Tree 3-spanners in 2-sep directed path graphs: Characterization, recognition, and construction.**[Citation Graph (, )][DBLP]
Search in 0.003secs, Finished in 0.004secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |