B. S. Panda

From MaRDI portal
Person:271640

Available identifiers

zbMath Open panda.bhawani-sankarMaRDI QIDQ271640

List of research outcomes





PublicationDate of PublicationType
Injective coloring of subclasses of chordal graphs2024-12-12Paper
Minimum maximal acyclic matching in proper interval graphs2024-12-04Paper
Injective edge coloring of some standard graph products2024-11-13Paper
Total colorings of complete multipartite graphs using amalgamations2024-11-06Paper
On the complexity of minimum maximal acyclic matchings2024-10-21Paper
Hardness results of connected power domination for bipartite graphs and chordal graphs2024-09-24Paper
On total chromatic number of complete multipartite graphs2024-05-31Paper
On the complexity of co-secure dominating set problem2024-03-13Paper
Hardness results of global Roman domination in graphs2023-11-13Paper
Algorithms and complexity of strongly stable non-crossing matchings2023-08-17Paper
Minimum maximal acyclic matching in proper interval graphs2023-08-17Paper
On the complexity of minimum maximal acyclic matchings2023-08-10Paper
Complexity and algorithms for injective edge coloring of graphs2023-07-21Paper
Exact square coloring of graphs resulting from some graph operations and products2023-06-01Paper
Hardness and approximation results for some variants of stable marriage problem2023-05-08Paper
Hardness and approximation results of Roman \{3\}-domination in graphs2023-03-30Paper
On the complexity of minimum maximal uniquely restricted matching2023-03-21Paper
Acyclic matching in some subclasses of graphs2023-01-05Paper
Acyclic Matching in Some Subclasses of Graphs2022-10-13Paper
Exact square coloring of certain classes of graphs: complexity and algorithms2022-09-16Paper
Adjacent vertex distinguishing total coloring in split graphs2022-08-24Paper
Hardness results of global total \(k\)-domination problem in graphs2022-08-04Paper
Hardness results of connected power domination for bipartite graphs and chordal graphs2022-06-29Paper
Hardness results of global Roman domination in graphs2022-03-24Paper
Complexity and algorithms for neighbor-sum-2-distinguishing \(\{1,3\}\)-edge-weighting of graphs2022-02-21Paper
Dominating induced matching in some subclasses of bipartite graphs2021-09-06Paper
On the total and AVD-total coloring of graphs2021-09-01Paper
On the complexity of minimum maximal uniquely restricted matching2021-08-11Paper
Maximum weight induced matching in some subclasses of bipartite graphs2021-05-03Paper
Injective coloring of some subclasses of bipartite graphs and chordal graphs2021-03-25Paper
Global total \(k\)-domination: approximation and hardness results2020-12-16Paper
Grundy coloring in some subclasses of bipartite graphs and their complements2020-10-07Paper
Hardness results of global total \(k\)-domination problem in graphs2020-07-21Paper
On partial Grundy coloring of bipartite graphs and chordal graphs2019-11-27Paper
Dominating induced matching in some subclasses of bipartite graphs2019-10-10Paper
Domination in some subclasses of bipartite graphs2018-12-10Paper
Characterization and recognition of tree 3-spanner admissible directed path graphs of diameter three2018-11-22Paper
Algorithmic aspects of \(b\)-disjunctive domination in graphs2018-07-20Paper
Restrained domination in some subclasses of chordal graphs2018-04-10Paper
On the complexity of minimum cardinality maximal uniquely restricted matching in graphs2017-12-01Paper
Partial Grundy coloring in some subclasses of bipartite graphs and chordal graphs2017-12-01Paper
Induced Matching in Some Subclasses of Bipartite Graphs2017-04-07Paper
Algorithmic aspects of open neighborhood location-domination in graphs2016-11-24Paper
Strong minimum energy hierarchical topology in wireless sensor networks2016-10-20Paper
\(L(2,1)\)-labeling of block graphs.2016-05-04Paper
Total-colorings of complete multipartite graphs using amalgamations2016-04-07Paper
B-disjunctive total domination in graphs: algorithm and hardness results2016-03-23Paper
On the dominator coloring in proper interval graphs and block graphs2016-02-22Paper
Complexity of total outer-connected domination problem in graphs2015-12-10Paper
Strong minimum energy \(2\)-hop rooted topology for hierarchical wireless sensor networks2015-11-03Paper
Algorithmic aspects of disjunctive domination in graphs2015-10-29Paper
https://portal.mardi4nfdi.de/entity/Q55003042015-08-05Paper
Domination in some subclasses of bipartite graphs2015-02-19Paper
Separator theorems for interval graphs and proper interval graphs2015-02-19Paper
Algorithm and Hardness Results for Outer-connected Dominating Set in Graphs2015-01-15Paper
Hardness results and approximation algorithm for total liar's domination in graphs2014-06-24Paper
A linear time algorithm for liar's domination problem in proper interval graphs2014-04-14Paper
Algorithm and hardness results for outer-connected dominating set in graphs2014-02-18Paper
Connected liar's domination in graphs: complexity and algorithms2014-01-28Paper
Minimum paired-dominating set in chordal bipartite graphs and perfect elimination bipartite graphs2013-12-09Paper
Network lifetime maximising distributed forwarding strategies in ad hoc wireless sensor networks2013-10-18Paper
Liar's domination in graphs: complexity and algorithm2013-04-25Paper
\(L(2,1)\)-labeling of dually chordal graphs and strongly orderable graphs2012-07-25Paper
\(L(2,1)\)-labeling of perfect elimination bipartite graphs2011-10-27Paper
\(L(2,1)\)-labeling of graphs: known results and open problems2011-10-05Paper
Tree 3-spanners in 2-sep chordal graphs: characterization and algorithms2010-11-25Paper
A parallel algorithm for generating bicompatible elimination orderings of proper interval graphs2010-08-20Paper
Tree 3-spanners in 2-sep directed path graphs: Characterization, recognition, and construction2009-06-24Paper
A linear time recognition algorithm for proper interval graphs2009-04-28Paper
On tree 3‐spanners in directed path graphs2008-01-07Paper
Tree 3-Spanner in 2-sep Chordal Graphs: Characterization, Recognition, and Construction.2007-05-29Paper
Distributed Computing - IWDC 20042005-08-12Paper
Parallel recognition algorithms for chordal-planar graphs and planar \(k\)-trees2005-08-01Paper
https://portal.mardi4nfdi.de/entity/Q44739112004-08-04Paper
https://portal.mardi4nfdi.de/entity/Q44174782003-07-29Paper
https://portal.mardi4nfdi.de/entity/Q44145672003-07-25Paper
The separator theorem for rooted directed vertex graphs2002-12-10Paper
The forbidden subgraph characterization of directed vertex graphs2000-01-09Paper
https://portal.mardi4nfdi.de/entity/Q42481781999-11-10Paper
New linear time algorithms for generating perfect elimination orderings of chordal graphs1997-02-27Paper
Intersection graphs of vertex disjoint paths in a tree1996-04-23Paper
Recognition algorithm for intersection graphs of edge disjoint paths in a tree1994-04-05Paper

Research outcomes over time

This page was built for person: B. S. Panda