| An algorithm for the maximum weight independent set problem on outerstring graphs. JM Keil, JSB Mitchell, D Pradhan, M Vatshelle Computational Geometry 60, 19--25, 2017 | 44 | 2017 |
| An algorithm for the maximum weight independent set problem on outerstring graphs JM Keil, JSB Mitchell, D Pradhan, M Vatshelle Computational Geometry 60, 19-25, 2017 | 44 | 2017 |
| Algorithmic aspects of k-tuple total domination in graphs D Pradhan Information Processing Letters 112 (21), 816-822, 2012 | 31 | 2012 |
| 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 |
| On computing a minimum secure dominating set in block graphs D Pradhan, A Jha Journal of Combinatorial Optimization 35 (2), 613-631, 2018 | 21 | 2018 |
| Algorithmic results on double Roman domination in graphs S Banerjee, MA Henning, D Pradhan Journal of Combinatorial Optimization 39 (1), 90-114, 2020 | 20 | 2020 |
| Complexity of certain functional variants of total domination in chordal bipartite graphs D Pradhan Discrete Mathematics, Algorithms and Applications 4 (03), 1250045, 2012 | 20 | 2012 |
| Computing a minimum outer-connected dominating set for the class of chordal graphs JM Keil, D Pradhan Information Processing Letters 113 (14-16), 552-561, 2013 | 19 | 2013 |
| Perfect Roman domination in graphs S Banerjee, JM Keil, D Pradhan Theoretical Computer Science 796, 1-21, 2019 | 18 | 2019 |
| Acyclic matchings in subclasses of bipartite graphs BS Panda, D Pradhan Discrete Mathematics, Algorithms and Applications 4 (04), 1250050, 2012 | 15 | 2012 |
| 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 |
| Borodin–Kostochka’s conjecture on -free graphs UK Gupta, D Pradhan Journal of Applied Mathematics and Computing 65 (1), 877-884, 2021 | 13 | 2021 |
| Algorithmic aspects of upper paired-domination in graphs MA Henning, D Pradhan Theoretical Computer Science 804, 98-114, 2020 | 13 | 2020 |
| Algorithm and hardness results on hop domination in graphs MA Henning, S Pal, D Pradhan Information Processing Letters 153, 105872, 2020 | 13 | 2020 |
| The secure domination problem in cographs A Jha, D Pradhan, S Banerjee Information Processing Letters 145, 30-38, 2019 | 13 | 2019 |
| A linear time algorithm to compute a minimum restrained dominating set in proper interval graphs BS Panda, D Pradhan Discrete Mathematics, Algorithms and Applications 7 (2), 1550020, 2015 | 11 | 2015 |
| A linear time algorithm for computing a minimum paired-dominating set of a convex bipartite graph BS Panda, D Pradhan Discrete Applied Mathematics 161 (12), 1776-1783, 2013 | 11 | 2013 |
| On the coalition number of trees D Bakhshesh, MA Henning, D Pradhan Bulletin of the Malaysian Mathematical Sciences Society 46 (3), 95, 2023 | 10 | 2023 |
| Computing a minimum paired-dominating set in strongly orderable graphs D Pradhan, BS Panda Discrete Applied Mathematics 253, 37-50, 2019 | 10 | 2019 |
| Double vertex-edge domination in graphs: complexity and algorithms HN Kumar, D Pradhan, YB Venkatakrishnan Journal of Applied Mathematics and Computing 66, 245-262, 2021 | 8 | 2021 |
Bhawani Panda, B S PandaIIT DelhiVerified email at maths.iitd.ac.in
