Search the dblp DataBase

Publications of Author

1. Fred S. Annexstein, Kenneth A. Berman, Ramjee P. Swaminathan
   A Multi-Tree Generating Routing Scheme Using Acyclic Orientations. [Citation Graph (0, 0)][DBLP]
   COCOON, 1997, pp:18-22 [Conf]
   
2. Fred S. Annexstein, Kenneth A. Berman, Ramjee P. Swaminathan
   On Computing Nearly Optimal Multi-Tree Paths and s, t-Numberings. [Citation Graph (0, 0)][DBLP]
   SIROCCO, 1997, pp:12-23 [Conf]
   
3. Fred S. Annexstein, Ramjee P. Swaminathan
   On Testing Consecutive-Ones Property in Parallel. [Citation Graph (0, 0)][DBLP]
   SPAA, 1995, pp:234-243 [Conf]
   
4. John V. Franco, Ramjee P. Swaminathan
   Average Case Results for Satisfiability Algorithms Under the Random-Clause-Width Model. [Citation Graph (0, 0)][DBLP]
   Ann. Math. Artif. Intell., 1997, v:20, n:1-4, pp:357-391 [Journal]
   
5. Fred S. Annexstein, Ramjee P. Swaminathan
   On Testing Consecutive-ones Property in Parallel. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 1998, v:88, n:1-3, pp:7-28 [Journal]
   
6. John V. Franco, Judy Goldsmith, John S. Schlipf, Ewald Speckenmeyer, Ramjee P. Swaminathan
   An Algorithm for the Class of Pure Implicational Formulas. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 1999, v:96, n:, pp:89-106 [Journal]
   
7. John V. Franco, Ramjee P. Swaminathan
   On good algorithms for determining unsatisfiability of propositional formulas. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2003, v:130, n:2, pp:129-138 [Journal]
   
8. Ramjee P. Swaminathan, Donald K. Wagner
   The Arborescence-realization Problem. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 1995, v:59, n:3, pp:267-283 [Journal]
   
9. John S. Schlipf, Fred S. Annexstein, John V. Franco, Ramjee P. Swaminathan
   On Finding Solutions for Extended Horn Formulas. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1995, v:54, n:3, pp:133-137 [Journal]
   
10. Ramjee P. Swaminathan, D. Giriraj, D. K. Bhatia
    The Pagenumber of the Class of Bandwidth-k Graphs is k-1. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1995, v:55, n:2, pp:71-74 [Journal]
    
11. Fred S. Annexstein, Kenneth A. Berman, Tsan-sheng Hsu, Ramjee P. Swaminathan
    A multi-tree routing scheme using acyclic orientations. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:240, n:2, pp:487-494 [Journal]