All graphs are set reconstructible if all 2-connected graphs are set reconstructible. - S. Ramachandran; S. Monikandan (Ars Comb., 2007)

SEMALRU: An Implementation of Modified Web Cache Replacement Algorithm. - K. Geetha; N. A. Gounden; S. Monikandan (NaBIC, 2009)

A sufficient condition for Set Reconstruction. - S. Ramachandran; S. Monikandan (Ars Comb., 2009)

Degree Associated Edge Reconstruction Number. - S. Monikandan; S. Sundar Raj (IWOCA, 2012)

Reconstruction of bipartite graphs and triangle-free graphs with connectivity two. - S. Monikandan; J. Balakumar (Australas. J Comb., 2012)

Pairs of graphs having n-2 cards in common. - S. Ramachandran; S. Monikandan (Ars Comb., 2013)

Degree associated edge reconstruction number of graphs. - S. Monikandan; P. Anusha Devi; S. Sundar Raj (J. Discrete Algorithms, 2013)

A reduction of the Graph Reconstruction Conjecture. - J. Balakumar; S. Monikandan (Discuss. Math. Graph Theory, 2014)

Adversary degree associated reconstruction number of graphs. - S. Monikandan; S. Sundar Raj (Discret. Math. Algorithms Appl., 2015)

Degree Associated Edge Reconstruction Number of Graphs with Regular Pruned Graph. - P. Anusha Devi; S. Monikandan (Electron. J. Graph Theory Appl., 2015)

Degree Associated Reconstruction Number of Biregular Bipartite Graphs Whose Degrees Differ by at Least Two. - A. Anu; S. Monikandan (ICTCSDM, 2016)

Degree Associated Reconstruction Number of Split Graphs with Regular Independent Set. - N. Kalai Mathi; S. Monikandan (ICTCSDM, 2016)

Degree associated reconstruction number of connected digraphs with unique end vertex. - P. Anusha Devi; S. Monikandan (Australas. J Comb., 2016)

On pairs of graphs having n-2 cards in common. - S. Monikandan; J. Balakumar (Ars Comb., 2016)

Degree associated reconstruction number of certain connected graphs with unique end vertex and a vertex of degree n-2. - A. Anu; S. Monikandan (Discret. Math. Algorithms Appl., 2016)

Degree Associated Reconstruction Number of Graphs with Regular Pruned Graph. - P. Anusha Devi; S. Monikandan (Ars Comb., 2017)

Degree Associated Reconstruction Parameters of Total Graphs. - P. Anusha Devi; S. Monikandan (Contributions Discret. Math., 2017)

Reconstruction of distance hereditary 2-connected graphs. - P. Devi Priya; S. Monikandan (Discret. Math., 2018)

Graphs with arbitrarily large adversary degree associated reconstruction number. - P. Anusha Devi; S. Monikandan (AKCE Int. J. Graphs Comb., 2020)

Degree associated edge reconstruction number of split graphs with biregular independent set is one. - N. Kalai Mathi; S. Monikandan (AKCE Int. J. Graphs Comb., 2020)

Reconstruction number of graphs with unique pendant vertex. - S. Monikandan; A. Anu (Discret. Appl. Math., 2021)

Degree Associated Edge Reconstruction Parameters of Strong Double Brooms. - P. Anusha Devi; S. Monikandan (J. Autom. Lang. Comb., 2022)

Recognition of finite bitopological spaces with no isolated point. - S. Devi; S. Monikandan (Soft Comput., 2023)

The degree associated edge reconstruction number of bidegreed graphs is at most four. - A. Anu; S. Monikandan (Ars Comb., 2025)