Bhawani Sankar Panda

According to our database, Bhawani Sankar Panda authored at least 109 papers between 1994 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Injective coloring of subclasses of chordal graphs.

Bhawani Sankar Panda, Rumki Ghosh

Theor. Comput. Sci., 2025

2024

Hardness Results of Connected Power Domination for Bipartite Graphs and Chordal Graphs.

Pooja Goyal, Bhawani Sankar Panda

Int. J. Found. Comput. Sci., September, 2024

On the complexity of minimum maximal acyclic matchings.

Juhi Chaudhary, Sounaka Mishra, B. S. Panda

J. Comb. Optim., August, 2024

Injective edge coloring of some standard graph products.

B. S. Panda

Discret. Math. Algorithms Appl., May, 2024

On the complexity of co-secure dominating set problem.

B. S. Panda, Soumyashree Rana, Sounaka Mishra

Inf. Process. Lett., March, 2024

Adjacent vertex distinguishing total coloring of the corona product of graphs.

Shaily Verma, Bhawani Sankar Panda

Discuss. Math. Graph Theory, 2024

Total colorings of complete multipartite graphs using amalgamations.

Aseem Dalal, Bhawani Sankar Panda, C. A. Rodger

Discret. Appl. Math., 2024

On Total Chromatic Number of Complete Multipartite Graphs.

Aseem Dalal, B. S. Panda

Proceedings of the Algorithms and Discrete Applied Mathematics, 2024

2023

Hardness results of global roman domination in graphs.

B. S. Panda, Pooja Goyal

Discret. Appl. Math., December, 2023

Complexity and algorithms for injective edge coloring of graphs.

Priyamvada, B. S. Panda

Theor. Comput. Sci., August, 2023

Identifying Influential Nodes for Smart Enterprises Using Community Structure With Integrated Feature Ranking.

Sanjay Kumar, Akshi Kumar, B. S. Panda

IEEE Trans. Ind. Informatics, 2023

Acyclic matching in some subclasses of graphs.

B. S. Panda, Juhi Chaudhary

Theor. Comput. Sci., 2023

Influence maximization in social networks using transfer learning via graph-based LSTM.

Sanjay Kumar, Abhishek Mallik, B. S. Panda

Expert Syst. Appl., 2023

Disjoint Dominating and 2-Dominating Sets in Graphs: Hardness and Approximation results.

Soumyashree Rana, Sounaka Mishra, Bhawani Sankar Panda

CoRR, 2023

Algorithms and Complexity of Strongly Stable Non-crossing Matchings.

B. S. Panda, Sachin

Proceedings of the Algorithms and Discrete Applied Mathematics, 2023

Minimum Maximal Acyclic Matching in Proper Interval Graphs.

Juhi Chaudhary, Sounaka Mishra, B. S. Panda

Proceedings of the Algorithms and Discrete Applied Mathematics, 2023

2022

Exact square coloring of graphs resulting from some graph operations and products.

Priyamvada, B. S. Panda

AKCE Int. J. Graphs Comb., September, 2022

Link prediction in complex networks using node centrality and light gradient boosting machine.

Sanjay Kumar, Abhishek Mallik, B. S. Panda

World Wide Web, 2022

Exact square coloring of certain classes of graphs: Complexity and algorithms.

Priyamvada, B. S. Panda

Theor. Comput. Sci., 2022

Complexity and algorithms for neighbor-sum-2-distinguishing {1, 3}-edge-weighting of graphs.

B. S. Panda, Priyamvada

Theor. Comput. Sci., 2022

Influence maximization in social networks using graph embedding and graph neural network.

Sanjay Kumar, Abhishek Mallik, Anavi Khetarpal, Bhawani Sankar Panda

Inf. Sci., 2022

Adjacent vertex distinguishing total coloring in split graphs.

Shaily Verma, Hung-Lin Fu, B. S. Panda

Discret. Math., 2022

Hardness results of global total k-domination problem in graphs.

B. S. Panda, Pooja Goyal

Discret. Appl. Math., 2022

MDER: modified degree with exclusion ratio algorithm for influence maximisation in social networks.

Sanjay Kumar, Dipti Lohia, Darsh Pratap, Ashutosh Krishna, B. S. Panda

Computing, 2022

On Two Variants of Induced Matchings.

Juhi Chaudhary, B. S. Panda

Proceedings of the New Trends in Computer Technologies and Applications, 2022

Hardness and Approximation Results for Some Variants of Stable Marriage Problem.

B. S. Panda, Sachin

Proceedings of the Algorithms and Discrete Applied Mathematics, 2022

2021

Differentiating-total domination: Approximation and hardness results.

B. S. Panda, Pooja Goyal, Dinabandhu Pradhan

Theor. Comput. Sci., 2021

Global total <i>k</i>-domination: Approximation and hardness results.

