Bhawani Sankar Panda
Orcid: 0000-0002-0721-5325Affiliations:
- Indian Institute of Technology Delhi, Department of Mathematics, India
According to our database1,
Bhawani Sankar Panda
authored at least 109 papers
between 1994 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
1995
2000
2005
2010
2015
2020
2025
0
5
10
1
6
6
8
9
3
3
1
2
3
6
2
6
4
1
2
2
1
1
1
1
1
1
1
1
1
1
1
1
2
2
1
1
1
3
3
4
1
1
1
2
2
1
2
3
2
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2025
2024
Hardness Results of Connected Power Domination for Bipartite Graphs and Chordal Graphs.
Int. J. Found. Comput. Sci., September, 2024
J. Comb. Optim., August, 2024
Discret. Math. Algorithms Appl., May, 2024
Inf. Process. Lett., March, 2024
Discuss. Math. Graph Theory, 2024
Discret. Appl. Math., 2024
Proceedings of the Algorithms and Discrete Applied Mathematics, 2024
2023
Discret. Appl. Math., December, 2023
Theor. Comput. Sci., August, 2023
Identifying Influential Nodes for Smart Enterprises Using Community Structure With Integrated Feature Ranking.
IEEE Trans. Ind. Informatics, 2023
Influence maximization in social networks using transfer learning via graph-based LSTM.
Expert Syst. Appl., 2023
Disjoint Dominating and 2-Dominating Sets in Graphs: Hardness and Approximation results.
CoRR, 2023
Proceedings of the Algorithms and Discrete Applied Mathematics, 2023
Proceedings of the Algorithms and Discrete Applied Mathematics, 2023
2022
AKCE Int. J. Graphs Comb., September, 2022
Link prediction in complex networks using node centrality and light gradient boosting machine.
World Wide Web, 2022
Theor. Comput. Sci., 2022
Complexity and algorithms for neighbor-sum-2-distinguishing {1, 3}-edge-weighting of graphs.
Theor. Comput. Sci., 2022
Influence maximization in social networks using graph embedding and graph neural network.
Inf. Sci., 2022
Discret. Appl. Math., 2022
MDER: modified degree with exclusion ratio algorithm for influence maximisation in social networks.
Computing, 2022
Proceedings of the New Trends in Computer Technologies and Applications, 2022
Proceedings of the Algorithms and Discrete Applied Mathematics, 2022
2021
Theor. Comput. Sci., 2021
Theor. Comput. Sci., 2021
Theor. Comput. Sci., 2021
Theor. Comput. Sci., 2021
Modeling information diffusion in online social networks using a modified forest-fire model.
J. Intell. Inf. Syst., 2021
Community detection in complex networks using network embedding and gravitational search algorithm.
J. Intell. Inf. Syst., 2021
Discret. Appl. Math., 2021
IM-ELPR: Influence maximization in social networks using label propagation based community structure.
Appl. Intell., 2021
Proceedings of the Computing and Combinatorics - 27th International Conference, 2021
2020
J. Comb. Optim., 2020
Inf. Process. Lett., 2020
Proceedings of the Computational Science - ICCS 2020, 2020
2019
Discret. Appl. Math., 2019
Discret. Appl. Math., 2019
2018
Characterization and Recognition of Tree 3-Spanner Admissible Directed Path Graphs of Diameter Three.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2018
2017
Electron. Notes Discret. Math., 2017
Discret. Appl. Math., 2017
Proceedings of the Computational Science and Its Applications - ICCSA 2017, 2017
Proceedings of the Algorithms and Discrete Applied Mathematics, 2017
Proceedings of the 2017 IEEE International Conference on Advanced Networks and Telecommunications Systems, 2017
2016
J. Comb. Optim., 2016
Discret. Appl. Math., 2016
Proceedings of the Theoretical Computer Science and Discrete Mathematics, 2016
On the Complexity of Minimum Cardinality Maximal Uniquely Restricted Matching in Graphs.
Proceedings of the Theoretical Computer Science and Discrete Mathematics, 2016
Proceedings of the Algorithms and Discrete Applied Mathematics, 2016
2015
Hardness results, approximation and exact algorithms for liar's domination problem in graphs.
Theor. Comput. Sci., 2015
Strong minimum energy 2-hop rooted topology for hierarchical wireless sensor networks.
J. Comb. Optim., 2015
Discret. Math. Algorithms Appl., 2015
A linear time algorithm to compute a minimum restrained dominating set in proper interval graphs.
Discret. Math. Algorithms Appl., 2015
L(2, 1)-labeling of Block Graphs.
Ars Comb., 2015
Boruvka-Incremental Power Greedy Heuristic for Strong Minimum Energy Topology in Wireless Sensor Networks.
Proceedings of the 2015 International Conference on Distributed Computing and Networking, 2015
Proceedings of the Distributed Computing and Internet Technology, 2015
Proceedings of the Computing and Combinatorics - 21st International Conference, 2015
Proceedings of the Algorithms and Discrete Applied Mathematics, 2015
2014
J. Graph Algorithms Appl., 2014
J. Comb. Optim., 2014
Proceedings of the Distributed Computing and Internet Technology, 2014
2013
Minimum paired-dominating set in chordal bipartite graphs and perfect elimination bipartite graphs.
J. Comb. Optim., 2013
Inf. Process. Lett., 2013
Int. J. Ad Hoc Ubiquitous Comput., 2013
Discret. Math. Algorithms Appl., 2013
A linear time algorithm for computing a minimum paired-dominating set of a convex bipartite graph.
Discret. Appl. Math., 2013
A Local Search Based Approximation Algorithm for Strong Minimum Energy Topology Problem in Wireless Sensor Networks.
Proceedings of the Distributed Computing and Internet Technology, 2013
2012
Theor. Comput. Sci., 2012
Inf. Process. Lett., 2012
Network lifetime maximising distributed forwarding strategies in ad hoc wireless sensor networks.
IET Commun., 2012
Discret. Math. Algorithms Appl., 2012
Proceedings of the Distributed Computing and Internet Technology, 2012
2011
An Incremental Power Greedy Heuristic for Strong Minimum Energy Topology in Wireless Sensor Networks.
Proceedings of the Distributed Computing and Internet Technology, 2011
Proceedings of the Advanced Computing, Networking and Security - International Conference, 2011
2010
Locally connected spanning trees in cographs, complements of bipartite graphs and doubly chordal graphs.
Inf. Process. Lett., 2010
Discret. Appl. Math., 2010
Proceedings of the 71st IEEE Vehicular Technology Conference, 2010
Proceedings of the Swarm, Evolutionary, and Memetic Computing, 2010
2009
A parallel algorithm for generating bicompatible elimination orderings of proper interval graphs.
Inf. Process. Lett., 2009
Tree 3-spanners in 2-sep directed path graphs: Characterization, recognition, and construction.
Discret. Appl. Math., 2009
2008
CoRR, 2008
2007
2006
Tree 3-Spanner in 2-sep Chordal Graphs: Characterization, Recognition, and Construction.
Electron. Notes Discret. Math., 2006
A linear time algorithm for constructing tree 3-spanner in simple chordal bipartite graphs.
Proceedings of the 9th International Conference in Information Technology, 2006
2005
J. Parallel Distributed Comput., 2005
2004
Optimal Schemes for Channel Assignment Problem in Wireless Networks Modeled as 2-Dimensional Square Grids.
Proceedings of the Distributed Computing, 2004
Proceedings of the Intelligent Information Technology, 2004
2003
Inf. Process. Lett., 2003
2002
Parallel Process. Lett., 2002
Proceedings of the Distributed Computing, 2002
Proceedings of the Foundations of Information Technology in the Era of Networking and Mobile Computing, 2002
An Efficient Parallel Algorithm for Computing Bicompatible Elimination Ordering (BCO) of Proper Interval Graphs.
Proceedings of the High Performance Computing, 2002
2001
Proceedings of the 15th International Parallel & Distributed Processing Symposium (IPDPS-01), 2001
An Efficient Algorithm for Computing Lower Bounds on Time and Processors for Scheduling Precedence Graphs on Multicomputer Systems.
Proceedings of the High Performance Computing - HiPC 2001, 8th International Conference, 2001
1999
Discret. Math., 1999
1996
New Linear Time Algorithms for Generating Perfect Elimination Orderings of Chordal Graphs.
Inf. Process. Lett., 1996
1995
1994
Inf. Process. Lett., 1994