M. S. Krishnamoorthy

According to our database, M. S. Krishnamoorthy authored at least 7 papers between 1975 and 2008.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2008

Models and methods for prediction problem of evolving graphs.

A. Chapanond, M. S. Krishnamoorthy

Proceedings of the IEEE International Conference on Intelligence and Security Informatics, 2008

1998

Bridge Obstructions to Circular-Three Gate Matrix Layout.

Nancy Lawson, M. S. Krishnamoorthy

Graphs Comb., 1998

1996

Enumerating all Cycles of a Planar Graph.

Ugur Dogrusöz, M. S. Krishnamoorthy

Parallel Algorithms Appl., 1996

1983

An Approximation Algorithm to the File Allocation Problem in Computer Networks.

Kowtha Murthy, John B. Kam, M. S. Krishnamoorthy

Proceedings of the Second ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, 1983

1979

The generalized towers of Hanoi.

M. S. Krishnamoorthy, Somenath Biswas

SIGACT News, 1979

1977

A note on "Some simplified NP-complete graph problems".

M. S. Krishnamoorthy

SIGACT News, 1977

1975

An NP-hard problem in bipartite graphs.

M. S. Krishnamoorthy

SIGACT News, 1975