A. Mohanapriya

Orcid: 0000-0001-5946-1117

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

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
On convexity in split graphs: complexity of Steiner tree and domination.
J. Comb. Optim., March, 2024

On the Parameterized Complexity of Minus Domination.
Proceedings of the SOFSEM 2024: Theory and Practice of Computer Science, 2024

Budget-feasible Egalitarian Allocation of Conflicting Jobs.
Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems, 2024

2023
Roman k-Domination: Hardness, Approximation and Parameterized Results.
Proceedings of the WALCOM: Algorithms and Computation, 2023

Short Cycles Dictate Dichotomy Status of the Steiner Tree Problem on Bisplit Graphs.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2023

2022
Steiner tree in k-star caterpillar convex bipartite graphs: a dichotomy.
J. Comb. Optim., 2022

P Versus NPC: Minimum Steiner Trees in Convex Split Graphs.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2022


  Loading...