The cd-Coloring of Graphs. - M. A. Shalu; T. P. Sandhya 001 (CALDAM, 2016)

Star Coloring of Graphs with Girth at Least Five. - M. A. Shalu; T. P. Sandhya 001 (Graphs Comb., 2016)

A Lower Bound of the cd-Chromatic Number and Its Complexity. - M. A. Shalu; S. Vijayakumar; T. P. Sandhya 001 (CALDAM, 2017)

On the algorithmic aspects of strong subcoloring. - M. A. Shalu; S. Vijayakumar; S. Devi Yamini; T. P. Sandhya 001 (J. Comb. Optim., 2018)

The Induced Star Partition of Graphs. - M. A. Shalu; S. Vijayakumar; T. P. Sandhya 001 (CALDAM, 2019)

Graph Orientation with Edge Modifications. - Yuichi Asahiro; Jesper Jansson 001; Eiji Miyano; Hirotaka Ono 001; Sandhya T. P. 001 (FAW, 2019)

On the complexity of cd-coloring of graphs. - M. A. Shalu; S. Vijayakumar; Sandhya T. P. 001 (Discret. Appl. Math., 2020)

Extending Partial Orthogonal Drawings. - Patrizio Angelini; Ignaz Rutter; T. P. Sandhya 001 (J. Graph Algorithms Appl., 2021)

Induced star partition of graphs. - M. A. Shalu; S. Vijayakumar; T. P. Sandhya 001; Joyashree Mondal (Discret. Appl. Math., 2022)

Fitch Graph Completion. - Marc Hellmuth; Peter F. Stadler; Sandhya Thekkumpadan Puthiyaveedu (COCOON (2), 2023)

Building a small and informative phylogenetic supertree. - Jesper Jansson 001; Konstantinos Mampentzidis; T. P. Sandhya 001 (Inf. Comput., 2023)

A Simple Partially Embedded Planarity Test Based on Vertex-Addition. - Simon D. Fink; Ignaz Rutter; Sandhya T. P. 001 (SOSA, 2025)

On a generalization of median graphs: k-median graphs. - Marc Hellmuth; Sandhya Thekkumpadan Puthiyaveedu (Ars Math. Contemp., 2025)

The complement of the Djoković-Winkler relation. - Marc Hellmuth; Bruno J. Schmidt; Guillaume E. Scholz; Sandhya Thekkumpadan Puthiyaveedu (Discret. Math., 2025)