Centrality measures-based algorithm to visualize a maximal common induced subgraph in large communication networks. - Parisutham Nirmala; Lekshmi Ramasubramony Sulochana; Nadarajan Rethnasamy (Knowl. Inf. Syst., 2016)

Vertex cover-based binary tree algorithm to detect all maximum common induced subgraphs in large communication networks. - Parisutham Nirmala; Lekshmi Ramasubramony Sulochana; Nadarajan Rethnasamy (Knowl. Inf. Syst., 2016)

Monitoring Edge-Geodetic Sets in Graphs. - Florent Foucaud; Krishna Narayanan; Lekshmi Ramasubramony Sulochana (CALDAM, 2023)