An NP-hard problem in bipartite graphs. - M. S. Krishnamoorthy (SIGACT News, 1975)

A note on "Some simplified NP-complete graph problems". - M. S. Krishnamoorthy (SIGACT News, 1977)

The generalized towers of Hanoi. - M. S. Krishnamoorthy; Somenath Biswas (SIGACT News, 1979)

An Approximation Algorithm to the File Allocation Problem in Computer Networks. - Kowtha Murthy; John B. Kam; M. S. Krishnamoorthy (PODS, 1983)

Enumerating all Cycles of a Planar Graph. - Ugur Dogrusöz; M. S. Krishnamoorthy (Parallel Algorithms Appl., 1996)

Bridge Obstructions to Circular-Three Gate Matrix Layout. - Nancy Lawson; M. S. Krishnamoorthy (Graphs Comb., 1998)

Models and methods for prediction problem of evolving graphs. - A. Chapanond; M. S. Krishnamoorthy (ISI, 2008)