B. S. Panda

99 papers A 2B 2C 4Misc 7Journal 63Unranked 19
YearRankTypeTitle / Venue / Authors
2026 J jnl
Algorithms and complexity of strongly stable non-crossing matchings.
Discret. Appl. Math.
Sachin, B. S. Panda
2025 J jnl
On total chromatic number of complete multipartite graphs.
Discret. Appl. Math.
Aseem Dalal, B. S. Panda
2024 J jnl
Injective edge coloring of some standard graph products.
Discret. Math. Algorithms Appl.
B. S. Panda
2024 — conf
On Total Chromatic Number of Complete Multipartite Graphs.
CALDAM
Aseem Dalal, B. S. Panda
2024 J jnl
On the complexity of co-secure dominating set problem.
Inf. Process. Lett.
B. S. Panda, Soumyashree Rana, Sounaka Mishra
2024 J jnl
On the complexity of minimum maximal acyclic matchings.
J. Comb. Optim.
Juhi Chaudhary, Sounaka Mishra, B. S. Panda
2023 J jnl
Acyclic matching in some subclasses of graphs.
Theor. Comput. Sci.
B. S. Panda, Juhi Chaudhary
2023 — conf
Algorithms and Complexity of Strongly Stable Non-crossing Matchings.
CALDAM
B. S. Panda, Sachin
2023 J jnl
Complexity and algorithms for injective edge coloring of graphs.
Theor. Comput. Sci.
Priyamvada, B. S. Panda
2023 J jnl
Hardness results of global roman domination in graphs.
Discret. Appl. Math.
B. S. Panda, Pooja Goyal
2023 J jnl
Identifying Influential Nodes for Smart Enterprises Using Community Structure With Integrated Feature Ranking.
IEEE Trans. Ind. Informatics
Sanjay Kumar, Akshi Kumar, B. S. Panda
2023 J jnl
Influence maximization in social networks using transfer learning via graph-based LSTM.
Expert Syst. Appl.
Sanjay Kumar, Abhishek Mallik, B. S. Panda
2023 — conf
Minimum Maximal Acyclic Matching in Proper Interval Graphs.
CALDAM
Juhi Chaudhary, Sounaka Mishra, B. S. Panda
2022 J jnl
Adjacent vertex distinguishing total coloring in split graphs.
Discret. Math.
Shaily Verma, Hung-Lin Fu, B. S. Panda
2022 J jnl
Complexity and algorithms for neighbor-sum-2-distinguishing {1, 3}-edge-weighting of graphs.
Theor. Comput. Sci.
B. S. Panda, Priyamvada
2022 J jnl
Exact square coloring of certain classes of graphs: Complexity and algorithms.
Theor. Comput. Sci.
Priyamvada, B. S. Panda
2022 J jnl
Exact square coloring of graphs resulting from some graph operations and products.
AKCE Int. J. Graphs Comb.
Priyamvada, B. S. Panda
2022 — conf
Hardness and Approximation Results for Some Variants of Stable Marriage Problem.
CALDAM
B. S. Panda, Sachin
2022 J jnl
Hardness results of global total k-domination problem in graphs.
Discret. Appl. Math.
B. S. Panda, Pooja Goyal
2022 J jnl
Link prediction in complex networks using node centrality and light gradient boosting machine.
World Wide Web
Sanjay Kumar, Abhishek Mallik, B. S. Panda
2022 J jnl
MDER: modified degree with exclusion ratio algorithm for influence maximisation in social networks.
Computing
Sanjay Kumar, Dipti Lohia, Darsh Pratap, Ashutosh Krishna, B. S. Panda
2022 A conf
On Two Variants of Induced Matchings.
ICS
Juhi Chaudhary, B. S. Panda
2022 Misc conf
On the Complexity of Minimum Maximal Acyclic Matchings.
COCOON
Juhi Chaudhary, Sounaka Mishra, B. S. Panda
2021 J jnl
Community detection in complex networks using network embedding and gravitational search algorithm.
J. Intell. Inf. Syst.
Sanjay Kumar, B. S. Panda, Deepanshu Aggarwal
2021 J jnl
Differentiating-total domination: Approximation and hardness results.
Theor. Comput. Sci.
B. S. Panda, Pooja Goyal, Dinabandhu Pradhan
2021 J jnl
Dominating induced matching in some subclasses of bipartite graphs.
Theor. Comput. Sci.
B. S. Panda, Juhi Chaudhary
2021 J jnl
Global total
Theor. Comput. Sci.
B. S. Panda, Pooja Goyal
2021 C conf
Hardness Results of Connected Power Domination for Bipartite Graphs and Chordal Graphs.
COCOA
Pooja Goyal, B. S. Panda
2021 — conf
Hardness Results of Global Roman Domination in Graphs.
CALDAM
B. S. Panda, Pooja Goyal
2021 Misc conf
Hardness and Approximation Results of Roman {3}-Domination in Graphs.
COCOON
Pooja Goyal, B. S. Panda
2021 J jnl
IM-ELPR: Influence maximization in social networks using label propagation based community structure.
Appl. Intell.
Sanjay Kumar, Lakshay Singhla, Kshitij Jindal, Khyati Grover, B. S. Panda
2021 J jnl
Injective coloring of some subclasses of bipartite graphs and chordal graphs.
Discret. Appl. Math.
B. S. Panda, Priyamvada
2021 J jnl
Modeling information diffusion in online social networks using a modified forest-fire model.
J. Intell. Inf. Syst.
Sanjay Kumar, Muskan Saini, Muskan Goel, B. S. Panda
2020 C conf
Acyclic Matching in Some Subclasses of Graphs.
IWOCA
B. S. Panda, Juhi Chaudhary
2020 J jnl
Grundy coloring in some subclasses of bipartite graphs and their complements.
Inf. Process. Lett.
Shaily Verma, B. S. Panda
2020 — conf
Hardness Results of Global Total k-Domination Problem in Graphs.
CALDAM
B. S. Panda, Pooja Goyal
2020 — conf
Identifying Influential Spreaders On a Weighted Network Using HookeRank Method.
ICCS (1)
Sanjay Kumar, Nipun Aggarwal, B. S. Panda
2020 J jnl
Maximum weight induced matching in some subclasses of bipartite graphs.
J. Comb. Optim.
B. S. Panda, Arti Pandey, Juhi Chaudhary, Piyush Dane, Manav Kashyap
2020 C conf
On the Complexity of Minimum Maximal Uniquely Restricted Matching.
COCOA
Juhi Chaudhary, B. S. Panda
2020 J jnl
On the total and AVD-total coloring of graphs.
AKCE Int. J. Graphs Comb.
B. S. Panda, Shaily Verma, Yash Keerti
2019 J jnl
Computing a minimum paired-dominating set in strongly orderable graphs.
Discret. Appl. Math.
Dinabandhu Pradhan, B. S. Panda
2019 — conf
Dominating Induced Matching in Some Subclasses of Bipartite Graphs.
CALDAM
B. S. Panda, Juhi Chaudhary
2019 J jnl
Domination in some subclasses of bipartite graphs.
Discret. Appl. Math.
Arti Pandey, B. S. Panda
2019 J jnl
On partial Grundy coloring of bipartite graphs and chordal graphs.
Discret. Appl. Math.
B. S. Panda, Shaily Verma
2018 J jnl
Algorithmic aspects of b-disjunctive domination in graphs.
J. Comb. Optim.
B. S. Panda, Arti Pandey, Subhabrata Paul
2018 — ed.
Algorithms and Discrete Applied Mathematics - 4th International Conference, CALDAM 2018, Guwahati, India, February 15-17, 2018, Proceedings
CALDAM
B. S. Panda, Partha P. Goswami
2018 B conf
Characterization and Recognition of Tree 3-Spanner Admissible Directed Path Graphs of Diameter Three.
WG
B. S. Panda, Anita Das
2017 J jnl
Algorithmic aspects of open neighborhood location-domination in graphs.
Discret. Appl. Math.
B. S. Panda, Arti Pandey
2017 — conf
Induced Matching in Some Subclasses of Bipartite Graphs.
CALDAM
Arti Pandey, B. S. Panda, Piyush Dane, Manav Kashyap
2017 — conf
New heuristics for strong minimum energy topology with reduced time complexity.
ANTS
B. S. Panda, Bijaya K. Bhatta, Deepak Mishra, Swades De
2017 J jnl
Restrained Domination in Some Subclasses of Chordal Graphs.
Electron. Notes Discret. Math.
Arti Pandey, B. S. Panda
2017 — ed.
Theoretical Computer Science and Discrete Mathematics - First International Conference, ICTCSDM 2016, Krishnankoil, India, December 19-21, 2016, Revised Selected Papers
ICTCSDM
S. Arumugam, Jay S. Bagga, Lowell W. Beineke, B. S. Panda
2016 J jnl
Complexity of total outer-connected domination problem in graphs.
Discret. Appl. Math.
B. S. Panda, Arti Pandey
2016 — conf
On the Complexity of Minimum Cardinality Maximal Uniquely Restricted Matching in Graphs.
ICTCSDM
B. S. Panda, Arti Pandey
2016 — conf
Partial Grundy Coloring in Some Subclasses of Bipartite Graphs and Chordal Graphs.
ICTCSDM
B. S. Panda, Shaily Verma
2016 J jnl
Strong minimum energy hierarchical topology in wireless sensor networks.
J. Comb. Optim.
B. S. Panda, D. Pushparaj Shetty
2016 J jnl
Total-colorings of complete multipartite graphs using amalgamations.
Discret. Math.
Aseem Dalal, B. S. Panda, C. A. Rodger
2016 — conf
b-Disjunctive Total Domination in Graphs: Algorithm and Hardness Results.
CALDAM
Arti Pandey, B. S. Panda
2015 Misc conf
Algorithmic Aspects of Disjunctive Domination in Graphs.
COCOON
B. S. Panda, Arti Pandey, Subhabrata Paul
2015 Misc conf
Boruvka-Incremental Power Greedy Heuristic for Strong Minimum Energy Topology in Wireless Sensor Networks.
ICDCN
B. S. Panda, Bijaya K. Bhatta, Deepak Mishra, Swades De
2015 J jnl
On the dominator coloring in proper interval graphs and block graphs.
Discret. Math. Algorithms Appl.
B. S. Panda, Arti Pandey
2015 J jnl
Strong minimum energy 2-hop rooted topology for hierarchical wireless sensor networks.
J. Comb. Optim.
B. S. Panda, D. Pushparaj Shetty
2014 B conf
Algorithm and Hardness Results for Outer-connected Dominating Set in Graphs.
WALCOM
B. S. Panda, Arti Pandey
2014 J jnl
Hardness results and approximation algorithm for total liar's domination in graphs.
J. Comb. Optim.
B. S. Panda, Subhabrata Paul
2013 J jnl
A linear time algorithm for computing a minimum paired-dominating set of a convex bipartite graph.
Discret. Appl. Math.
B. S. Panda, Dinabandhu Pradhan
2013 J jnl
A linear time algorithm for liar's domination problem in proper interval graphs.
Inf. Process. Lett.
B. S. Panda, Subhabrata Paul
2013 J jnl
Connected Liar's domination in graphs: Complexity and Algorithms.
Discret. Math. Algorithms Appl.
B. S. Panda, Subhabrata Paul
2013 J jnl
Liar's domination in graphs: Complexity and algorithm.
Discret. Appl. Math.
B. S. Panda, Subhabrata Paul
2013 J jnl
Minimum interference strong bidirectional topology for wireless sensor networks.
Int. J. Ad Hoc Ubiquitous Comput.
B. S. Panda, D. Pushparaj Shetty
2013 J jnl
Minimum paired-dominating set in chordal bipartite graphs and perfect elimination bipartite graphs.
J. Comb. Optim.
B. S. Panda, Dinabandhu Pradhan
2012 J jnl
Acyclic Matchings in Subclasses of bipartite Graphs.
Discret. Math. Algorithms Appl.
B. S. Panda, Dinabandhu Pradhan
2012 J jnl
Complexity of distance paired-domination problem in graphs.
Theor. Comput. Sci.
Gerard J. Chang, B. S. Panda, Dinabandhu Pradhan
2012 J jnl
L(2,1)-labeling of dually chordal graphs and strongly orderable graphs.
Inf. Process. Lett.
B. S. Panda, Preeti Goel
2011 Misc conf
An Incremental Power Greedy Heuristic for Strong Minimum Energy Topology in Wireless Sensor Networks.
ICDCIT
B. S. Panda, D. Pushparaj Shetty
2011 J jnl
L(2, 1)-labeling of perfect elimination bipartite graphs.
Discret. Appl. Math.
B. S. Panda, Preeti Goel
2011 — conf
Strong Minimum Interference Topology for Wireless Sensor Networks.
ADCONS
B. S. Panda, D. Pushparaj Shetty
2010 — conf
Heuristic Algorithms for the
SEMCCO
B. S. Panda, Preeti Goel
2010 J jnl
Locally connected spanning trees in cographs, complements of bipartite graphs and doubly chordal graphs.
Inf. Process. Lett.
B. S. Panda, Dinabandhu Pradhan
2010 J jnl
Tree 3-spanners in 2-sep chordal graphs: Characterization and algorithms.
Discret. Appl. Math.
B. S. Panda, Anita Das
2009 J jnl
A parallel algorithm for generating bicompatible elimination orderings of proper interval graphs.
Inf. Process. Lett.
B. S. Panda, Sajal K. Das
2009 J jnl
Tree 3-spanners in 2-sep directed path graphs: Characterization, recognition, and construction.
Discret. Appl. Math.
B. S. Panda, Anita Das
2008 J jnl
NP-Completeness of Hamiltonian Cycle Problem on Rooted Directed Path Graphs
CoRR
B. S. Panda, Dinabandhu Pradhan
2007 J jnl
On tree 3-spanners in directed path graphs.
Networks
B. S. Panda, Anita Das
2006 — conf
A linear time algorithm for constructing tree 3-spanner in simple chordal bipartite graphs.
ICIT
Anita Das, B. S. Panda, Rajendra P. Lal
2005 J jnl
Parallel recognition algorithms for chordal_planar graphs and planar
J. Parallel Distributed Comput.
B. S. Panda, Sajal K. Das
2004 C conf
A Linear Time Algorithm for Constructing Tree 4-Spanner in 2-Trees.
CIT
B. S. Panda, Anita Das
2004 — conf
Optimal Schemes for Channel Assignment Problem in Wireless Networks Modeled as 2-Dimensional Square Grids.
IWDC
B. S. Panda, Mahesh Kumar, Sajal K. Das
2003 J jnl
A linear time recognition algorithm for proper interval graphs.
Inf. Process. Lett.
B. S. Panda, Sajal K. Das
2002 — conf
A Linear Time Algorithm for Finding Tree 3-Spanner on 2-Trees.
IFIP TCS
B. S. Panda, Sajal K. Das
2002 Misc conf
An Efficient Parallel Algorithm for Computing Bicompatible Elimination Ordering (BCO) of Proper Interval Graphs.
HiPC
B. S. Panda, Sajal K. Das
2002 J jnl
Parallel Algorithms for Hamiltonian 2-Separator Chordal Graphs.
Parallel Process. Lett.
B. S. Panda, Vijay Natarajan, Sajal K. Das
2002 — conf
Performance Evaluation of a Two Level Error Recovery Scheme for Distributed Systems.
IWDC
B. S. Panda, Sajal K. Das
2001 Misc conf
An Efficient Algorithm for Computing Lower Bounds on Time and Processors for Scheduling Precedence Graphs on Multicomputer Systems.
HiPC
B. S. Panda, Sajal K. Das
2001 A conf
Parallel Algortithms for Hamiltonian 2-Separator Chordal Graphs.
IPDPS
B. S. Panda, Vijay Natarajan, Sajal K. Das
2001 J jnl
The Separator Theorem for Rooted Directed Vertex Graphs.
J. Comb. Theory B
B. S. Panda
1999 J jnl
The forbidden subgraph characterization of directed vertex graphs.
Discret. Math.
B. S. Panda
1996 J jnl
New Linear Time Algorithms for Generating Perfect Elimination Orderings of Chordal Graphs.
Inf. Process. Lett.
B. S. Panda
1995 J jnl
Intersection graphs of vertex disjoint paths in a tree.
Discret. Math.
B. S. Panda, Shreedhara Prasada Mohanty
1994 J jnl
Recognition Algorithm for Intersection Graphs of Edge Disjoint Paths in a Tree.
Inf. Process. Lett.
B. S. Panda, Shreedhara Prasada Mohanty