B S Panda

Employment

• Indian Institute of Technology Delhi Dr
  2002 - Present

Education

Education history is unavailable.

Projects & Funding

Projects & funding information is unavailable.

Publications (16)

• Algorithms and complexity of strongly stable non-crossing matchings
  Discrete Applied Mathematics 2026 DOI: 10.1016/j.dam.2025.10.025
  +Save
• Corrigendum to “On the complexity of co-secure dominating set problem” [Inf. Process. Lett. 185 (2024) 106463]
  Information Processing Letters 2026 DOI: 10.1016/j.ipl.2025.106592
  +Save
• Hardness and approximation results for some variants of Stable Marriage problem
  Discrete Applied Mathematics 2025 DOI: 10.1016/j.dam.2025.06.066
  +Save
• Disjoint dominating and 2-dominating sets in graphs: Hardness and approximation results
  Discrete Optimization 2025 DOI: 10.1016/j.disopt.2025.100902
  +Save
• Injective coloring of subclasses of chordal graphs
  Theoretical Computer Science 2025 DOI: 10.1016/j.tcs.2024.114894
  +Save
• On the complexity of co-secure dominating set problem
  Information Processing Letters 2024 DOI: 10.1016/j.ipl.2023.106463
  +Save
• Adjacent vertex distinguishing total coloring of the corona product of graphs
  Discussiones Mathematicae Graph Theory 2024 DOI: 10.7151/dmgt.2445
  +Save
• Hardness results of global roman domination in graphs
  Discrete Applied Mathematics 2023 DOI: 10.1016/j.dam.2023.08.020
  +Save
• Complexity and algorithms for injective edge coloring of graphs
  Theoretical Computer Science 2023 DOI: 10.1016/j.tcs.2023.114010
  +Save
• Hardness Results of Connected Power Domination for Bipartite Graphs and Chordal Graphs
  International Journal of Foundations of Computer Science 2023 DOI: 10.1142/S0129054123410071
  +Save