χD(G), |Aut(G)|, and a variant of the Motion Lemma. - Niranjan Balachandran; Sajith Padinhatteeri (Ars Math. Contemp., 2017)

Distinguishing chromatic number of random Cayley graphs. - Niranjan Balachandran; Sajith Padinhatteeri (Discret. Math., 2017)

The list distinguishing number of Kneser graphs. - Niranjan Balachandran; Sajith Padinhatteeri (Discret. Appl. Math., 2018)

Vertex transitive graphs G with χ_D(G) > χ(G) and small automorphism group. - Niranjan Balachandran; Sajith Padinhatteeri; Pablo Spiga (Ars Math. Contemp., 2019)

List Distinguishing Number of p th Power of Hypercube and Cartesian Powers of a Graph. - L. Sunil Chandran; Sajith Padinhatteeri; Karthik Ravi Shankar (CALDAM, 2020)

Algorithms and Complexity of s-Club Cluster Vertex Deletion. - Dibyayan Chakraborty; L. Sunil Chandran; Sajith Padinhatteeri; Raji R. Pillai (IWOCA, 2021)

Template-driven rainbow coloring of proper interval graphs. - L. Sunil Chandran; Sajal K. Das 001; Pavol Hell; Sajith Padinhatteeri; Raji R. Pillai (Discret. Appl. Math., 2023)

s-Club Cluster Vertex Deletion on interval and well-partitioned chordal graphs. - Dibyayan Chakraborty; L. Sunil Chandran; Sajith Padinhatteeri; Raji R. Pillai (Discret. Appl. Math., 2024)