Ramjee P. Swaminathan

13 papers B 2Misc 1Journal 10
YearRankTypeTitle / Venue / Authors
2003 J jnl
On good algorithms for determining unsatisfiability of propositional formulas.
Discret. Appl. Math.
John V. Franco, Ramjee P. Swaminathan
2000 J jnl
A multi-tree routing scheme using acyclic orientations.
Theor. Comput. Sci.
Fred S. Annexstein, Kenneth A. Berman, Tsan-sheng Hsu, Ramjee P. Swaminathan
1999 J jnl
An Algorithm for the Class of Pure Implicational Formulas.
Discret. Appl. Math.
John V. Franco, Judy Goldsmith, John S. Schlipf, Ewald Speckenmeyer, Ramjee P. Swaminathan
1998 J jnl
On Testing Consecutive-ones Property in Parallel.
Discret. Appl. Math.
Fred S. Annexstein, Ramjee P. Swaminathan
1997 Misc conf
A Multi-Tree Generating Routing Scheme Using Acyclic Orientations.
COCOON
Fred S. Annexstein, Kenneth A. Berman, Ramjee P. Swaminathan
1997 J jnl
Average Case Results for Satisfiability Algorithms Under the Random-Clause-Width Model.
Ann. Math. Artif. Intell.
John V. Franco, Ramjee P. Swaminathan
1997 B conf
On Computing Nearly Optimal Multi-Tree Paths and s, t-Numberings.
SIROCCO
Fred S. Annexstein, Kenneth A. Berman, Ramjee P. Swaminathan
1997 J jnl
On a Class of Graphic Matrices.
Ars Comb.
Ramjee P. Swaminathan
1995 J jnl
On Finding Solutions for Extended Horn Formulas.
Inf. Process. Lett.
John S. Schlipf, Fred S. Annexstein, John V. Franco, Ramjee P. Swaminathan
1995 B conf
On Testing Consecutive-Ones Property in Parallel.
SPAA
Fred S. Annexstein, Ramjee P. Swaminathan
1995 J jnl
The Arborescence-realization Problem.
Discret. Appl. Math.
Ramjee P. Swaminathan, Donald K. Wagner
1995 J jnl
The Pagenumber of the Class of Bandwidth-k Graphs is k-1.
Inf. Process. Lett.
Ramjee P. Swaminathan, D. Giriraj, D. K. Bhatia
1994 J jnl
A bad submatrix is easy to find.
Networks
Ramjee P. Swaminathan