B. S. Panda, Pooja Goyal

Theor. Comput. Sci., 2021

Dominating induced matching in some subclasses of bipartite graphs.

B. S. Panda, Juhi Chaudhary

Theor. Comput. Sci., 2021

On the complexity of minimum maximal uniquely restricted matching.

Juhi Chaudhary, Bhawani Sankar Panda

Theor. Comput. Sci., 2021

Modeling information diffusion in online social networks using a modified forest-fire model.

Sanjay Kumar, Muskan Saini, Muskan Goel, B. S. Panda

J. Intell. Inf. Syst., 2021

Community detection in complex networks using network embedding and gravitational search algorithm.

Sanjay Kumar, B. S. Panda, Deepanshu Aggarwal

J. Intell. Inf. Syst., 2021

Injective coloring of some subclasses of bipartite graphs and chordal graphs.

B. S. Panda, Priyamvada

Discret. Appl. Math., 2021

Preface: CALDAM 2018.

Bhawani Sankar Panda, Subir Kumar Ghosh

Discret. Appl. Math., 2021

IM-ELPR: Influence maximization in social networks using label propagation based community structure.

Sanjay Kumar, Lakshay Singhla, Kshitij Jindal, Khyati Grover, B. S. Panda

Appl. Intell., 2021

Hardness and Approximation Results of Roman {3}-Domination in Graphs.

Pooja Goyal, B. S. Panda

Proceedings of the Computing and Combinatorics - 27th International Conference, 2021

2020

Maximum weight induced matching in some subclasses of bipartite graphs.

B. S. Panda, Arti Pandey, Juhi Chaudhary, Piyush Dane, Manav Kashyap

J. Comb. Optim., 2020

Grundy coloring in some subclasses of bipartite graphs and their complements.

Shaily Verma, B. S. Panda

Inf. Process. Lett., 2020

On the total and AVD-total coloring of graphs.

B. S. Panda, Shaily Verma, Yash Keerti

AKCE Int. J. Graphs Comb., 2020

Identifying Influential Spreaders On a Weighted Network Using HookeRank Method.

Sanjay Kumar, Nipun Aggarwal, B. S. Panda

Proceedings of the Computational Science - ICCS 2020, 2020

2019

Computing a minimum paired-dominating set in strongly orderable graphs.

Dinabandhu Pradhan, B. S. Panda

Discret. Appl. Math., 2019

Domination in some subclasses of bipartite graphs.

Arti Pandey, B. S. Panda

Discret. Appl. Math., 2019

On partial Grundy coloring of bipartite graphs and chordal graphs.

B. S. Panda, Shaily Verma

Discret. Appl. Math., 2019

2018

Algorithmic aspects of b-disjunctive domination in graphs.

B. S. Panda, Arti Pandey, Subhabrata Paul

J. Comb. Optim., 2018

Characterization and Recognition of Tree 3-Spanner Admissible Directed Path Graphs of Diameter Three.

B. S. Panda, Anita Das

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2018

2017

Restrained Domination in Some Subclasses of Chordal Graphs.

Arti Pandey, B. S. Panda

Electron. Notes Discret. Math., 2017

Algorithmic aspects of open neighborhood location-domination in graphs.

B. S. Panda, Arti Pandey

Discret. Appl. Math., 2017

Improved Energy-Efficient Target Coverage in Wireless Sensor Networks.

Bhawani Sankar Panda, Bijaya K. Bhatta, Sambit Kumar Mishra

Proceedings of the Computational Science and Its Applications - ICCSA 2017, 2017

Induced Matching in Some Subclasses of Bipartite Graphs.

Arti Pandey, B. S. Panda, Piyush Dane, Manav Kashyap

Proceedings of the Algorithms and Discrete Applied Mathematics, 2017

New heuristics for strong minimum energy topology with reduced time complexity.

B. S. Panda, Bijaya K. Bhatta, Deepak Mishra, Swades De

Proceedings of the 2017 IEEE International Conference on Advanced Networks and Telecommunications Systems, 2017

2016

Strong minimum energy hierarchical topology in wireless sensor networks.

B. S. Panda, D. Pushparaj Shetty

J. Comb. Optim., 2016

Complexity of total outer-connected domination problem in graphs.

B. S. Panda, Arti Pandey

Discret. Appl. Math., 2016

Some Algorithmic Results on Restrained Domination in Graphs.

Arti Pandey, Bhawani Sankar Panda

CoRR, 2016

Partial Grundy Coloring in Some Subclasses of Bipartite Graphs and Chordal Graphs.

B. S. Panda, Shaily Verma

Proceedings of the Theoretical Computer Science and Discrete Mathematics, 2016

On the Complexity of Minimum Cardinality Maximal Uniquely Restricted Matching in Graphs.

B. S. Panda, Arti Pandey

