| 2003 |
|---|
| 11 | EE | John V. Franco,
Ramjee P. Swaminathan:
On good algorithms for determining unsatisfiability of propositional formulas.
Discrete Applied Mathematics 130(2): 129-138 (2003) |
| 2000 |
|---|
| 10 | EE | 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) |
| 1999 |
|---|
| 9 | EE | 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 |
|---|
| 8 | EE | Fred S. Annexstein,
Ramjee P. Swaminathan:
On Testing Consecutive-ones Property in Parallel.
Discrete Applied Mathematics 88(1-3): 7-28 (1998) |
| 1997 |
|---|
| 7 | | Fred S. Annexstein,
Kenneth A. Berman,
Ramjee P. Swaminathan:
A Multi-Tree Generating Routing Scheme Using Acyclic Orientations.
COCOON 1997: 18-22 |
| 6 | | Fred S. Annexstein,
Kenneth A. Berman,
Ramjee P. Swaminathan:
On Computing Nearly Optimal Multi-Tree Paths and s, t-Numberings.
SIROCCO 1997: 12-23 |
| 5 | | 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) |
| 1995 |
|---|
| 4 | EE | Fred S. Annexstein,
Ramjee P. Swaminathan:
On Testing Consecutive-Ones Property in Parallel.
SPAA 1995: 234-243 |
| 3 | EE | Ramjee P. Swaminathan,
Donald K. Wagner:
The Arborescence-realization Problem.
Discrete Applied Mathematics 59(3): 267-283 (1995) |
| 2 | EE | 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) |
| 1 | EE | 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) |
