B. S. Panda - Citegraph

Author Info

Name	Affiliation	Papers
B. S. PANDA	Computer Science and Application Group, Department of Mathematics, Indian Institute of Technology Delhi, Hauz Khas, New Delhi, India	54
Collaborators	Citations	PageRank
42	99	21.18
Referers	Referees	References
152	427	465

Search Limit

100427

Publications (54 rows)

Collaborators (42 rows)

Referers (100 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
Hardness results of global total k-domination problem in graphs	0	0.34	2022
Influence maximization in social networks using graph embedding and graph neural network	0	0.34	2022
Exact square coloring of certain classes of graphs: Complexity and algorithms	0	0.34	2022
Global Total K-Domination: Approximation And Hardness Results	0	0.34	2021
Community Detection In Complex Networks Using Network Embedding And Gravitational Search Algorithm	2	0.37	2021
On the Complexity of Minimum Maximal Uniquely Restricted Matching.	0	0.34	2020
Grundy coloring in some subclasses of bipartite graphs and their complements	0	0.34	2020
Maximum weight induced matching in some subclasses of bipartite graphs	1	0.35	2020
On The Total And Avd-Total Coloring Of Graphs	0	0.34	2020
Computing a minimum paired-dominating set in strongly orderable graphs.	1	0.35	2019
Dominating Induced Matching In Some Subclasses Of Bipartite Graphs	0	0.34	2019
On partial Grundy coloring of bipartite graphs and chordal graphs	0	0.34	2019
Characterization and Recognition of Tree 3-Spanner Admissible Directed Path Graphs of Diameter Three.	0	0.34	2018
Algorithmic aspects of b-disjunctive domination in graphs	0	0.34	2018
Algorithmic aspects of open neighborhood location–domination in graphs	0	0.34	2017
Restrained Domination in Some Subclasses of Chordal Graphs	0	0.34	2017
Improved Energy-Efficient Target Coverage In Wireless Sensor Networks	0	0.34	2017
New heuristics for strong minimum energy topology with reduced time complexity	0	0.34	2017
Total-colorings of complete multipartite graphs using amalgamations.	0	0.34	2016
Complexity of total outer-connected domination problem in graphs.	0	0.34	2016
On the Complexity of Minimum Cardinality Maximal Uniquely Restricted Matching in Graphs.	0	0.34	2016
Partial Grundy Coloring in Some Subclasses of Bipartite Graphs and Chordal Graphs.	0	0.34	2016
Strong minimum energy hierarchical topology in wireless sensor networks	0	0.34	2016
Boruvka-Incremental Power Greedy Heuristic for Strong Minimum Energy Topology in Wireless Sensor Networks	2	0.38	2015
Strong minimum energy $$2$$2-hop rooted topology for hierarchical wireless sensor networks	2	0.36	2015
Hardness results and approximation algorithm for total liar's domination in graphs	2	0.43	2014
Minimum interference strong bidirectional topology for wireless sensor networks	1	0.34	2013
Minimum paired-dominating set in chordal bipartite graphs and perfect elimination bipartite graphs	5	0.41	2013
A linear time algorithm for computing a minimum paired-dominating set of a convex bipartite graph	2	0.38	2013
Liar's domination in graphs: Complexity and algorithm	4	0.49	2013
A linear time algorithm for liar's domination problem in proper interval graphs	6	0.55	2013
Connected Liar'S Domination In Graphs: Complexity And Algorithms	1	0.37	2013
L(2,1)-labeling of dually chordal graphs and strongly orderable graphs	3	0.41	2012
Strong minimum energy minimum interference topology in wireless sensor networks	1	0.35	2012
Complexity of distance paired-domination problem in graphs	4	0.44	2012
Acyclic Matchings In Subclasses Of Bipartite Graphs	1	0.35	2012
Strong minimum interference topology for wireless sensor networks	2	0.38	2011
An incremental power greedy heuristic for strong minimum energy topology in wireless sensor networks	7	0.54	2011
L(2,1)-labeling of perfect elimination bipartite graphs	5	0.42	2011
Tree 3-spanners in 2-sep chordal graphs: Characterization and algorithms	2	0.40	2010
Locally connected spanning trees in cographs, complements of bipartite graphs and doubly chordal graphs	2	0.40	2010
Tree 3-spanners in 2-sep directed path graphs: Characterization, recognition, and construction	2	0.39	2009
A parallel algorithm for generating bicompatible elimination orderings of proper interval graphs	4	0.47	2009
NP-Completeness of Hamiltonian Cycle Problem on Rooted Directed Path Graphs	1	0.42	2008
On tree 3-spanners in directed path graphs	3	0.42	2007
A linear time algorithm for constructing tree 3-spanner in simple chordal bipartite graphs	0	0.34	2006
Parallel recognition algorithms for chordal_planar graphs and planar k-trees	1	0.41	2005
Optimal schemes for channel assignment problem in wireless networks modeled as 2-dimensional square grids	2	0.38	2004
A linear time algorithm for constructing tree 4-spanner in 2-trees	1	0.36	2004
A linear time recognition algorithm for proper interval graphs	26	1.29	2003

1
2
50 / page