A. Mohanapriya

According to our database, A. Mohanapriya authored at least 7 papers between 2022 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

On convexity in split graphs: complexity of Steiner tree and domination.

A. Mohanapriya, P. Renjith, N. Sadagopan

J. Comb. Optim., March, 2024

Budget-feasible Egalitarian Allocation of Conflicting Jobs.

Sushmita Gupta, Pallavi Jain, A. Mohanapriya, Vikash Tripathi

CoRR, 2024

On the Parameterized Complexity of Minus Domination.

Sriram Bhyravarapu, Lawqueen Kanesh, A. Mohanapriya, Nidhi Purohit, N. Sadagopan, Saket Saurabh

Proceedings of the SOFSEM 2024: Theory and Practice of Computer Science, 2024

2023

Roman k-Domination: Hardness, Approximation and Parameterized Results.

A. Mohanapriya, P. Renjith, N. Sadagopan

Proceedings of the WALCOM: Algorithms and Computation, 2023

Short Cycles Dictate Dichotomy Status of the Steiner Tree Problem on Bisplit Graphs.

A. Mohanapriya, P. Renjith, N. Sadagopan

Proceedings of the Algorithms and Discrete Applied Mathematics, 2023

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

P Versus NPC: Minimum Steiner Trees in Convex Split Graphs.

A. Mohanapriya, P. Renjith, N. Sadagopan

Proceedings of the Algorithms and Discrete Applied Mathematics, 2022