B. S. Panda

Publication Activity (10 Years)

Years Active: 1994-2024
Publications (10 Years): 58

Top Topics

Bipartite Graph

Algorithmic Aspects

Community Structure

Top Venues

Discret. Appl. Math.

Theor. Comput. Sci.

J. Comb. Optim.

Publications

Juhi Chaudhary, Sounaka Mishra, B. S. Panda
On the complexity of minimum maximal acyclic matchings. J. Comb. Optim. 48 (1) (2024)
B. S. Panda
Injective edge coloring of some standard graph products. Discret. Math. Algorithms Appl. 16 (4) (2024)
B. S. Panda, Soumyashree Rana, Sounaka Mishra
On the complexity of co-secure dominating set problem. Inf. Process. Lett. 185 (2024)
Aseem Dalal, B. S. Panda
On Total Chromatic Number of Complete Multipartite Graphs. CALDAM (2024)
B. S. Panda, Pooja Goyal
Hardness results of global roman domination in graphs. Discret. Appl. Math. 341 (2023)
Juhi Chaudhary, Sounaka Mishra, B. S. Panda
Minimum Maximal Acyclic Matching in Proper Interval Graphs. CALDAM (2023)
Sanjay Kumar, Abhishek Mallik, B. S. Panda
Influence maximization in social networks using transfer learning via graph-based LSTM. Expert Syst. Appl. 212 (2023)
Priyamvada, B. S. Panda
Complexity and algorithms for injective edge coloring of graphs. Theor. Comput. Sci. 968 (2023)
B. S. Panda, Sachin
Algorithms and Complexity of Strongly Stable Non-crossing Matchings. CALDAM (2023)
B. S. Panda, Juhi Chaudhary
Acyclic matching in some subclasses of graphs. Theor. Comput. Sci. 943 (2023)
Sanjay Kumar, Akshi Kumar, B. S. Panda
Identifying Influential Nodes for Smart Enterprises Using Community Structure With Integrated Feature Ranking. IEEE Trans. Ind. Informatics 19 (1) (2023)
Sanjay Kumar, Dipti Lohia, Darsh Pratap, Ashutosh Krishna, B. S. Panda
MDER: modified degree with exclusion ratio algorithm for influence maximisation in social networks. Computing 104 (2) (2022)
Juhi Chaudhary, B. S. Panda
On Two Variants of Induced Matchings. ICS (2022)
Priyamvada, B. S. Panda
Exact square coloring of certain classes of graphs: Complexity and algorithms. Theor. Comput. Sci. 932 (2022)
B. S. Panda, Priyamvada
Complexity and algorithms for neighbor-sum-2-distinguishing {1, 3}-edge-weighting of graphs. Theor. Comput. Sci. 906 (2022)
B. S. Panda, Sachin
Hardness and Approximation Results for Some Variants of Stable Marriage Problem. CALDAM (2022)
Shaily Verma, Hung-Lin Fu, B. S. Panda
Adjacent vertex distinguishing total coloring in split graphs. Discret. Math. 345 (11) (2022)
B. S. Panda, Pooja Goyal
Hardness results of global total k-domination problem in graphs. Discret. Appl. Math. 319 (2022)
Priyamvada, B. S. Panda
Exact square coloring of graphs resulting from some graph operations and products. AKCE Int. J. Graphs Comb. 19 (3) (2022)
Juhi Chaudhary, Sounaka Mishra, B. S. Panda
On the Complexity of Minimum Maximal Acyclic Matchings. COCOON (2022)
Sanjay Kumar, Abhishek Mallik, B. S. Panda
Link prediction in complex networks using node centrality and light gradient boosting machine. World Wide Web 25 (6) (2022)
B. S. Panda, Pooja Goyal
-domination: Approximation and hardness results. Theor. Comput. Sci. 850 (2021)
B. S. Panda, Pooja Goyal
Hardness Results of Global Roman Domination in Graphs. CALDAM (2021)
B. S. Panda, Pooja Goyal, Dinabandhu Pradhan
Differentiating-total domination: Approximation and hardness results. Theor. Comput. Sci. 876 (2021)
B. S. Panda, Priyamvada
Injective coloring of some subclasses of bipartite graphs and chordal graphs. Discret. Appl. Math. 291 (2021)
Sanjay Kumar, B. S. Panda, Deepanshu Aggarwal
Community detection in complex networks using network embedding and gravitational search algorithm. J. Intell. Inf. Syst. 57 (1) (2021)
Sanjay Kumar, Muskan Saini, Muskan Goel, B. S. Panda
Modeling information diffusion in online social networks using a modified forest-fire model. J. Intell. Inf. Syst. 56 (2) (2021)
B. S. Panda, Juhi Chaudhary
Dominating induced matching in some subclasses of bipartite graphs. Theor. Comput. Sci. 885 (2021)
Sanjay Kumar, Lakshay Singhla, Kshitij Jindal, Khyati Grover, B. S. Panda
IM-ELPR: Influence maximization in social networks using label propagation based community structure. Appl. Intell. 51 (11) (2021)
Pooja Goyal, B. S. Panda
Hardness and Approximation Results of Roman {3}-Domination in Graphs. COCOON (2021)
Pooja Goyal, B. S. Panda
Hardness Results of Connected Power Domination for Bipartite Graphs and Chordal Graphs. COCOA (2021)
B. S. Panda, Juhi Chaudhary
Acyclic Matching in Some Subclasses of Graphs. IWOCA (2020)
Sanjay Kumar, Nipun Aggarwal, B. S. Panda
Identifying Influential Spreaders On a Weighted Network Using HookeRank Method. ICCS (1) (2020)
B. S. Panda, Arti Pandey, Juhi Chaudhary, Piyush Dane, Manav Kashyap
Maximum weight induced matching in some subclasses of bipartite graphs. J. Comb. Optim. 40 (3) (2020)
B. S. Panda, Pooja Goyal
Hardness Results of Global Total k-Domination Problem in Graphs. CALDAM (2020)
Shaily Verma, B. S. Panda
Grundy coloring in some subclasses of bipartite graphs and their complements. Inf. Process. Lett. 163 (2020)
B. S. Panda, Shaily Verma, Yash Keerti
On the total and AVD-total coloring of graphs. AKCE Int. J. Graphs Comb. 17 (3) (2020)
Juhi Chaudhary, B. S. Panda
On the Complexity of Minimum Maximal Uniquely Restricted Matching. COCOA (2020)
B. S. Panda, Juhi Chaudhary
Dominating Induced Matching in Some Subclasses of Bipartite Graphs. CALDAM (2019)
Arti Pandey, B. S. Panda
Domination in some subclasses of bipartite graphs. Discret. Appl. Math. 252 (2019)
Dinabandhu Pradhan, B. S. Panda
Computing a minimum paired-dominating set in strongly orderable graphs. Discret. Appl. Math. 253 (2019)
B. S. Panda, Shaily Verma
On partial Grundy coloring of bipartite graphs and chordal graphs. Discret. Appl. Math. 271 (2019)
B. S. Panda, Anita Das
Characterization and Recognition of Tree 3-Spanner Admissible Directed Path Graphs of Diameter Three. WG (2018)
B. S. Panda, Arti Pandey, Subhabrata Paul
Algorithmic aspects of b-disjunctive domination in graphs. J. Comb. Optim. 36 (2) (2018)
B. S. Panda, Arti Pandey
Algorithmic aspects of open neighborhood location-domination in graphs. Discret. Appl. Math. 216 (2017)
Arti Pandey, B. S. Panda, Piyush Dane, Manav Kashyap
Induced Matching in Some Subclasses of Bipartite Graphs. CALDAM (2017)
Arti Pandey, B. S. Panda
Restrained Domination in Some Subclasses of Chordal Graphs. Electron. Notes Discret. Math. 63 (2017)
B. S. Panda, Bijaya K. Bhatta, Deepak Mishra, Swades De
New heuristics for strong minimum energy topology with reduced time complexity. ANTS (2017)
B. S. Panda, Arti Pandey
On the Complexity of Minimum Cardinality Maximal Uniquely Restricted Matching in Graphs. ICTCSDM (2016)
B. S. Panda, D. Pushparaj Shetty
Strong minimum energy hierarchical topology in wireless sensor networks. J. Comb. Optim. 32 (1) (2016)
Aseem Dalal, B. S. Panda, C. A. Rodger
Total-colorings of complete multipartite graphs using amalgamations. Discret. Math. 339 (5) (2016)
B. S. Panda, Arti Pandey
Complexity of total outer-connected domination problem in graphs. Discret. Appl. Math. 199 (2016)
Arti Pandey, B. S. Panda
b-Disjunctive Total Domination in Graphs: Algorithm and Hardness Results. CALDAM (2016)
B. S. Panda, Shaily Verma
Partial Grundy Coloring in Some Subclasses of Bipartite Graphs and Chordal Graphs. ICTCSDM (2016)
B. S. Panda, Arti Pandey, Subhabrata Paul
Algorithmic Aspects of Disjunctive Domination in Graphs. COCOON (2015)
B. S. Panda, D. Pushparaj Shetty
Strong minimum energy 2-hop rooted topology for hierarchical wireless sensor networks. J. Comb. Optim. 30 (4) (2015)
B. S. Panda, Bijaya K. Bhatta, Deepak Mishra, Swades De
Boruvka-Incremental Power Greedy Heuristic for Strong Minimum Energy Topology in Wireless Sensor Networks. ICDCN (2015)
B. S. Panda, Arti Pandey
On the dominator coloring in proper interval graphs and block graphs. Discret. Math. Algorithms Appl. 7 (4) (2015)
B. S. Panda, Arti Pandey
Algorithm and Hardness Results for Outer-connected Dominating Set in Graphs. WALCOM (2014)
B. S. Panda, Subhabrata Paul
Hardness results and approximation algorithm for total liar's domination in graphs. J. Comb. Optim. 27 (4) (2014)
B. S. Panda, D. Pushparaj Shetty
Minimum interference strong bidirectional topology for wireless sensor networks. Int. J. Ad Hoc Ubiquitous Comput. 13 (3/4) (2013)
B. S. Panda, Subhabrata Paul
Liar's domination in graphs: Complexity and algorithm. Discret. Appl. Math. 161 (7-8) (2013)
B. S. Panda, Dinabandhu Pradhan
A linear time algorithm for computing a minimum paired-dominating set of a convex bipartite graph. Discret. Appl. Math. 161 (12) (2013)
B. S. Panda, Subhabrata Paul
A linear time algorithm for liar's domination problem in proper interval graphs. Inf. Process. Lett. 113 (19-21) (2013)
B. S. Panda, Subhabrata Paul
Connected Liar's domination in graphs: Complexity and Algorithms. Discret. Math. Algorithms Appl. 5 (4) (2013)
B. S. Panda, Dinabandhu Pradhan
Minimum paired-dominating set in chordal bipartite graphs and perfect elimination bipartite graphs. J. Comb. Optim. 26 (4) (2013)
B. S. Panda, Dinabandhu Pradhan
Acyclic Matchings in Subclasses of bipartite Graphs. Discret. Math. Algorithms Appl. 4 (4) (2012)
Gerard J. Chang, B. S. Panda, Dinabandhu Pradhan
Complexity of distance paired-domination problem in graphs. Theor. Comput. Sci. 459 (2012)
B. S. Panda, Preeti Goel
L(2,1)-labeling of dually chordal graphs and strongly orderable graphs. Inf. Process. Lett. 112 (13) (2012)
B. S. Panda, D. Pushparaj Shetty
Strong Minimum Interference Topology for Wireless Sensor Networks. ADCONS (2011)
B. S. Panda, Preeti Goel
L(2, 1)-labeling of perfect elimination bipartite graphs. Discret. Appl. Math. 159 (16) (2011)
B. S. Panda, D. Pushparaj Shetty
An Incremental Power Greedy Heuristic for Strong Minimum Energy Topology in Wireless Sensor Networks. ICDCIT (2011)
B. S. Panda, Preeti Goel
(2, 1)-Labeling Problem. SEMCCO (2010)
B. S. Panda, Anita Das
Tree 3-spanners in 2-sep chordal graphs: Characterization and algorithms. Discret. Appl. Math. 158 (17) (2010)
B. S. Panda, Dinabandhu Pradhan
Locally connected spanning trees in cographs, complements of bipartite graphs and doubly chordal graphs. Inf. Process. Lett. 110 (23) (2010)
B. S. Panda, Sajal K. Das
A parallel algorithm for generating bicompatible elimination orderings of proper interval graphs. Inf. Process. Lett. 109 (18) (2009)
B. S. Panda, Anita Das
Tree 3-spanners in 2-sep directed path graphs: Characterization, recognition, and construction. Discret. Appl. Math. 157 (9) (2009)
B. S. Panda, Dinabandhu Pradhan
NP-Completeness of Hamiltonian Cycle Problem on Rooted Directed Path Graphs CoRR (2008)
B. S. Panda, Anita Das
On tree 3-spanners in directed path graphs. Networks 50 (3) (2007)
Anita Das, B. S. Panda, Rajendra P. Lal
A linear time algorithm for constructing tree 3-spanner in simple chordal bipartite graphs. ICIT (2006)
B. S. Panda, Sajal K. Das
-trees. J. Parallel Distributed Comput. 65 (8) (2005)
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)
B. S. Panda, Anita Das
A Linear Time Algorithm for Constructing Tree 4-Spanner in 2-Trees. CIT (2004)
B. S. Panda, Sajal K. Das
A linear time recognition algorithm for proper interval graphs. Inf. Process. Lett. 87 (3) (2003)
B. S. Panda, Sajal K. Das
A Linear Time Algorithm for Finding Tree 3-Spanner on 2-Trees. IFIP TCS (2002)
B. S. Panda, Vijay Natarajan, Sajal K. Das
Parallel Algorithms for Hamiltonian 2-Separator Chordal Graphs. Parallel Process. Lett. 12 (1) (2002)
B. S. Panda, Sajal K. Das
Performance Evaluation of a Two Level Error Recovery Scheme for Distributed Systems. IWDC (2002)
B. S. Panda, Sajal K. Das
An Efficient Parallel Algorithm for Computing Bicompatible Elimination Ordering (BCO) of Proper Interval Graphs. HiPC (2002)
B. S. Panda, Vijay Natarajan, Sajal K. Das
Parallel Algortithms for Hamiltonian 2-Separator Chordal Graphs. IPDPS (2001)
B. S. Panda
The Separator Theorem for Rooted Directed Vertex Graphs. J. Comb. Theory, Ser. B 81 (1) (2001)
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)
B. S. Panda
The forbidden subgraph characterization of directed vertex graphs. Discret. Math. 196 (1-3) (1999)
B. S. Panda
New Linear Time Algorithms for Generating Perfect Elimination Orderings of Chordal Graphs. Inf. Process. Lett. 58 (3) (1996)
B. S. Panda, Shreedhara Prasada Mohanty
Intersection graphs of vertex disjoint paths in a tree. Discret. Math. 146 (1-3) (1995)
B. S. Panda, Shreedhara Prasada Mohanty
Recognition Algorithm for Intersection Graphs of Edge Disjoint Paths in a Tree. Inf. Process. Lett. 49 (3) (1994)