Algorithms and Complexity of *s*-Club Cluster Vertex DeletionD Chakraborty, LS Chandran, S Padinhatteeri, RR Pillai International Workshop on Combinatorial Algorithms, 152-164, 2021 | 8 | 2021 |

χD(G), |Aut(G)|, and a variant of the Motion Lemma S Balachandran, N., & Padinhatteeri ARS MATHEMATICA CONTEMPORANEA 12 (1), 89-109, 2016 | 6* | 2016 |

Distinguishing chromatic number of random Cayley graphs N Balachandran, S Padinhatteeri Discrete Mathematics 340 (10), 2447-2455, 2017 | 4 | 2017 |

The list distinguishing number of Kneser graphs N Balachandran, S Padinhatteeri Discrete Applied Mathematics 236, 30-41, 2018 | 3 | 2018 |

Template-Driven Rainbow Coloring of Proper Interval Graphs LS Chandran, SK Das, P Hell, S Padinhatteeri, RR Pillai Conference on Algorithms and Discrete Applied Mathematics, 452-470, 2021 | 1 | 2021 |

List Distinguishing Number of Power of Hypercube and Cartesian Powers of a Graph LS Chandran, S Padinhatteeri, K Ravi Shankar Conference on Algorithms and Discrete Applied Mathematics, 235-247, 2020 | 1 | 2020 |

Vertex transitive graphs with and small automorphism group N Balachandran, S Padinhatteeri, P Spiga arXiv preprint arXiv:1705.10465, 2017 | 1 | 2017 |

s-Club Cluster Vertex Deletion on interval and well-partitioned chordal graphs D Chakraborty, LS Chandran, S Padinhatteeri, RR Pillai Discrete Applied Mathematics 345, 170-189, 2024 | | 2024 |

Template-driven rainbow coloring of proper interval graphs LS Chandran, SK Das, P Hell, S Padinhatteeri, RR Pillai Discrete Applied Mathematics 328, 97-107, 2023 | | 2023 |

The List Distinguishing Number of Graphs S Padinhatteeri | | |