A. Subramanian

A New Approach to Stable Matching Problems

Ashok Subramanian, A. Subramanian, 1989, SIAM J. Comput..

Efficient algorithms and methods to solve dynamic MINs stability problem using stable matching with complete ties

Nitin, Ashok Subramanian, A. Subramanian, 2008, J. Discrete Algorithms.

The Parallel Complexity of Propagation in Boolean Circuits

Ashok Subramanian, A. Subramanian, 1995, Inf. Comput..

The complexity of circuit value and network stability

Ernst W. Mayr, Ashok Subramanian, E. Mayr, 1989, [1989] Proceedings. Structure in Complexity Theory Fourth Annual Conference.

A Polynomial Bound on the Number of Light Cycles in an Undirected Graph

Ashok Subramanian, A. Subramanian, 1995, Inf. Process. Lett..

Two recent algorithms for the global minimum cut problem

Ashok Subramanian, A. Subramanian, 1995, SIGA.