| Algorithmic aspects of semitotal domination in graphs MA Henning, A Pandey Theoretical Computer Science 766, 46-57, 2019 | 37 | 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 | 27 | 2014 |
| Algorithmic aspects of b-disjunctive domination in graphs BS Panda, A Pandey, S Paul Journal of Combinatorial Optimization 36, 572-590, 2018 | 20 | 2018 |
| Domination in some subclasses of bipartite graphs A Pandey, BS Panda Discrete Applied Mathematics 252, 51-66, 2019 | 18 | 2019 |
| Maximum weight induced matching in some subclasses of bipartite graphs BS Panda, A Pandey, J Chaudhary, P Dane, M Kashyap Journal of Combinatorial Optimization 40 (3), 713-732, 2020 | 15 | 2020 |
| Maximum weighted edge biclique problem on bipartite graphs A Pandey, G Sharma, N Jain Conference on Algorithms and Discrete Applied Mathematics, 116-128, 2020 | 11 | 2020 |
| Complexity of paired domination in AT-free and planar graphs V Tripathi, T Kloks, A Pandey, K Paul, HL Wang Theoretical Computer Science 930, 53-62, 2022 | 9 | 2022 |
| On the dominator coloring in proper interval graphs and block graphs BS Panda, A Pandey Discrete Mathematics, Algorithms and Applications 7 (04), 1550043, 2015 | 9 | 2015 |
| Complexity and algorithms for semipaired domination in graphs MA Henning, A Pandey, V Tripathi Theory of Computing Systems 64 (7), 1225-1241, 2020 | 8 | 2020 |
| Algorithmic aspects of open neighborhood location–domination in graphs BS Panda, A Pandey Discrete Applied Mathematics 216, 290-306, 2017 | 8 | 2017 |
| Open neighborhood locating-dominating set in graphs: complexity and algorithms A Pandey 2015 International Conference on Information Technology (ICIT), 1-6, 2015 | 8 | 2015 |
| Domination in some subclasses of bipartite graphs A Pandey, BS Panda Algorithms and Discrete Applied Mathematics: First International Conference …, 2015 | 7 | 2015 |
| Open Neighborhood Locating-Dominating Set in Graphs: Complexity and Algorithms, IEEE A Pandey 2015 International Conference on Information Technology (ICIT), 0 | 7 | |
| Induced matching in some subclasses of bipartite graphs A Pandey, BS Panda, P Dane, M Kashyap Conference on algorithms and discrete applied mathematics, 308-319, 2017 | 6 | 2017 |
| Algorithmic aspects of disjunctive domination in graphs BS Panda, A Pandey, S Paul Computing and Combinatorics: 21st International Conference, COCOON 2015 …, 2015 | 6 | 2015 |
| On the complexity of minimum cardinality maximal uniquely restricted matching in graphs BS Panda, A Pandey Theoretical Computer Science and Discrete Mathematics: First International …, 2017 | 5 | 2017 |
| Complexity of total outer-connected domination problem in graphs BS Panda, A Pandey Discrete Applied Mathematics 199, 110-122, 2016 | 4 | 2016 |
| Some algorithmic results for eternal vertex cover problem in graphs K Paul, A Pandey International Conference and Workshops on Algorithms and Computation, 242-253, 2023 | 3 | 2023 |
| Complexity Results on Cosecure Domination in Graphs Kusum, A Pandey Algorithms and Discrete Applied Mathematics: 9th International Conference …, 2023 | 3 | 2023 |
| Restrained domination in some subclasses of chordal graphs A Pandey, BS Panda Electronic Notes in Discrete Mathematics 63, 203-210, 2017 | 3 | 2017 |
