Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Ramjee P. Swaminathan
2000 – 2009
- 2003
[j8]John V. Franco, Ramjee P. Swaminathan: On good algorithms for determining unsatisfiability of propositional formulas. Discrete Applied Mathematics 130(2): 129-138 (2003)- 2000
[j7]Fred S. Annexstein, Kenneth A. Berman, Tsan-sheng Hsu, Ramjee P. Swaminathan: A multi-tree routing scheme using acyclic orientations. Theor. Comput. Sci. 240(2): 487-494 (2000)
1990 – 1999
- 1999
[j6]John V. Franco, Judy Goldsmith, John S. Schlipf, Ewald Speckenmeyer, Ramjee P. Swaminathan: An Algorithm for the Class of Pure Implicational Formulas. Discrete Applied Mathematics 96-97: 89-106 (1999)- 1998
[j5]Fred S. Annexstein, Ramjee P. Swaminathan: On Testing Consecutive-ones Property in Parallel. Discrete Applied Mathematics 88(1-3): 7-28 (1998)- 1997
[j4]John V. Franco, Ramjee P. Swaminathan: Average Case Results for Satisfiability Algorithms Under the Random-Clause-Width Model. Ann. Math. Artif. Intell. 20(1-4): 357-391 (1997)
[c3]Fred S. Annexstein, Kenneth A. Berman, Ramjee P. Swaminathan: A Multi-Tree Generating Routing Scheme Using Acyclic Orientations. COCOON 1997: 18-22
[c2]Fred S. Annexstein, Kenneth A. Berman, Ramjee P. Swaminathan: On Computing Nearly Optimal Multi-Tree Paths and s, t-Numberings. SIROCCO 1997: 12-23- 1995
[j3]Ramjee P. Swaminathan, Donald K. Wagner: The Arborescence-realization Problem. Discrete Applied Mathematics 59(3): 267-283 (1995)
[j2]John S. Schlipf, Fred S. Annexstein, John V. Franco, Ramjee P. Swaminathan: On Finding Solutions for Extended Horn Formulas. Inf. Process. Lett. 54(3): 133-137 (1995)
[j1]Ramjee P. Swaminathan, D. Giriraj, D. K. Bhatia: The Pagenumber of the Class of Bandwidth-k Graphs is k-1. Inf. Process. Lett. 55(2): 71-74 (1995)
[c1]Fred S. Annexstein, Ramjee P. Swaminathan: On Testing Consecutive-Ones Property in Parallel. SPAA 1995: 234-243
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2012-12-02 20:47 CET by the dblp team