Proceedings of the Theoretical Computer Science and Discrete Mathematics, 2016

b-Disjunctive Total Domination in Graphs: Algorithm and Hardness Results.

Arti Pandey, B. S. Panda

Proceedings of the Algorithms and Discrete Applied Mathematics, 2016

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

Strong minimum energy 2-hop rooted topology for hierarchical wireless sensor networks.

B. S. Panda, D. Pushparaj Shetty

J. Comb. Optim., 2015

On the dominator coloring in proper interval graphs and block graphs.

B. S. Panda, Arti Pandey

Discret. Math. Algorithms Appl., 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

Algorithmic aspects of disjunctive domination in graphs.

Bhawani Sankar Panda, Arti Pandey

CoRR, 2015

L(2, 1)-labeling of Block Graphs.

Bhawani Sankar Panda, Preeti Goel

Ars Comb., 2015

Boruvka-Incremental Power Greedy Heuristic for Strong Minimum Energy Topology in Wireless Sensor Networks.

B. S. Panda, Bijaya K. Bhatta, Deepak Mishra, Swades De

Proceedings of the 2015 International Conference on Distributed Computing and Networking, 2015

k-Distinct Strong Minimum Energy Topology Problem in Wireless Sensor Networks.

Bhawani Sankar Panda, D. Pushparaj Shetty, Arti Pandey

Proceedings of the Distributed Computing and Internet Technology, 2015

Algorithmic Aspects of Disjunctive Domination in Graphs.

B. S. Panda, Arti Pandey, Subhabrata Paul

Proceedings of the Computing and Combinatorics - 21st International Conference, 2015

Separator Theorems for Interval Graphs and Proper Interval Graphs.

Bhawani Sankar Panda

Proceedings of the Algorithms and Discrete Applied Mathematics, 2015

2014

Algorithm and Hardness Results for Outer-connected Dominating Set in Graphs.

Bhawani Sankar Panda, Arti Pandey

J. Graph Algorithms Appl., 2014

Hardness results and approximation algorithm for total liar's domination in graphs.

B. S. Panda, Subhabrata Paul

J. Comb. Optim., 2014

Minimum Range Assignment Problem for Two Connectivity in Wireless Sensor Networks.

Bhawani Sankar Panda, D. Pushparaj Shetty

Proceedings of the Distributed Computing and Internet Technology, 2014

2013

Minimum paired-dominating set in chordal bipartite graphs and perfect elimination bipartite graphs.

B. S. Panda, Dinabandhu Pradhan

J. Comb. Optim., 2013

A linear time algorithm for liar's domination problem in proper interval graphs.

B. S. Panda, Subhabrata Paul

Inf. Process. Lett., 2013

Minimum interference strong bidirectional topology for wireless sensor networks.

B. S. Panda, D. Pushparaj Shetty

Int. J. Ad Hoc Ubiquitous Comput., 2013

Connected Liar's domination in graphs: Complexity and Algorithms.

B. S. Panda, Subhabrata Paul

Discret. Math. Algorithms Appl., 2013

A linear time algorithm for computing a minimum paired-dominating set of a convex bipartite graph.

B. S. Panda, Dinabandhu Pradhan

Discret. Appl. Math., 2013

Liar's domination in graphs: Complexity and algorithm.

B. S. Panda, Subhabrata Paul

Discret. Appl. Math., 2013

A Local Search Based Approximation Algorithm for Strong Minimum Energy Topology Problem in Wireless Sensor Networks.

Bhawani Sankar Panda, D. Pushparaj Shetty

Proceedings of the Distributed Computing and Internet Technology, 2013

2012

Complexity of distance paired-domination problem in graphs.

Gerard J. Chang, B. S. Panda, Dinabandhu Pradhan

Theor. Comput. Sci., 2012

L(2,1)-labeling of dually chordal graphs and strongly orderable graphs.

B. S. Panda, Preeti Goel

Inf. Process. Lett., 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

Acyclic Matchings in Subclasses of bipartite Graphs.

B. S. Panda, Dinabandhu Pradhan

Discret. Math. Algorithms Appl., 2012

Strong Minimum Energy Minimum Interference Topology in Wireless Sensor Networks.

Bhawani Sankar Panda, D. Pushparaj Shetty, Bijaya Kishor Bhatta

Proceedings of the Distributed Computing and Internet Technology, 2012

2011

L(2, 1)-labeling of perfect elimination bipartite graphs.

B. S. Panda, Preeti Goel

Discret. Appl. Math., 2011

An Incremental Power Greedy Heuristic for Strong Minimum Energy Topology in Wireless Sensor Networks.

B. S. Panda, D. Pushparaj Shetty

Proceedings of the Distributed Computing and Internet Technology, 2011

Strong Minimum Interference Topology for Wireless Sensor Networks.

B. S. Panda, D. Pushparaj Shetty

