Skip to content

Author

Renjith Pazhaniappan

1 paper indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Open access Sep 2026

Perfect Italian Domination on Structured Bipartite Graphs: Algorithms, Parameterization, and Hardness

It is proved that the decision problem is NP-complete on star-convex bipartite graphs and the problem parameterized by the target weight is W[1]-hard on the same graph class through a parameter-preserving reduction from Perfect Code.

Renjith Pazhaniappan, Manjusha Mohandas Sathi, M. Malayil · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.