Algorithms for the computation of molecular distance matrix and distance polynomial of chemical graphs on parallel computers. - P. Thangavel; Ponnambalam Venuvanalingam (J. Chem. Inf. Comput. Sci., 1993)

Learning Approach for the Computation of Generalized Wheland Polynomials of Chemical Graphs. - Musiri M. Balakrishnarajan; Ponnambalam Venuvanalingam (J. Chem. Inf. Comput. Sci., 1994)

General Method for the Computation of Matching Polynomials of Graphs. - Musiri M. Balakrishnarajan; Ponnambalam Venuvanalingam (J. Chem. Inf. Comput. Sci., 1994)

A Fast Graph Traversal Algorithm for the Computer Enumeration of P-V Paths of Benzenoid Graphs. - Musiri M. Balakrishnarajan; Ponnambalam Venuvanalingam (Comput. Chem., 1995)

Computer generation of Pauling bond orders using heuristic search. - Musiri M. Balakrishnarajan; Ponnambalam Venuvanalingam (J. Chem. Inf. Comput. Sci., 1995)

C-H Functionalisation Through Singlet Chlorocarbenes Insertions - MP2 and DFT Investigations. - M. Ramalingam; K. Ramasami; Ponnambalam Venuvanalingam; V. Sethuraman (International Conference on Computational Science (3), 2006)

Ab Initio and DFT Investigations of the Mechanistic Pathway of Singlet Bromocarbenes Insertion into C-H Bonds of Methane and Ethane. - M. Ramalingam; K. Ramasami; Ponnambalam Venuvanalingam; J. Swaminathan (International Conference on Computational Science (2), 2007)