A bad submatrix is easy to find. - Ramjee P. Swaminathan (Networks, 1994)

The Arborescence-realization Problem. - Ramjee P. Swaminathan; Donald K. Wagner (Discret. Appl. Math., 1995)

On Finding Solutions for Extended Horn Formulas. - John S. Schlipf; Fred S. Annexstein; John V. Franco; Ramjee P. Swaminathan (Inf. Process. Lett., 1995)

The Pagenumber of the Class of Bandwidth-k Graphs is k-1. - Ramjee P. Swaminathan; D. Giriraj; D. K. Bhatia (Inf. Process. Lett., 1995)

A Multi-Tree Generating Routing Scheme Using Acyclic Orientations. - Fred S. Annexstein; Kenneth A. Berman; Ramjee P. Swaminathan (COCOON, 1997)

On Computing Nearly Optimal Multi-Tree Paths and s, t-Numberings. - Fred S. Annexstein; Kenneth A. Berman; Ramjee P. Swaminathan (SIROCCO, 1997)

Average Case Results for Satisfiability Algorithms Under the Random-Clause-Width Model. - John V. Franco; Ramjee P. Swaminathan (Ann. Math. Artif. Intell., 1997)

On a Class of Graphic Matrices. - Ramjee P. Swaminathan (Ars Comb., 1997)

On Testing Consecutive-ones Property in Parallel. - Fred S. Annexstein; Ramjee P. Swaminathan (Discret. Appl. Math., 1998)

An Algorithm for the Class of Pure Implicational Formulas. - John V. Franco; Judy Goldsmith; John S. Schlipf; Ewald Speckenmeyer; Ramjee P. Swaminathan (Discret. Appl. Math., 1999)

A multi-tree routing scheme using acyclic orientations. - Fred S. Annexstein; Kenneth A. Berman; Tsan-sheng Hsu; Ramjee P. Swaminathan (Theor. Comput. Sci., 2000)

On good algorithms for determining unsatisfiability of propositional formulas. - John V. Franco; Ramjee P. Swaminathan (Discret. Appl. Math., 2003)