P Versus NPC: Minimum Steiner Trees in Convex Split Graphs. - A. Mohanapriya; P. Renjith; N. Sadagopan (CALDAM, 2022)

Steiner tree in k-star caterpillar convex bipartite graphs: a dichotomy. - Aneesh D. H; A. Mohanapriya; P. Renjith; N. Sadagopan (J. Comb. Optim., 2022)

Short Cycles Dictate Dichotomy Status of the Steiner Tree Problem on Bisplit Graphs. - A. Mohanapriya; P. Renjith; N. Sadagopan (CALDAM, 2023)

Roman k-Domination: Hardness, Approximation and Parameterized Results. - A. Mohanapriya; P. Renjith; N. Sadagopan (WALCOM, 2023)

On the Parameterized Complexity of Minus Domination. - Sriram Bhyravarapu; Lawqueen Kanesh; A. Mohanapriya; Nidhi Purohit; N. Sadagopan; Saket Saurabh 001 (SOFSEM, 2024)

On convexity in split graphs: complexity of Steiner tree and domination. - A. Mohanapriya; P. Renjith; N. Sadagopan (J. Comb. Optim., 2024)

Budget-feasible egalitarian allocation of conflicting jobs. - Sushmita Gupta; Pallavi Jain 001; A. Mohanapriya; Vikash Tripathi (Auton. Agents Multi Agent Syst., 2025)