Recognition Algorithm for Intersection Graphs of Edge Disjoint Paths in a Tree. - B. S. Panda 001; Shreedhara Prasada Mohanty (Inf. Process. Lett., 1994)

Intersection graphs of vertex disjoint paths in a tree. - B. S. Panda 001; Shreedhara Prasada Mohanty (Discret. Math., 1995)

New Linear Time Algorithms for Generating Perfect Elimination Orderings of Chordal Graphs. - B. S. Panda 001 (Inf. Process. Lett., 1996)

The forbidden subgraph characterization of directed vertex graphs. - B. S. Panda 001 (Discret. Math., 1999)

An Efficient Algorithm for Computing Lower Bounds on Time and Processors for Scheduling Precedence Graphs on Multicomputer Systems. - B. S. Panda 001; Sajal K. Das 001 (HiPC, 2001)

Parallel Algortithms for Hamiltonian 2-Separator Chordal Graphs. - B. S. Panda 001; Vijay Natarajan; Sajal K. Das 001 (IPDPS, 2001)

The Separator Theorem for Rooted Directed Vertex Graphs. - B. S. Panda 001 (J. Comb. Theory B, 2001)

An Efficient Parallel Algorithm for Computing Bicompatible Elimination Ordering (BCO) of Proper Interval Graphs. - B. S. Panda 001; Sajal K. Das 001 (HiPC, 2002)

A Linear Time Algorithm for Finding Tree 3-Spanner on 2-Trees. - B. S. Panda 001; Sajal K. Das 001 (IFIP TCS, 2002)

Performance Evaluation of a Two Level Error Recovery Scheme for Distributed Systems. - B. S. Panda 001; Sajal K. Das 001 (IWDC, 2002)

Parallel Algorithms for Hamiltonian 2-Separator Chordal Graphs. - B. S. Panda 001; Vijay Natarajan; Sajal K. Das 001 (Parallel Process. Lett., 2002)

A linear time recognition algorithm for proper interval graphs. - B. S. Panda 001; Sajal K. Das 001 (Inf. Process. Lett., 2003)

A Linear Time Algorithm for Constructing Tree 4-Spanner in 2-Trees. - B. S. Panda 001; Anita Das 001 (CIT, 2004)

Optimal Schemes for Channel Assignment Problem in Wireless Networks Modeled as 2-Dimensional Square Grids. - B. S. Panda 001; Mahesh Kumar; Sajal K. Das 001 (IWDC, 2004)

Parallel recognition algorithms for chordal_planar graphs and planar k-trees. - B. S. Panda 001; Sajal K. Das 001 (J. Parallel Distributed Comput., 2005)

A linear time algorithm for constructing tree 3-spanner in simple chordal bipartite graphs. - Anita Das 001; B. S. Panda 001; Rajendra P. Lal (ICIT, 2006)

Tree 3-Spanner in 2-sep Chordal Graphs: Characterization, Recognition, and Construction. - Bhawani Sankar Panda; Anita Das 001 (Electron. Notes Discret. Math., 2006)

On tree 3-spanners in directed path graphs. - B. S. Panda 001; Anita Das 001 (Networks, 2007)

NP-Completeness of Hamiltonian Cycle Problem on Rooted Directed Path Graphs - B. S. Panda 001; Dinabandhu Pradhan (CoRR, 2008)

Tree 3-spanners in 2-sep directed path graphs: Characterization, recognition, and construction. - B. S. Panda 001; Anita Das 001 (Discret. Appl. Math., 2009)

A parallel algorithm for generating bicompatible elimination orderings of proper interval graphs. - B. S. Panda 001; Sajal K. Das 001 (Inf. Process. Lett., 2009)

Heuristic Algorithms for the L(2, 1)-Labeling Problem. - B. S. Panda 001; Preeti Goel (SEMCCO, 2010)

Energy-Efficient Greedy Forwarding Protocol for Wireless Sensor Networks. - Bighnaraj Panigrahi; Swades De; Bhawani Sankar Panda; Jean-Daniel Lan Sun Luk (VTC Spring, 2010)

Tree 3-spanners in 2-sep chordal graphs: Characterization and algorithms. - B. S. Panda 001; Anita Das 001 (Discret. Appl. Math., 2010)

Locally connected spanning trees in cographs, complements of bipartite graphs and doubly chordal graphs. - B. S. Panda 001; Dinabandhu Pradhan (Inf. Process. Lett., 2010)

Strong Minimum Interference Topology for Wireless Sensor Networks. - B. S. Panda 001; D. Pushparaj Shetty (ADCONS, 2011)

An Incremental Power Greedy Heuristic for Strong Minimum Energy Topology in Wireless Sensor Networks. - B. S. Panda 001; D. Pushparaj Shetty (ICDCIT, 2011)

