Complexity of Roman {2}-domination and the double Roman domination in graphs. - Chakradhar Padamutham; Venkata Subba Reddy Palagiri (AKCE Int. J. Graphs Comb., 2020)

Algorithmic aspects of Roman domination in graphs. - Chakradhar Padamutham; Venkata Subba Reddy Palagiri (J. Appl. Math. Comput., 2020)

Algorithmic Aspects of Total Roman and Total Double Roman Domination in Graphs. - Chakradhar Padamutham; Venkata Subba Reddy Palagiri (CALDAM, 2021)

Algorithmic aspects of total Roman {3}-domination in graphs. - Chakradhar Padamutham; Venkata Subba Reddy Palagiri (Discret. Math. Algorithms Appl., 2021)

Complexity issues of perfect secure domination in graphs. - Chakradhar Padamutham; P. Venkata Subba Reddy 001 (RAIRO Theor. Informatics Appl., 2021)

Algorithmic complexity of weakly connected Roman domination in graphs. - Chakradhar Padamutham; P. Venkata Subba Reddy 001; Khandelwal Himanshu (Discret. Math. Algorithms Appl., 2022)

Algorithmic aspects of Roman {3}-domination in graphs. - Chakradhar Padamutham; P. Venkata Subba Reddy 001 (RAIRO Oper. Res., 2022)

Complexity aspects of restrained Roman domination in graphs. - Chakradhar Padamutham (Discret. Math. Algorithms Appl., 2023)