Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Bhawani Sankar Panda
B. S. Panda
2010 – today
- 2013
[j21]B. S. Panda, S. Paul: Liar's domination in graphs: Complexity and algorithm. Discrete Applied Mathematics 161(7-8): 1085-1092 (2013)- [j20]B. S. Panda, D. Pradhan: A linear time algorithm for computing a minimum paired-dominating set of a convex bipartite graph. Discrete Applied Mathematics 161(12): 1776-1783 (2013)
- [c14]Bhawani Sankar Panda, D. Pushparaj Shetty: A Local Search Based Approximation Algorithm for Strong Minimum Energy Topology Problem in Wireless Sensor Networks. ICDCIT 2013: 398-409
- 2012
- [j19]B. S. Panda, D. Pradhan: Acyclic Matchings in Subclasses of bipartite Graphs. Discrete Math., Alg. and Appl. 4(4) (2012)
- [j18]Bighnaraj Panigrahi, Swades De, Bhawani Sankar Panda, Jean-Daniel Lan Sun Luk: Network lifetime maximising distributed forwarding strategies in ad hoc wireless sensor networks. IET Communications 6(14): 2138-2148 (2012)
- [j17]B. S. Panda, Preeti Goel: L(2,1)-labeling of dually chordal graphs and strongly orderable graphs. Inf. Process. Lett. 112(13): 552-556 (2012)
- [j16]Gerard J. Chang, B. S. Panda, D. Pradhan: Complexity of distance paired-domination problem in graphs. Theor. Comput. Sci. 459: 89-99 (2012)
- [c13]Bhawani Sankar Panda, D. Pushparaj Shetty, Bijaya Kishor Bhatta: Strong Minimum Energy Minimum Interference Topology in Wireless Sensor Networks. ICDCIT 2012: 177-187
- 2011
- [j15]B. S. Panda, Preeti Goel: L(2, 1)-labeling of perfect elimination bipartite graphs. Discrete Applied Mathematics 159(16): 1878-1888 (2011)
- [c12]B. S. Panda, D. Pushparaj Shetty: Strong Minimum Interference Topology for Wireless Sensor Networks. ADCONS 2011: 366-374
- [c11]B. S. Panda, D. Pushparaj Shetty: An Incremental Power Greedy Heuristic for Strong Minimum Energy Topology in Wireless Sensor Networks. ICDCIT 2011: 187-196
- 2010
- [j14]B. S. Panda, Anita Das: Tree 3-spanners in 2-sep chordal graphs: Characterization and algorithms. Discrete Applied Mathematics 158(17): 1913-1935 (2010)
- [j13]B. S. Panda, D. Pradhan: Locally connected spanning trees in cographs, complements of bipartite graphs and doubly chordal graphs. Inf. Process. Lett. 110(23): 1067-1073 (2010)
- [c10]B. S. Panda, Preeti Goel: Heuristic Algorithms for the L(2, 1)-Labeling Problem. SEMCCO 2010: 214-221
- [c9]Bighnaraj Panigrahi, Swades De, Bhawani Sankar Panda, Jean-Daniel Lan Sun Luk: Energy-Efficient Greedy Forwarding Protocol for Wireless Sensor Networks. VTC Spring 2010: 1-5
2000 – 2009
- 2009
- [j12]B. S. Panda, Anita Das: Tree 3-spanners in 2-sep directed path graphs: Characterization, recognition, and construction. Discrete Applied Mathematics 157(9): 2153-2169 (2009)
- [j11]B. S. Panda, Sajal K. Das: A parallel algorithm for generating bicompatible elimination orderings of proper interval graphs. Inf. Process. Lett. 109(18): 1041-1046 (2009)
- 2008
- [i1]B. S. Panda, D. Pradhan: NP-Completeness of Hamiltonian Cycle Problem on Rooted Directed Path Graphs. CoRR abs/0809.2443 (2008)
- 2007
- [j10]
- 2006
- [j9]Bhawani Sankar Panda, Anita Das: Tree 3-Spanner in 2-sep Chordal Graphs: Characterization, Recognition, and Construction. Electronic Notes in Discrete Mathematics 27: 79-80 (2006)
- [c8]Anita 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
- [j8]B. 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
- [c7]
- [c6]B. 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
- [j7]B. S. Panda, Sajal K. Das: A linear time recognition algorithm for proper interval graphs. Inf. Process. Lett. 87(3): 153-161 (2003)
- 2002
- [j6]B. S. Panda, Vijay Natarajan, Sajal K. Das: Parallel Algorithms for Hamiltonian 2-Separator Chordal Graphs. Parallel Processing Letters 12(1): 51-64 (2002)
- [c5]B. S. Panda, Sajal K. Das: An Efficient Parallel Algorithm for Computing Bicompatible Elimination Ordering (BCO) of Proper Interval Graphs. HiPC 2002: 334-346
- [c4]B. S. Panda, Sajal K. Das: A Linear Time Algorithm for Finding Tree 3-Spanner on 2-Trees. IFIP TCS 2002: 292-309
- [c3]B. S. Panda, Sajal K. Das: Performance Evaluation of a Two Level Error Recovery Scheme for Distributed Systems. IWDC 2002: 88-97
- 2001
- [j5]B. S. Panda: The Separator Theorem for Rooted Directed Vertex Graphs. J. Comb. Theory, Ser. B 81(1): 156-162 (2001)
- [c2]B. 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
- [c1]B. S. Panda, Vijay Natarajan, Sajal K. Das: Parallel Algortithms for Hamiltonian 2-Separator Chordal Graphs. IPDPS 2001: 35
1990 – 1999
- 1999
- [j4]B. S. Panda: The forbidden subgraph characterization of directed vertex graphs. Discrete Mathematics 196(1-3): 239-256 (1999)
- 1996
- [j3]B. S. Panda: New Linear Time Algorithms for Generating Perfect Elimination Orderings of Chordal Graphs. Inf. Process. Lett. 58(3): 111-115 (1996)
- 1995
- [j2]B. S. Panda, S. P. Mohanty: Intersection graphs of vertex disjoint paths in a tree. Discrete Mathematics 146(1-3): 179-209 (1995)
- 1994
- [j1]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
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-05-24 22:22 CEST by the dblp team