L(2, 1)-labeling of perfect elimination bipartite graphs. - B. S. Panda 001; Preeti Goel (Discret. Appl. Math., 2011)

Strong Minimum Energy Minimum Interference Topology in Wireless Sensor Networks. - Bhawani Sankar Panda; D. Pushparaj Shetty; Bijaya Kishor Bhatta (ICDCIT, 2012)

Acyclic Matchings in Subclasses of bipartite Graphs. - B. S. Panda 001; Dinabandhu Pradhan (Discret. Math. Algorithms Appl., 2012)

Network lifetime maximising distributed forwarding strategies in ad hoc wireless sensor networks. - Bighnaraj Panigrahi; Swades De; Bhawani Sankar Panda; Jean-Daniel Lan Sun Luk (IET Commun., 2012)

L(2,1)-labeling of dually chordal graphs and strongly orderable graphs. - B. S. Panda 001; Preeti Goel (Inf. Process. Lett., 2012)

Complexity of distance paired-domination problem in graphs. - Gerard J. Chang; B. S. Panda 001; Dinabandhu Pradhan (Theor. Comput. Sci., 2012)

A Local Search Based Approximation Algorithm for Strong Minimum Energy Topology Problem in Wireless Sensor Networks. - Bhawani Sankar Panda; D. Pushparaj Shetty (ICDCIT, 2013)

Liar's domination in graphs: Complexity and algorithm. - B. S. Panda 001; Subhabrata Paul (Discret. Appl. Math., 2013)

A linear time algorithm for computing a minimum paired-dominating set of a convex bipartite graph. - B. S. Panda 001; Dinabandhu Pradhan (Discret. Appl. Math., 2013)

Connected Liar's domination in graphs: Complexity and Algorithms. - B. S. Panda 001; Subhabrata Paul (Discret. Math. Algorithms Appl., 2013)

Minimum interference strong bidirectional topology for wireless sensor networks. - B. S. Panda 001; D. Pushparaj Shetty (Int. J. Ad Hoc Ubiquitous Comput., 2013)

A linear time algorithm for liar's domination problem in proper interval graphs. - B. S. Panda 001; Subhabrata Paul (Inf. Process. Lett., 2013)

Minimum paired-dominating set in chordal bipartite graphs and perfect elimination bipartite graphs. - B. S. Panda 001; Dinabandhu Pradhan (J. Comb. Optim., 2013)

Minimum Range Assignment Problem for Two Connectivity in Wireless Sensor Networks. - Bhawani Sankar Panda; D. Pushparaj Shetty (ICDCIT, 2014)

Hardness results and approximation algorithm for total liar's domination in graphs. - B. S. Panda 001; Subhabrata Paul (J. Comb. Optim., 2014)

Algorithm and Hardness Results for Outer-connected Dominating Set in Graphs. - Bhawani Sankar Panda; Arti Pandey (J. Graph Algorithms Appl., 2014)

Separator Theorems for Interval Graphs and Proper Interval Graphs. - Bhawani Sankar Panda (CALDAM, 2015)

Algorithmic Aspects of Disjunctive Domination in Graphs. - B. S. Panda 001; Arti Pandey; Subhabrata Paul (COCOON, 2015)

k-Distinct Strong Minimum Energy Topology Problem in Wireless Sensor Networks. - Bhawani Sankar Panda; D. Pushparaj Shetty; Arti Pandey (ICDCIT, 2015)

Boruvka-Incremental Power Greedy Heuristic for Strong Minimum Energy Topology in Wireless Sensor Networks. - B. S. Panda 001; Bijaya K. Bhatta; Deepak Mishra 001; Swades De (ICDCN, 2015)

L(2, 1)-labeling of Block Graphs. - Bhawani Sankar Panda; Preeti Goel (Ars Comb., 2015)

Algorithmic aspects of disjunctive domination in graphs. - Bhawani Sankar Panda; Arti Pandey (CoRR, 2015)

A linear time algorithm to compute a minimum restrained dominating set in proper interval graphs. - Bhawani Sankar Panda; Dinabandhu Pradhan (Discret. Math. Algorithms Appl., 2015)

On the dominator coloring in proper interval graphs and block graphs. - B. S. Panda 001; Arti Pandey (Discret. Math. Algorithms Appl., 2015)

Strong minimum energy 2-hop rooted topology for hierarchical wireless sensor networks. - B. S. Panda 001; D. Pushparaj Shetty (J. Comb. Optim., 2015)

Hardness results, approximation and exact algorithms for liar's domination problem in graphs. - Bhawani Sankar Panda; Subhabrata Paul; Dinabandhu Pradhan (Theor. Comput. Sci., 2015)

b-Disjunctive Total Domination in Graphs: Algorithm and Hardness Results. - Arti Pandey; B. S. Panda 001 (CALDAM, 2016)

