dblp.uni-trier.dewww.uni-trier.de

B. S. Panda

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2008
18EEB. S. Panda, D. Pradhan: NP-Completeness of Hamiltonian Cycle Problem on Rooted Directed Path Graphs CoRR abs/0809.2443: (2008)
2007
17EEB. S. Panda, Anita Das: On tree 3-spanners in directed path graphs. Networks 50(3): 203-210 (2007)
2006
16EEAnita Das, B. S. Panda, Rajendra P. Lal: A linear time algorithm for constructing tree 3-spanner in simple chordal bipartite graphs. ICIT 2006: 301-304
2005
15EEB. S. Panda, Sajal K. Das: Parallel recognition algorithms for chordal_planar graphs and planar k-trees. J. Parallel Distrib. Comput. 65(8): 922-926 (2005)
2004
14EEB. S. Panda, Anita Das: A Linear Time Algorithm for Constructing Tree 4-Spanner in 2-Trees. CIT 2004: 21-30
13EEB. S. Panda, Mahesh Kumar, Sajal K. Das: Optimal Schemes for Channel Assignment Problem in Wireless Networks Modeled as 2-Dimensional Square Grids. IWDC 2004: 424-434
2003
12EEB. S. Panda, Sajal K. Das: A linear time recognition algorithm for proper interval graphs. Inf. Process. Lett. 87(3): 153-161 (2003)
2002
11EEB. S. Panda, Sajal K. Das: An Efficient Parallel Algorithm for Computing Bicompatible Elimination Ordering (BCO) of Proper Interval Graphs. HiPC 2002: 334-346
10 B. S. Panda, Sajal K. Das: A Linear Time Algorithm for Finding Tree 3-Spanner on 2-Trees. IFIP TCS 2002: 292-309
9EEB. S. Panda, Sajal K. Das: Performance Evaluation of a Two Level Error Recovery Scheme for Distributed Systems. IWDC 2002: 88-97
8EEB. S. Panda, Vijay Natarajan, Sajal K. Das: Parallel Algorithms for Hamiltonian 2-Separator Chordal Graphs. Parallel Processing Letters 12(1): 51-64 (2002)
2001
7EEB. S. Panda, Sajal K. Das: An Efficient Algorithm for Computing Lower Bounds on Time and Processors for Scheduling Precedence Graphs on Multicomputer Systems. HiPC 2001: 47-57
6 B. S. Panda, Vijay Natarajan, Sajal K. Das: Parallel Algortithms for Hamiltonian 2-Separator Chordal Graphs. IPDPS 2001: 35
5EEB. S. Panda: The Separator Theorem for Rooted Directed Vertex Graphs. J. Comb. Theory, Ser. B 81(1): 156-162 (2001)
1999
4EEB. S. Panda: The forbidden subgraph characterization of directed vertex graphs. Discrete Mathematics 196(1-3): 239-256 (1999)
1996
3EEB. S. Panda: New Linear Time Algorithms for Generating Perfect Elimination Orderings of Chordal Graphs. Inf. Process. Lett. 58(3): 111-115 (1996)
1995
2EEB. S. Panda, S. P. Mohanty: Intersection graphs of vertex disjoint paths in a tree. Discrete Mathematics 146(1-3): 179-209 (1995)
1994
1 B. S. Panda, S. P. Mohanty: Recognition Algorithm for Intersection Graphs of Edge Disjoint Paths in a Tree. Inf. Process. Lett. 49(3): 139-143 (1994)

Coauthor Index

1Anita Das [14] [16] [17]
2Sajal K. Das [6] [7] [8] [9] [10] [11] [12] [13] [15]
3Mahesh Kumar [13]
4Rajendra P. Lal [16]
5S. P. Mohanty [1] [2]
6Vijay Natarajan [6] [8]
7D. Pradhan [18]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)