Proceedings of the Advanced Computing, Networking and Security - International Conference, 2011

2010

Locally connected spanning trees in cographs, complements of bipartite graphs and doubly chordal graphs.

B. S. Panda, Dinabandhu Pradhan

Inf. Process. Lett., 2010

Tree 3-spanners in 2-sep chordal graphs: Characterization and algorithms.

B. S. Panda, Anita Das

Discret. Appl. Math., 2010

Energy-Efficient Greedy Forwarding Protocol for Wireless Sensor Networks.

Bighnaraj Panigrahi, Swades De, Bhawani Sankar Panda, Jean-Daniel Lan Sun Luk

Proceedings of the 71st IEEE Vehicular Technology Conference, 2010

Heuristic Algorithms for the <i>L</i>(2, 1)-Labeling Problem.

B. S. Panda, Preeti Goel

Proceedings of the Swarm, Evolutionary, and Memetic Computing, 2010

2009

A parallel algorithm for generating bicompatible elimination orderings of proper interval graphs.

B. S. Panda, Sajal K. Das

Inf. Process. Lett., 2009

Tree 3-spanners in 2-sep directed path graphs: Characterization, recognition, and construction.

B. S. Panda, Anita Das

Discret. Appl. Math., 2009

2008

NP-Completeness of Hamiltonian Cycle Problem on Rooted Directed Path Graphs

B. S. Panda, Dinabandhu Pradhan

CoRR, 2008

2007

On tree 3-spanners in directed path graphs.

B. S. Panda, Anita Das

Networks, 2007

2006

Tree 3-Spanner in 2-sep Chordal Graphs: Characterization, Recognition, and Construction.

Bhawani Sankar Panda, Anita Das

Electron. Notes Discret. Math., 2006

A linear time algorithm for constructing tree 3-spanner in simple chordal bipartite graphs.

Anita Das, B. S. Panda, Rajendra P. Lal

Proceedings of the 9th International Conference in Information Technology, 2006

2005

Parallel recognition algorithms for chordal_planar graphs and planar <i>k</i>-trees.

B. S. Panda, Sajal K. Das

J. Parallel Distributed Comput., 2005

2004

Optimal Schemes for Channel Assignment Problem in Wireless Networks Modeled as 2-Dimensional Square Grids.

B. S. Panda, Mahesh Kumar, Sajal K. Das

Proceedings of the Distributed Computing, 2004

A Linear Time Algorithm for Constructing Tree 4-Spanner in 2-Trees.

B. S. Panda, Anita Das

Proceedings of the Intelligent Information Technology, 2004

2003

A linear time recognition algorithm for proper interval graphs.

B. S. Panda, Sajal K. Das

Inf. Process. Lett., 2003

2002

Parallel Algorithms for Hamiltonian 2-Separator Chordal Graphs.

B. S. Panda, Vijay Natarajan, Sajal K. Das

Parallel Process. Lett., 2002

Performance Evaluation of a Two Level Error Recovery Scheme for Distributed Systems.

B. S. Panda, Sajal K. Das

Proceedings of the Distributed Computing, 2002

A Linear Time Algorithm for Finding Tree 3-Spanner on 2-Trees.

B. S. Panda, Sajal K. Das

Proceedings of the Foundations of Information Technology in the Era of Networking and Mobile Computing, 2002

An Efficient Parallel Algorithm for Computing Bicompatible Elimination Ordering (BCO) of Proper Interval Graphs.

B. S. Panda, Sajal K. Das

Proceedings of the High Performance Computing, 2002

2001

The Separator Theorem for Rooted Directed Vertex Graphs.

B. S. Panda

J. Comb. Theory B, 2001

Parallel Algortithms for Hamiltonian 2-Separator Chordal Graphs.

B. S. Panda, Vijay Natarajan, Sajal K. Das

Proceedings of the 15th International Parallel & Distributed Processing Symposium (IPDPS-01), 2001

An Efficient Algorithm for Computing Lower Bounds on Time and Processors for Scheduling Precedence Graphs on Multicomputer Systems.

B. S. Panda, Sajal K. Das

Proceedings of the High Performance Computing - HiPC 2001, 8th International Conference, 2001

1999

The forbidden subgraph characterization of directed vertex graphs.

B. S. Panda

Discret. Math., 1999

1996

New Linear Time Algorithms for Generating Perfect Elimination Orderings of Chordal Graphs.

B. S. Panda

Inf. Process. Lett., 1996

1995

Intersection graphs of vertex disjoint paths in a tree.

B. S. Panda, Shreedhara Prasada Mohanty

Discret. Math., 1995

1994

Recognition Algorithm for Intersection Graphs of Edge Disjoint Paths in a Tree.

B. S. Panda, Shreedhara Prasada Mohanty

Inf. Process. Lett., 1994