On the Complexity of Minimum Cardinality Maximal Uniquely Restricted Matching in Graphs. - B. S. Panda 001; Arti Pandey (ICTCSDM, 2016)

Partial Grundy Coloring in Some Subclasses of Bipartite Graphs and Chordal Graphs. - B. S. Panda 001; Shaily Verma (ICTCSDM, 2016)

Some Algorithmic Results on Restrained Domination in Graphs. - Arti Pandey; Bhawani Sankar Panda (CoRR, 2016)

Complexity of total outer-connected domination problem in graphs. - B. S. Panda 001; Arti Pandey (Discret. Appl. Math., 2016)

Strong minimum energy hierarchical topology in wireless sensor networks. - B. S. Panda 001; D. Pushparaj Shetty (J. Comb. Optim., 2016)

New heuristics for strong minimum energy topology with reduced time complexity. - B. S. Panda 001; Bijaya K. Bhatta; Deepak Mishra 001; Swades De (ANTS, 2017)

Induced Matching in Some Subclasses of Bipartite Graphs. - Arti Pandey; B. S. Panda 001; Piyush Dane; Manav Kashyap (CALDAM, 2017)

Improved Energy-Efficient Target Coverage in Wireless Sensor Networks. - Bhawani Sankar Panda; Bijaya K. Bhatta; Sambit Kumar Mishra (ICCSA (6), 2017)

Algorithmic aspects of open neighborhood location-domination in graphs. - B. S. Panda 001; Arti Pandey (Discret. Appl. Math., 2017)

Restrained Domination in Some Subclasses of Chordal Graphs. - Arti Pandey; B. S. Panda 001 (Electron. Notes Discret. Math., 2017)

Characterization and Recognition of Tree 3-Spanner Admissible Directed Path Graphs of Diameter Three. - B. S. Panda 001; Anita Das 001 (WG, 2018)

Algorithmic aspects of b-disjunctive domination in graphs. - B. S. Panda 001; Arti Pandey; Subhabrata Paul (J. Comb. Optim., 2018)

On partial Grundy coloring of bipartite graphs and chordal graphs. - B. S. Panda 001; Shaily Verma (Discret. Appl. Math., 2019)

Domination in some subclasses of bipartite graphs. - Arti Pandey; B. S. Panda 001 (Discret. Appl. Math., 2019)

Computing a minimum paired-dominating set in strongly orderable graphs. - Dinabandhu Pradhan; B. S. Panda 001 (Discret. Appl. Math., 2019)

Identifying Influential Spreaders On a Weighted Network Using HookeRank Method. - Sanjay Kumar 001; Nipun Aggarwal; B. S. Panda 001 (ICCS (1), 2020)

On the total and AVD-total coloring of graphs. - B. S. Panda 001; Shaily Verma; Yash Keerti (AKCE Int. J. Graphs Comb., 2020)

Grundy coloring in some subclasses of bipartite graphs and their complements. - Shaily Verma; B. S. Panda 001 (Inf. Process. Lett., 2020)

Maximum weight induced matching in some subclasses of bipartite graphs. - B. S. Panda 001; Arti Pandey; Juhi Chaudhary; Piyush Dane; Manav Kashyap (J. Comb. Optim., 2020)

Hardness and Approximation Results of Roman {3}-Domination in Graphs. - Pooja Goyal; B. S. Panda 001 (COCOON, 2021)

IM-ELPR: Influence maximization in social networks using label propagation based community structure. - Sanjay Kumar 001; Lakshay Singhla; Kshitij Jindal; Khyati Grover; B. S. Panda 001 (Appl. Intell., 2021)

Preface: CALDAM 2018. - Bhawani Sankar Panda; Subir Kumar Ghosh (Discret. Appl. Math., 2021)

Injective coloring of some subclasses of bipartite graphs and chordal graphs. - B. S. Panda 001; Priyamvada (Discret. Appl. Math., 2021)

Community detection in complex networks using network embedding and gravitational search algorithm. - Sanjay Kumar 001; B. S. Panda 001; Deepanshu Aggarwal (J. Intell. Inf. Syst., 2021)

Modeling information diffusion in online social networks using a modified forest-fire model. - Sanjay Kumar 001; Muskan Saini; Muskan Goel; B. S. Panda 001 (J. Intell. Inf. Syst., 2021)

On the complexity of minimum maximal uniquely restricted matching. - Juhi Chaudhary; Bhawani Sankar Panda (Theor. Comput. Sci., 2021)

Dominating induced matching in some subclasses of bipartite graphs. - B. S. Panda 001; Juhi Chaudhary (Theor. Comput. Sci., 2021)

Global total k-domination: Approximation and hardness results. - B. S. Panda 001; Pooja Goyal (Theor. Comput. Sci., 2021)

