| Algorithmic aspects of b-disjunctive domination in graphs BS Panda, A Pandey, S Paul Journal of Combinatorial Optimization 36, 572-590, 2018 | 26 | 2018 |
| Liar’s domination in graphs: Complexity and algorithm BS Panda, S Paul Discrete Applied Mathematics 161 (7-8), 1085-1092, 2013 | 26 | 2013 |
| 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 |
| Hardness results, approximation and exact algorithms for liar's domination problem in graphs BS Panda, S Paul, D Pradhan Theoretical Computer Science 573, 26-42, 2015 | 14 | 2015 |
| A direct construction of Golay complementary pairs and binary complete complementary codes of length non-power of two P Kumar, S Majhi, S Paul IEEE Transactions on Communications 71 (3), 1352-1363, 2023 | 11 | 2023 |
| A direct construction of even length ZCPs with large ZCZ ratio P Kumar, P Sarkar, S Majhi, S Paul Cryptography and Communications 15 (1), 85-94, 2023 | 10 | 2023 |
| Hardness results and approximation algorithm for total liar’s domination in graphs BS Panda, S Paul Journal of Combinatorial Optimization 27, 643-662, 2014 | 9 | 2014 |
| On vertex-edge and independent vertex-edge domination S Paul, K Ranjan International Conference on Combinatorial Optimization and Applications, 437-448, 2019 | 8 | 2019 |
| Linear kernels for k-tuple and liar’s domination in bounded genus graphs A Bishnu, A Ghosh, S Paul Discrete Applied Mathematics 231, 67-77, 2017 | 7 | 2017 |
| Uniformity of point samples in metric spaces using gap ratio A Bishnu, S Desai, A Ghosh, M Goswami, S Paul SIAM Journal on Discrete Mathematics 31 (3), 2138-2171, 2017 | 7 | 2017 |
| (1, j)-set problem in graphs A Bishnu, K Dutta, A Ghosh, S Paul Discrete Mathematics 339 (10), 2515-2525, 2016 | 7 | 2016 |
| Connected liar's domination in graphs: complexity and algorithms BS Panda, S Paul Discrete Mathematics, Algorithms and Applications 5 (04), 1350024, 2013 | 6 | 2013 |
| A direct construction of GCP and binary CCC of length non power of two P Kumar, S Majhi, S Paul arXiv preprint arXiv:2109.08567, 2021 | 5 | 2021 |
| Transitivity on subclasses of bipartite graphs S Paul, K Santra Journal of Combinatorial Optimization 45 (1), 27, 2023 | 4 | 2023 |
| Results on vertex-edge and independent vertex-edge domination S Paul, K Ranjan Journal of Combinatorial Optimization 44 (1), 303-330, 2022 | 4 | 2022 |
| Transitivity on subclasses of chordal graphs S Paul, K Santra Conference on Algorithms and Discrete Applied Mathematics, 391-402, 2023 | 3 | 2023 |
| Grid obstacle representation of graphs A Bishnu, A Ghosh, R Mathew, G Mishra, S Paul Discrete Applied Mathematics 296, 39-51, 2021 | 3* | 2021 |
| A direct construction of cross z-complementary sequence sets with large set size P Kumar, S Majhi, S Paul Cryptography and Communications, 1-11, 2024 | 2 | 2024 |
| Direct Construction of CZCS with Flexible Parameters for Channel Estimation in SM-MIMO System P Kumar, S Majhi, S Paul IEEE Communications Letters, 2023 | 2 | 2023 |
| Construction of optimal binary Z-complementary code sets with new lengths using generalized Boolean function G Ghosh, S Majhi, S Paul Cryptography and Communications 15 (5), 979-993, 2023 | 2 | 2023 |
Bhawani Panda, B S PandaIIT Delhi在 maths.iitd.ac.in 的电子邮件经过验证
