BACK TO INDEX

Publications of D. J. Rose on CSC

Articles in journal or book chapters

1. D. J. Rose. Convergent regular splittings for singular $M$-matrices. SIAM Journal on Algebraic and Discrete Methods, 5(1):133-144, 1984.



2. R. J. Lipton, D. J. Rose, and R. E. Tarjan. Generalized nested dissection. SIAM Journal on Numerical Analysis, 16(2):346-358, 1979.



3. D. J. Rose and R. E. Tarjan. Algorithmic aspects of vertex elimination in directed graphs. SIAM Journal on Applied Mathematics, 34(1):176-197, 1978.



4. D. J. Rose, R. E. Tarjan, and G. S. Lueker. Algorithmic aspects of vertex elimination on graphs. SIAM Journal on Computing, 5(2):266-283, 1976.



5. A. J. Hoffman, M. S. Martin, and D. J. Rose. Complexity bounds for regular finite difference and finite element grids. SIAM Journal on Numerical Analysis, 10(2):364-369, 1973.



6. D. J. Rose. A graph-theoretic study of the numerical solution of sparse positive definite systems of linear equations. In R. C. Read, editor, Graph Theory and Computing, pages 183-217. Academic Press, 1972. Keyword(s): Minimum degree algorithm.



7. D. J. Rose. Triangulated graphs and the elimination process. Journal of Mathematical Analysis and Applications, 32:597-609, 1970. Keyword(s): Elimination process, Triangulated graph.

Conference articles

1. D. J. Rose and G. F. Whitten. Automatic nested dissection. In ACM 74: Proceedings of the 1974 annual conference, New York, NY, USA, pages 82-88, 1974. ACM.

BACK TO INDEX

---

Last modified: Wed Jul 21 11:49:20 2010
Author: Bora Uçar.