| 2022 | COCOON | On the Complexity of Minimum Maximal Acyclic Matchings. | Juhi Chaudhary, Sounaka Mishra, B. S. Panda |
| 2021 | COCOA | Hardness Results of Connected Power Domination for Bipartite Graphs and Chordal Graphs. | Pooja Goyal, B. S. Panda |
| 2021 | COCOON | Hardness and Approximation Results of Roman {3}-Domination in Graphs. | Pooja Goyal, B. S. Panda |
| 2020 | COCOA | On the Complexity of Minimum Maximal Uniquely Restricted Matching. | Juhi Chaudhary, B. S. Panda |
| 2020 | ICCS | Identifying Influential Spreaders On a Weighted Network Using HookeRank Method. | Sanjay Kumar, Nipun Aggarwal, B. S. Panda |
| 2020 | IWOCA | Acyclic Matching in Some Subclasses of Graphs. | B. S. Panda, Juhi Chaudhary |
| 2018 | WG | Characterization and Recognition of Tree 3-Spanner Admissible Directed Path Graphs of Diameter Three. | B. S. Panda, Anita Das |
| 2015 | COCOON | Algorithmic Aspects of Disjunctive Domination in Graphs. | B. S. Panda, Arti Pandey, Subhabrata Paul |
| 2015 | ICDCN | Boruvka-Incremental Power Greedy Heuristic for Strong Minimum Energy Topology in Wireless Sensor Networks. | B. S. Panda, Bijaya K. Bhatta, Deepak Mishra, Swades De |
| 2014 | WALCOM | Algorithm and Hardness Results for Outer-connected Dominating Set in Graphs. | B. S. Panda, Arti Pandey |
| 2011 | ICDCIT | An Incremental Power Greedy Heuristic for Strong Minimum Energy Topology in Wireless Sensor Networks. | B. S. Panda, D. Pushparaj Shetty |
| 2006 | CIT | A linear time algorithm for constructing tree 3-spanner in simple chordal bipartite graphs. | Anita Das, B. S. Panda, Rajendra P. Lal |
| 2004 | CIT | A Linear Time Algorithm for Constructing Tree 4-Spanner in 2-Trees. | B. S. Panda, Anita Das |
| 2002 | HiPC | An Efficient Parallel Algorithm for Computing Bicompatible Elimination Ordering (BCO) of Proper Interval Graphs. | B. S. Panda, Sajal K. Das |
| 2001 | HiPC | An Efficient Algorithm for Computing Lower Bounds on Time and Processors for Scheduling Precedence Graphs on Multicomputer Systems. | B. S. Panda, Sajal K. Das |