The following pages link to B. S. Panda (Q271640):
Displaying 50 items.
- Total-colorings of complete multipartite graphs using amalgamations (Q271641) (← links)
- Strong minimum energy hierarchical topology in wireless sensor networks (Q328707) (← links)
- Algorithmic aspects of open neighborhood location-domination in graphs (Q344871) (← links)
- \(L(2,1)\)-labeling of dually chordal graphs and strongly orderable graphs (Q436601) (← links)
- Tree 3-spanners in 2-sep chordal graphs: characterization and algorithms (Q608275) (← links)
- \(L(2,1)\)-labeling of perfect elimination bipartite graphs (Q643028) (← links)
- Algorithmic aspects of \(b\)-disjunctive domination in graphs (Q721940) (← links)
- Hardness results of global Roman domination in graphs (Q831760) (← links)
- Strong minimum energy \(2\)-hop rooted topology for hierarchical wireless sensor networks (Q887852) (← links)
- Complexity of total outer-connected domination problem in graphs (Q896660) (← links)
- A parallel algorithm for generating bicompatible elimination orderings of proper interval graphs (Q989571) (← links)
- A linear time recognition algorithm for proper interval graphs (Q1014413) (← links)
- Tree 3-spanners in 2-sep directed path graphs: Characterization, recognition, and construction (Q1026118) (← links)
- The forbidden subgraph characterization of directed vertex graphs (Q1297413) (← links)
- Recognition algorithm for intersection graphs of edge disjoint paths in a tree (Q1318763) (← links)
- New linear time algorithms for generating perfect elimination orderings of chordal graphs (Q1350607) (← links)
- Characterization and recognition of tree 3-spanner admissible directed path graphs of diameter three (Q1627193) (← links)
- Domination in some subclasses of bipartite graphs (Q1630774) (← links)
- On the complexity of minimum cardinality maximal uniquely restricted matching in graphs (Q1683558) (← links)
- Partial Grundy coloring in some subclasses of bipartite graphs and chordal graphs (Q1683560) (← links)
- The separator theorem for rooted directed vertex graphs (Q1850517) (← links)
- Intersection graphs of vertex disjoint paths in a tree (Q1903730) (← links)
- Liar's domination in graphs: complexity and algorithm (Q1949115) (← links)
- On partial Grundy coloring of bipartite graphs and chordal graphs (Q2009016) (← links)
- Hardness results and approximation algorithm for total liar's domination in graphs (Q2015803) (← links)
- Maximum weight induced matching in some subclasses of bipartite graphs (Q2023124) (← links)
- Complexity and algorithms for neighbor-sum-2-distinguishing \(\{1,3\}\)-edge-weighting of graphs (Q2077391) (← links)
- Hardness results of connected power domination for bipartite graphs and chordal graphs (Q2150586) (← links)
- Adjacent vertex distinguishing total coloring in split graphs (Q2166305) (← links)
- Exact square coloring of certain classes of graphs: complexity and algorithms (Q2172606) (← links)
- Grundy coloring in some subclasses of bipartite graphs and their complements (Q2203596) (← links)
- Global total \(k\)-domination: approximation and hardness results (Q2216425) (← links)
- Restrained domination in some subclasses of chordal graphs (Q2413358) (← links)
- A linear time algorithm for liar's domination problem in proper interval graphs (Q2445259) (← links)
- Parallel recognition algorithms for chordal-planar graphs and planar \(k\)-trees (Q2484297) (← links)
- Injective coloring of some subclasses of bipartite graphs and chordal graphs (Q2659063) (← links)
- Acyclic matching in some subclasses of graphs (Q2680984) (← links)
- Hardness and approximation results of Roman \{3\}-domination in graphs (Q2695277) (← links)
- On the dominator coloring in proper interval graphs and block graphs (Q2788718) (← links)
- b-Disjunctive Total Domination in Graphs: Algorithm and Hardness Results (Q2795954) (← links)
- (Q2804782) (← links)
- CONNECTED LIAR'S DOMINATION IN GRAPHS: COMPLEXITY AND ALGORITHMS (Q2874035) (← links)
- Algorithm and Hardness Results for Outer-connected Dominating Set in Graphs (Q2938747) (← links)
- Induced Matching in Some Subclasses of Bipartite Graphs (Q2971661) (← links)
- (Q3172286) (← links)
- Algorithmic Aspects of Disjunctive Domination in Graphs (Q3196396) (← links)
- Tree 3-Spanner in 2-sep Chordal Graphs: Characterization, Recognition, and Construction. (Q3439541) (← links)
- (Q4248178) (← links)
- (Q4414567) (← links)
- (Q4417478) (← links)
