| 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 | 11 | 2022 |
| 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 | 5 | 2023 |
| Eternal Connected Vertex Cover Problem in Graphs: Complexity and Algorithms K Paul, A Pandey Conference on Algorithms and Discrete Applied Mathematics, 179-193, 2024 | 1 | 2024 |
| Algorithmic results for weak Roman domination problem in graphs K Paul, A Sharma, A Pandey Discrete Applied Mathematics 359, 278-289, 2024 | | 2024 |
| Perfect Italian domination on some generalizations of cographs K Paul, A Pandey Computational and Applied Mathematics 43 (6), 390, 2024 | | 2024 |
| Exploring Algorithmic Solutions for the Independent Roman Domination Problem in Graphs K Paul, A Sharma, A Pandey arXiv preprint arXiv:2407.03831, 2024 | | 2024 |
| Complexity of Total Dominator Coloring in Graphs K Paul, MA Henning | | 2024 |
| Complexity of total dominator coloring in graphs MA Henning, Kusum, A Pandey, K Paul Graphs and Combinatorics 39 (6), 128, 2023 | | 2023 |
| Complexity of Paired Domination in AT-free and Planar Graphs K Paul, T Kloks, H Wang, V Tripathi, A Pandey | | 2022 |
| Complexity of Paired Domination in At-Free and Planar Graphs A Pandey, V Tripathi, T Kloks, K Paul, HL Wang Available at SSRN 4131192, 0 | | |
Arti PandeyIIT Ropar在 iitrpr.ac.in 的电子邮件经过验证