Differentiating-total domination: Approximation and hardness results. - B. S. Panda 001; Pooja Goyal; Dinabandhu Pradhan (Theor. Comput. Sci., 2021)

On Two Variants of Induced Matchings. - Juhi Chaudhary; B. S. Panda 001 (ICS, 2022)

MDER: modified degree with exclusion ratio algorithm for influence maximisation in social networks. - Sanjay Kumar 001; Dipti Lohia; Darsh Pratap; Ashutosh Krishna; B. S. Panda 001 (Computing, 2022)

Hardness results of global total k-domination problem in graphs. - B. S. Panda 001; Pooja Goyal (Discret. Appl. Math., 2022)

Adjacent vertex distinguishing total coloring in split graphs. - Shaily Verma; Hung-Lin Fu; B. S. Panda 001 (Discret. Math., 2022)

Influence maximization in social networks using graph embedding and graph neural network. - Sanjay Kumar 001; Abhishek Mallik; Anavi Khetarpal; Bhawani Sankar Panda (Inf. Sci., 2022)

Complexity and algorithms for neighbor-sum-2-distinguishing {1, 3}-edge-weighting of graphs. - B. S. Panda 001; Priyamvada (Theor. Comput. Sci., 2022)

Exact square coloring of certain classes of graphs: Complexity and algorithms. - Priyamvada; B. S. Panda 001 (Theor. Comput. Sci., 2022)

Link prediction in complex networks using node centrality and light gradient boosting machine. - Sanjay Kumar 001; Abhishek Mallik; B. S. Panda 001 (World Wide Web, 2022)

Exact square coloring of graphs resulting from some graph operations and products. - Priyamvada; B. S. Panda 001 (AKCE Int. J. Graphs Comb., 2022)

Minimum Maximal Acyclic Matching in Proper Interval Graphs. - Juhi Chaudhary; Sounaka Mishra; B. S. Panda 001 (CALDAM, 2023)

Algorithms and Complexity of Strongly Stable Non-crossing Matchings. - B. S. Panda 001; Sachin (CALDAM, 2023)

Influence maximization in social networks using transfer learning via graph-based LSTM. - Sanjay Kumar 001; Abhishek Mallik; B. S. Panda 001 (Expert Syst. Appl., 2023)

Acyclic matching in some subclasses of graphs. - B. S. Panda 001; Juhi Chaudhary (Theor. Comput. Sci., 2023)

Identifying Influential Nodes for Smart Enterprises Using Community Structure With Integrated Feature Ranking. - Sanjay Kumar 001; Akshi Kumar 001; B. S. Panda 001 (IEEE Trans. Ind. Informatics, 2023)

Complexity and algorithms for injective edge coloring of graphs. - Priyamvada; B. S. Panda 001 (Theor. Comput. Sci., 2023)

Hardness results of global roman domination in graphs. - B. S. Panda 001; Pooja Goyal (Discret. Appl. Math., 2023)

Total colorings of complete multipartite graphs using amalgamations. - Aseem Dalal; Bhawani Sankar Panda; C. A. Rodger (Discret. Appl. Math., 2024)

Adjacent vertex distinguishing total coloring of the corona product of graphs. - Shaily Verma; Bhawani Sankar Panda (Discuss. Math. Graph Theory, 2024)

On the complexity of co-secure dominating set problem. - B. S. Panda 001; Soumyashree Rana; Sounaka Mishra (Inf. Process. Lett., 2024)

Injective edge coloring of some standard graph products. - B. S. Panda 001 (Discret. Math. Algorithms Appl., 2024)

On the complexity of minimum maximal acyclic matchings. - Juhi Chaudhary; Sounaka Mishra; B. S. Panda 001 (J. Comb. Optim., 2024)

Hardness Results of Connected Power Domination for Bipartite Graphs and Chordal Graphs. - Pooja Goyal; Bhawani Sankar Panda (Int. J. Found. Comput. Sci., 2024)

Bipartite Domination in Graphs: Complexity and Algorithms. - Bhawani Sankar Panda; Subhasmita Joshi; Dalu Jacob (CALDAM, 2025)

On total chromatic number of complete multipartite graphs. - Aseem Dalal; B. S. Panda 001 (Discret. Appl. Math., 2025)

Hardness and approximation results for some variants of Stable Marriage problem. - Bhawani Sankar Panda; Sachin (Discret. Appl. Math., 2025)

Disjoint dominating and 2-dominating sets in graphs: Hardness and approximation results. - Soumyashree Rana; Sounaka Mishra; Bhawani Sankar Panda (Discret. Optim., 2025)

Injective coloring of subclasses of chordal graphs. - Bhawani Sankar Panda; Rumki Ghosh (Theor. Comput. Sci., 2025)