| Influence maximization in social networks using graph embedding and graph neural network S Kumar, A Mallik, A Khetarpal, BS Panda Information Sciences 607, 1617-1636, 2022 | 147 | 2022 |
| Identifying influential nodes in Social Networks: Neighborhood Coreness based voting approach S Kumar, BS Panda Physica A: Statistical Mechanics and its Applications 553, 124215, 2020 | 87 | 2020 |
| A linear time recognition algorithm for proper interval graphs BS Panda, SK Das Information Processing Letters 87 (3), 153-161, 2003 | 83 | 2003 |
| Influence maximization in social networks using transfer learning via graph-based LSTM S Kumar, A Mallik, BS Panda Expert Systems with Applications 212, 118770, 2023 | 63 | 2023 |
| Link prediction in complex networks using node centrality and light gradient boosting machine S Kumar, A Mallik, BS Panda World Wide Web 25 (6), 2487-2513, 2022 | 57 | 2022 |
| IM-ELPR: Influence maximization in social networks using label propagation based community structure S Kumar, L Singhla, K Jindal, K Grover, BS Panda Applied Intelligence 51 (11), 7647-7665, 2021 | 55 | 2021 |
| Modeling information diffusion in online social networks using a modified forest-fire model S Kumar, M Saini, M Goel, BS Panda Journal of intelligent information systems 56 (2), 355-377, 2021 | 49 | 2021 |
| Community detection in complex networks using network embedding and gravitational search algorithm S Kumar, BS Panda, D Aggarwal Journal of Intelligent Information Systems 57 (1), 51-72, 2021 | 45 | 2021 |
| The forbidden subgraph characterization of directed vertex graphs BS Panda Discrete Mathematics 196 (1-3), 239-256, 1999 | 31 | 1999 |
| MDER: modified degree with exclusion ratio algorithm for influence maximisation in social networks S Kumar, D Lohia, D Pratap, A Krishna, BS Panda Computing 104 (2), 359-382, 2022 | 30 | 2022 |
| Domination in some subclasses of bipartite graphs A Pandey, BS Panda Discrete Applied Mathematics 252, 51-66, 2019 | 29* | 2019 |
| Algorithm and hardness results for outer-connected dominating set in graphs BS Panda, A Pandey International Workshop on Algorithms and Computation, 151-162, 2014 | 28 | 2014 |
| Algorithmic aspects of b-disjunctive domination in graphs BS Panda, A Pandey, S Paul Journal of Combinatorial Optimization 36, 572-590, 2018 | 27 | 2018 |
| Minimum paired-dominating set in chordal bipartite graphs and perfect elimination bipartite graphs BS Panda, D Pradhan Journal of Combinatorial Optimization 26 (4), 770-785, 2013 | 27 | 2013 |
| Liar’s domination in graphs: Complexity and algorithm BS Panda, S Paul Discrete Applied Mathematics 161 (7-8), 1085-1092, 2013 | 26 | 2013 |
| Identifying influential nodes for smart enterprises using community structure with integrated feature ranking S Kumar, A Kumar, BS Panda IEEE Transactions on Industrial Informatics 19 (1), 703-711, 2022 | 21 | 2022 |
| A linear time algorithm for liarʼs domination problem in proper interval graphs BS Panda, S Paul Information Processing Letters 113 (19-21), 815-822, 2013 | 21 | 2013 |
| New linear time algorithms for generating perfect elimination orderings of chordal graphs BS Panda Information processing letters 58 (3), 111-115, 1996 | 20 | 1996 |
| Hardness results of global total k-domination problem in graphs BS Panda, P Goyal Discrete Applied Mathematics 319, 223-238, 2022 | 17 | 2022 |
| Injective coloring of some subclasses of bipartite graphs and chordal graphs BS Panda Discrete Applied Mathematics 291, 68-87, 2021 | 16 | 2021 |
Sanjay Kumar, PhDDept. of Computer Science and Engineering, Delhi Technological UniversityZweryfikowany adres z dtu.ac.in