BACK TO INDEX

 Articles in journal or book chapters on CSC
 2010
1. Ü. V. Çatalyürek, C. Aykanat, and B. Uçar. On two-dimensional sparse matrix partitioning: Models, methods, and a recipe. SIAM Journal on Scientific Computing, 32(2):656-683, 2010. Keyword(s): Sparse matrix-vector multiplication, Hypergraph partitioning, Hypergraph model, Communication cost.

 2008
1. E. Agullo, A. Guermouche, and J.-Y. L'Excellent. A parallel out-of-core multifrontal method: Storage of factors on disk and analysis of models for an out-of-core active memory. Parallel Computing, 34(6-8):296-317, 2008. Keyword(s): Out-of-core factorization, Multifrontal method.

2. M. Elkin, Y. Emek, D. A. Spielman, and S.-H. Teng. Lower-stretch spanning trees. SIAM Journal on Computing, 38(2):608-628, 2008.

3. P. Hénon, P. Ramet, and J. Roman. On finding approximate supernodes for an efficient block-ILU(k) factorization. Parallel Computing, 34(6--8):345-362, 2008.

4. H. de Sterck, R. D. Falgout, J. W. Nolting, and U. M. Yang. Distance-two interpolation for parallel algebraic multigrid. Numerical Linear Algebra with Applications, 15(2--3):115-139, MAR-APR 2008.

 2007
1. D. M. Alber and L. N. Olson. Parallel coarse-grid selection. Numerical Linear Algebra with Applications, 14(8):611-643, 2007. Keyword(s): Algebraic multigrid, Preconditioning.

2. D. Fritzsche, A. Frommer, and D. B. Szyld. Extensions of certain graph-based algorithms for preconditioning. SIAM Journal on Scientific Computing, 29(5):2144-2161, 2007.

3. S. Maclachlan and Y. Saad. A greedy strategy for coarse-grid selection. SIAM Journal on Scientific Computing, 29(5):1825-1853, 2007.

4. B. Uçar and C. Aykanat. Partitioning sparse matrices for parallel preconditioned iterative methods. SIAM Journal on Scientific Computing, 29(4):1683-1709, 2007. Keyword(s): Sparse matrix-vector multiplication, Hypergraph partitioning, Hypergraph model, Preconditioning, Multi-physics simulation, Multi-mesh simulation, Communication cost.

 2006
1. E. Chow, R. D. Falgout, J. J. Hu, R. S. Tuminaro, and U. M. Yang. A survey of parallelization techniques for multigrid solvers. In M. A. Heroux, P. Raghavan, and H. D. Simon, editors, Parallel Processing for Scientific Computing, volume 20 of Software, Environments, and Tools, chapter 10, pages 179-201. SIAM, 2006.

2. K. D. Devine, E. G. Boman, and G. Karypis. Partitioning and load balancing for emerging parallel applications and architectures. In M. Heroux, A. Raghavan, and H. Simon, editors, Frontiers of Scientific Computing. SIAM, Philadelphia, 2006.

3. P. R. Amestoy, A. Guermouche, J.-Y. L'Excellent, and S. Pralet. Hybrid scheduling for the parallel solution of linear systems. Parallel Computing, 32(2):136-156, 2006.

4. M. Bern, J. R. Gilbert, B. Hendrickson, N. Nguyen, and S. Toledo. Support-graph preconditioners. SIAM Journal on Matrix Analysis and Applications, 27(4):930-951, 2006.

5. M. Bollhöfer and O. Schenk. Combinatorial aspects in sparse elimination methods. GAMM Mitteilungen, 29:342-367, 2006.

6. A. Guermouche and J.-Y. L'Excellent. Constructing memory-minimizing schedules for multifrontal methods. ACM Transactions on Mathematical Software, 32(1):17-32, 2006.

7. I. Lee, P. Raghavan, and E. G. Ng. Effective preconditioning through ordering interleaved with incomplete factorization. SIAM Journal on Matrix Analysis and Applications, 27(4):1069-1088, 2006.

8. O. Meshar, D. Irony, and S. Toledo. An out-of-core sparse symmetric-indefinite factorization method. ACM Transactions on Mathematical Software, 32(3):445-471, 2006.

9. H. de Sterck, U. M. Yang, and J. J. Heys. Reducing complexity in parallel algebraic multigrid preconditioners. SIAM Journal on Matrix Analysis and Applications, 27(4):1019-1039, 2006.

 2005
1. R. H. Bisseling and W. Meesen. Communication balancing in parallel sparse matrix-vector multiplication. Electronic Transactions on Numerical Analysis, 21, 2005. Keyword(s): Sparse matrix-vector multiplication, Parallel computing, Bulk synchronous parallel.

2. I. S. Duff and S. Pralet. Strategies for scaling and pivoting for sparse symmetric indefinite problems. SIAM Journal on Matrix Analysis and Applications, 27(2):313-340, 2005.

3. S. C. Eisenstat and J. W. H. Liu. A tree-based dataflow model for the unsymmetric multifrontal method. Electronic Transactions on Numerical Analysis, 21:1-19, 2005.

4. S. C. Eisenstat and J. W. H. Liu. The theory of elimination trees for sparse unsymmetric matrices. SIAM Journal on Matrix Analysis and Applications, 26(3):686-705, 2005.

5. A. H. Gebremedhin, F. Manne, and A. Pothen. What color is your Jacobian? Graph coloring for computing derivatives. SIAM Review, 47(4):629-705, 2005.

6. H. W. Kuhn. Statement for Naval Research Logistics. Naval Research Logistics, 52(1):6, 2005.

7. H. W. Kuhn. The Hungarian method for the assignment problem. Naval Research Logistics, 52(1):7-21, 2005.

8. Y. Saad. Multilevel ILU with reorderings for diagonal dominance. SIAM Journal on Scientific Computing, 27(3):1032-1057, 2005.

 2004
1. P. R. Amestoy, I. S. Duff, and C. Vömel. Task scheduling in an asynchronous distributed memory multifrontal solver. SIAM Journal on Matrix Analysis and Applications, 26(2):544-565, 2004.

2. E. G. Boman, D. Chen, B. Hendrickson, and S. Toledo. Maximum-weight-basis preconditioners. Numerical Linear Algebra with Applications, 11(8-9):695-721, 2004.

3. V. Rotkin and S. Toledo. The design and implementation of a new out-of-core sparse Cholesky factorization method. ACM Transactions on Mathematical Software, 30(1):19-46, 2004.

 2003
1. E. G. Boman and B. Hendrickson. Support theory for preconditioning. SIAM Journal on Matrix Analysis and Applications, 25(3):694-717, 2003.

2. D. Chen and S. Toledo. Vaidya's preconditioners: Implementation and experimental study. Electronic Transactions on Numerical Analysis, 16:30-49, 2003.

3. A. Guermouche, J.-Y. L'Excellent, and G. Utard. Impact of reordering on the memory of a multifrontal solver. Parallel Computing, 29(9):1191-1218, 2003.

4. H. Kim, J. Xu, and L. Zikatanov. A multigrid method based on graph matching for convection-diffusion equations. Numerical Linear Algebra with Applications, 10(1--2):181-195, 2003. Keyword(s): Matching, Algebraic multigrid, Preconditioning.

5. Y. Saad. Finding exact and approximate block structures for ILU preconditioning. SIAM Journal on Scientific Computing, 24(4):1107-1123, 2003.

 2002
1. M. Benzi. Preconditioning techniques for large linear systems: A survey. Journal of Computational Physics, 182(2):418-477, 2002.

2. A. Gupta. Improved symbolic and numerical factorization algorithms for unsymmetric sparse matrices. SIAM Journal on Matrix Analysis and Applications, 24(2):529-552, 2002.

3. V. E. Henson and U. M. Yang. BoomerAMG: A parallel algebraic multigrid solver and preconditioner. Applied Numerical Mathematics, 41(1):155-177, 2002.

 2001
1. P. R. Amestoy, I. S. Duff, J.-Y. L'Excellent, and J. Koster. A fully asynchronous multifrontal solver using distributed dynamic scheduling. SIAM Journal on Matrix Analysis and Applications, 23(1):15-41, 2001.

2. M. Bollhöfer. A robust ILU with pivoting based on monitoring the growth of the inverse factors. Linear Algebra and its Applications, 338(1--3):201-218, 2001.

3. R. Bridson and W.-P. Tang. A structural diagnosis of some IC orderings. SIAM Journal on Scientific Computing, 22(5):1527-1532, 2001.

4. I. S. Duff and J. Koster. On algorithms for permuting large entries to the diagonal of a sparse matrix. SIAM Journal on Matrix Analysis and Applications, 22:973-996, 2001.

5. D. Hysom and A. Pothen. A scalable parallel algorithm for incomplete factor preconditioning. SIAM Journal on Scientific Computing, 22(6):2194-2215, 2001.

6. J. Schulze. Towards a tighter coupling of bottom-up and top-down sparse matrix ordering methods. BIT Numerical Mathematics, 41(4):800-841, 2001.

7. K. Stüben. A review of algebraic multigrid. Journal of Computational and Applied Mathematics, 128(1--2):281-309, 2001.

 2000
1. P. R. Amestoy, I. S. Duff, and J.-Y. L'Excellent. Multifrontal parallel distributed symmetric and unsymmetric solvers. Computer methods in applied mechanics and engineering, 184(2--4):501-520, 2000.

2. M. Benzi, J. C. Haws, and M. Tůma. Preconditioning highly indefinite and nonsymmetric matrices. SIAM Journal on Scientific Computing, 22(4):1333-1353, 2000.

3. M. Benzi and M. Tůma. Orderings for factorized sparse approximate inverse preconditioners. SIAM Journal on Scientific Computing, 21(5):1851-1868, 2000.

4. E. Chow. A priori sparsity patterns for parallel sparse approximate inverse preconditioners. SIAM Journal on Scientific Computing, 21(5):1804-1822, 2000.

5. B. Hendrickson and T. G. Kolda. Graph partitioning models for parallel computing. Parallel Computing, 26(12):1519-1534, 2000. Keyword(s): Graph algorithms, Graph partitioning, Hypergraph partitioning, Parallel computing, Communication cost.

 1999
1. E. G. Ng, B. W. Peyton, and P. Raghavan. A blocked incomplete Cholesky preconditioner for hierarchical-memory computers. In D. R. Kincaid and A. C. Elster, editors, Iterative methods in scientific computation IV, volume 5 of IMACS Series in Computational Applied Mathematics, pages 211-222. IMACS, New Brunswick, NJ, USA, 1999.

2. Ü. V. Çatalyürek and C. Aykanat. Hypergraph-partitioning-based decomposition for parallel sparse-matrix vector multiplication. IEEE Transactions on Parallel and Distributed Systems, 10(7):673-693, July 1999. Keyword(s): Sparse matrix-vector multiplication, Hypergraph partitioning, Hypergraph model, Communication cost.

3. M. Benzi, D. B. Szyld, and A. van Duin. Orderings for incomplete factorization preconditioning of nonsymmetric problems. SIAM Journal on Scientific Computing, 20(5):1652-1670, 1999.

4. J. W. Demmel, S. C. Eisenstat, J. R. Gilbert, X. S. Li, and J. W. H. Liu. A supernodal approach to sparse partial pivoting. SIAM Journal on Matrix Analysis and Applications, 20(3):720-755, 1999.

5. I. S. Duff and J. Koster. The design and use of algorithms for permuting large entries to the diagonal of sparse matrices. SIAM Journal on Matrix Analysis and Applications, 20(4):889-901, 1999.

6. I. S. Duff and H. A. van der Vorst. Developments and trends in the parallel solution of linear systems. Parallel Computing, 25(13--14):1931-1970, 1999.

 1998
1. C. Ashcraft and J. W. H. Liu. Robust ordering of sparse matrices using multisection. SIAM Journal on Matrix Analysis and Applications, 19(3):816-832, 1998. Keyword(s): Sparse matrix ordering, Minimum degree algorithm, Nested dissection.

2. B. Hendrickson and E. Rothberg. Improving the run time and quality of nested dissection ordering. SIAM Journal on Scientific Computing, 20(2):468-489, 1998. Keyword(s): Sparse matrix ordering, Nested dissection, Minimum degree algorithm, Minimum degree ordering, Graph algorithms, Graph partitioning.

3. J. H. Reif. Efficient approximate solution of sparse linear systems. Computers and Mathematics with Applications, 36(9):37-58, November 1998.

 1997
1. C. Ashcraft and J. W. H. Liu. Using domain decomposition to find graph bisectors. BIT, 37(3):506-534, 1997.

2. E. Chow and Y. Saad. Experimental study of ILU preconditioners for indefinite matrices. Journal of Computational and Applied Mathematics, 86(2):387-414, 1997.

3. T. A. Davis and I. S. Duff. An unsymmetric-pattern multifrontal method for sparse LU factorization. SIAM Journal on Matrix Analysis and Applications, 18(1):140-158, 1997.

4. M. J. Grote and T. Huckle. Parallel preconditioning with sparse approximate inverses. SIAM Journal on Scientific Computing, 18(3):838-853, 1997.

 1996
1. P. R. Amestoy, T. A. Davis, and I. S. Duff. An approximate minimum degree ordering algorithm. SIAM Journal on Matrix Analysis and Applications, 17(4):886-905, 1996. Keyword(s): Sparse matrix ordering, Minimum degree algorithm.

2. M. Benzi, C. D. Meyer, and M. Tůma. A sparse approximate inverse preconditioner for the conjugate gradient method. SIAM Journal on Scientific Computing, 17(5):1135-1149, 1996.

3. M. Olschowka and A. Neumaier. A new pivoting strategy for Gaussian elimination. Linear Algebra and Its Applications, 240:131-151, 1996.

 1995
1. C. Ashcraft. Compressed graphs and the minimum degree algorithm. SIAM Journal on Scientific Computing, 16:1404-1411, 1995. Keyword(s): Minimum degree algorithm.

2. S. S. Clift and W.-P. Tang. Weighted graph based ordering techniques for preconditioned conjugate gradient methods. BIT Numerical Mathematics, 35(1):30-47, 1995.

 1994
1. S. Barnard and H. D. Simon. A fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems. Concurrency: Practice and Experience, 6:101-117, 1994.

2. Y. Saad. ILUT: A dual threshold incomplete LU factorization. Numerical Linear Algebra with Applications, 1(4):387-402, 1994.

 1993
1. M. V. Bhat, W. G. Habashi, J. W. H. Liu, V. N. Nguyen, and M. F. Peeters. A note on nested dissection for rectangular grids. SIAM Journal on Matrix Analysis and Applications, 14(1):253-258, 1993.

2. J. R. Gilbert and J. W. H. Liu. Elimination structures for unsymmetric sparse $LU$ factors. SIAM Journal on Matrix Analysis and Applications, 14(2):334-352, 1993.

3. J. W. H. Liu, E. G. Ng, and B. W. Peyton. On finding supernodes for sparse matrix computations. SIAM Journal on Matrix Analysis and Applications, 14(1):242-252, 1993.

4. A. Pothen and C. Sun. A mapping algorithm for parallel sparse Cholesky factorization. SIAM Journal on Scientific Computing, 14(5):1253-1257, 1993. Keyword(s): Multifrontal method, Cholesky factorization, Task scheduling, Proportional mapping.

 1992
1. R. A. Brualdi. The symbiotic relationship of combinatorics and matrix theory. Linear Algebra and its Applications, 162--164:65-105, 1992.

2. E. F. D'Azevedo, P. A. Forsyth, and W.-P. Tang. Ordering methods for preconditioned conjugate gradient methods applied to unstructured grid problems. SIAM Journal on Matrix Analysis and Applications, 13(3):944-961, 1992.

3. E. F. D'Azevedo, P. A. Forsyth, and W.-P. Tang. Towards a cost-effective ILU preconditioner with high level fill. BIT Numerical Mathematics, 32(3):442-463, 1992.

4. J. R. Gilbert, C. Moler, and R. Schreiber. Sparse matrices in MATLAB: Design and implementation. SIAM Journal on Matrix Analysis and Applications, 13:333-356, 1992.

5. J. R. Gilbert and R. Schreiber. Highly parallel sparse Cholesky factorization. SIAM Journal on Scientific and Statistical Computing, 13(5):1151-1172, 1992.

6. R. Greenlaw. A model classifying algorithms as inherently sequential with applications to graph searching. Information and Computation, 97(2):133-149, 1992.

7. J. W. H. Liu. The multifrontal method for sparse matrix solution: Theory and practice. SIAM Review, 34(1):82-109, 1992.

 1991
1. H. Alt, N. Blum, K. Mehlhorn, and M. Paul. Computing a maximum cardinality matching in a bipartite graph in time $\mathcal{O}(n^{1.5}\sqrt{m/\log n})$. Information Processing Letters, 37(4):237-240, 1991. Keyword(s): Matching.

2. M. T. Heath, E. Ng, and B. W. Peyton. Parallel algorithms for sparse linear systems. SIAM Review, 33(3):420-460, 1991.

 1990
1. J. J. Dongarra, J. Du Croz, I. S. Duff, and S. Hammarling. A set of level 3 Basic Linear Algebra Subprograms.. ACM Transactions on Mathematical Software, 16:1-17, 1990. Note: Http://www.netlib.org/blas/blas3-paper.ps. Keyword(s): BLAS, Linear algebra.

2. J. W. H. Liu. The role of elimination trees in sparse factorization. SIAM Journal on Matrix Analysis and Applications, 11(1):134-172, 1990. Keyword(s): Elimination tree, Cholesky factorization, Sparse matrix ordering, Symbolic factorization.

3. J. O'Neil and D. B. Szyld. A block ordering method for sparse matrices. SIAM Journal on Scientific and Statistical Computing, 11(5):811-823, 1990.

4. A. Pothen and C.-J. Fan. Computing the block triangular form of a sparse matrix. ACM Transactions on Mathematical Software, 16:303-324, 1990.

5. A. Pothen, H. D. Simon, and K.-P. Liou. Partitioning sparse matrices with eigenvectors of graphs. SIAM Journal on Matrix Analysis and Applications, 11(3):430-452, 1990.

 1989
1. C. Ashcraft and R. Grimes. The influence of relaxed supernode partitions on the multifrontal method. ACM Transactions on Mathematical Software, 15(4):291-309, 1989. Keyword(s): Multifrontal method, Supernode, Fundamental supernode, Relaxed supernode.

2. I. S. Duff and G. A. Meurant. The effect of ordering on preconditioned conjugate gradients. BIT, 29(4):635-657, 1989.

3. G. A. Geist and E. G. Ng. Task scheduling for parallel sparse Cholesky factorization. International Journal of Parallel Programming, 18(4):291-314, 1989. Keyword(s): Parallel computing, Cholesky factorization, Task scheduling, Subtree-to-subcube mapping.

4. A. George and J. W. H. Liu. The evolution of the minimum degree ordering algorithm. SIAM Review, 31(1):1-19, 1989. Keyword(s): Sparse matrix ordering, Minimum degree algorithm, Computational complexity.

5. A. George, J. W. H. Liu, and E. Ng. Communication results for parallel sparse Cholesky factorization on a hypercube. Parallel Computing, 10(3):287-298, 1989. Keyword(s): Parallel computing, Cholesky factorization, Task scheduling, Subtree-to-subcube mapping.

6. J. W. H. Liu. The minimum degree ordering with constraints. SIAM Journal on Scientific and Statistical Computing, 10(6):1136-1145, 1989. Keyword(s): Minimum degree ordering.

 1988
1. I. S. Duff, A. M. Erisman, C. W. Gear, and J. K. Reid. Sparsity structure and Gaussian elimination. SIGNUM Newsletter, 23:2-8, 1988.

2. J. R. Gilbert and T. Peierls. Sparse partial pivoting in time proportional to arithmetic operations. SIAM Journal on Scientific and Statistical Computing, 9(5):862-874, 1988.

3. J. W. H. Liu. Equivalent sparse matrix reordering by elimination tree rotations. SIAM Journal on Scientific and Statistical Computing, 9(3):424-444, 1988. Keyword(s): Multifrontal method, Elimination tree, Equivalent reordering, Out-of-core factorization, Cholesky factorization.

 1987
1. J. W. Ruge and K. Stüben. Algebraic multigrid. In S. F. McCormick, editor, Multigrid Methods, chapter 4, pages 73-130. SIAM, Philadelphia, Pennsylvania, 1987.

2. M. L. Fredman and R. E. Tarjan. Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM, 34(3):596-615, 1987.

3. J. R. Gilbert and R. E. Tarjan. The analysis of a nested dissection algorithm. Numerische Mathematik, 50(4):377-404, 1987.

 1986
1. J. W. H. Liu. A compact row storage scheme for Cholesky factors using elimination trees. ACM Transactions on Mathematical Software, 12(2):127-148, 1986.

2. J. W. H. Liu. On the storage requirement in the out-of-core multifrontal method for sparse factorization. ACM Transactions on Mathematical Software, 12(3):249-264, 1986.

3. M. Luby. A simple parallel algorithm for the maximal independent set problem. SIAM Journal on Computing, 15(4):1036-1053, 1986. Keyword(s): Maximal independent set.

 1985
1. J. W. H. Liu. Modification of the minimum-degree algorithm by multiple elimination. ACM Transactions on Mathematical Software, 11(2):141-153, 1985.

2. J. H. Reif. Depth-first search is inherently sequential. Information Processing Letters, 20(5):229-234, 1985.

 1984
1. I. S. Duff and J. K. Reid. The multifrontal solution of unsymmetric sets of linear equations. SIAM Journal on Scientific and Statistical Computing, 5(3):633-641, 1984.

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

 1983
1. I. S. Duff and J. K. Reid. A note on the work involved in no-fill sparse matrix factorization. IMA Journal on Numerical Analysis, 1:37-40, 1983.

2. I. S. Duff and J. K. Reid. The multifrontal solution of indefinite sparse symmetric linear equations. ACM Transactions on Mathematical Software, 9:302-325, 1983.

 1982
1. S. C. Eisenstat, M. C. Gursky, M. H. Schultz, and A. H. Sherman. The Yale sparse matrix package I: The symmetric codes. International Journal for Numerical Methods in Engineering, 18:1145-1151, 1982.

2. J. A. G. Jess and H. G. M. Kees. A data structure for parallel L/U decomposition. IEEE Transactions on Computers, 31(3):231-239, 1982.

3. R. Schreiber. A new implementation of sparse Gaussian elimination. ACM Transactions on Mathematical Software, 8(3):256-276, 1982.

 1981
1. I. S. Duff. Algorithm 575: Permutations for a zero-free diagonal. ACM Transactions on Mathematical Software, 7(3):387-390, 1981.

2. I. S. Duff. On algorithms for obtaining a maximum transversal. ACM Transactions on Mathematical Software, 7(3):315-330, 1981.

3. M. Yannakakis. Computing the minimum fill-in is NP-complete. SIAM Journal on Algebraic and Discrete Methods, 2(1):77-79, 1981.

 1980
1. A. George. An automatic one-way dissection algorithm for irregular finite element problems. SIAM Journal on Numerical Analysis, 17(6):740-751, 1980.

2. A. George and J. W. H. Liu. A fast implementation of the minimum degree algorithm using quotient graphs. ACM Transactions on Mathematical Software, 6(3):337-358, 1980.

3. A. George and J. W. H. Liu. A minimal storage implementation of the minimum degree algorithm. SIAM Journal on Numerical Analysis, 17(2):282-299, 1980.

4. J. R. Gilbert. A note on the NP-completeness of vertex elimination on directed graphs. SIAM Journal on Algebraic and Discrete Methods, 1(3):292-294, 1980.

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

2. R. J. Lipton and R. E. Tarjan. A separator theorem for planar graphs. SIAM Journal on Applied Mathematics, 36:177-189, 1979.

 1978
1. I. S. Duff and J. K. Reid. Algorithm 529: Permutations to block triangular form. ACM Transactions on Mathematical Software, 4(2):189-192, 1978.

2. I. S. Duff and J. K. Reid. An implementation of Tarjan's algorithm for the block triangularization of a matrix. ACM Transactions on Mathematical Software, 4(2):137-147, 1978.

3. A. George and J. W. H. Liu. An automatic nested dissection algorithm for irregular finite element problems. SIAM Journal on Numerical Analysis, 15(5):1053-1069, 1978.

4. A. George and D. R. McIntyre. On the application of the minimum degree algorithm to finite element systems. SIAM Journal on Numerical Analysis, 15(1):90-112, 1978.

5. A. George, W. G. Poole, and R. G. Voigt. Incomplete nested dissection for solving $n$ by $n$ grid problems. SIAM Journal on Numerical Analysis, 15(4):662-673, 1978.

6. I. Gustafsson. A class of first order factorization methods. BIT Numerical Mathematics, 18(2):142-156, 1978.

7. 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.

 1977
1. I. S. Duff. On permutations to block triangular form. Journal of the Institute of Mathematics and its Applications, 19(3):339-342, 1977.

2. J. A. Meijerink and H. A. van der Vorst. An iterative solution method for linear systems of which the coefficient matrix is a symmetric $M$-matrix. Mathematics of Computation, 31(137):148-162, 1977.

 1976
1. F. G. Gustavson. Finding the block lower-triangular form of a sparse matrix. In J. R. Bunch and D. J. Rose, editors, Sparse Matrix Computations, pages 275-289. Academic Press, New York and London, 1976.

2. I. S. Duff, A. M. Erisman, and J. K. Reid. On George's nested dissection method. SIAM Journal on Numerical Analysis, 13(5):686-695, 1976.

3. N. E. Gibbs, W. G. Poole, and P. K. Stockmeyer. An algorithm for reducing the bandwidth and profile of a sparse matrix. SIAM Journal on Numerical Analysis, 13(2):236-250, 1976.

4. W.-H. Liu and A. H. Sherman. Comparative analysis of the Cuthill-McKee and the Reverse Cuthill--McKee ordering algorithms for sparse matrices. SIAM Journal on Numerical Analysis, 13(2):198-213, 1976.

5. 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.

 1975
1. R. A. Willoughby. A characterization of matrix irreducibility. In L. Collatz, G. Meinardus, and H. Werner, editors, Numerische Methoden bei Graphentheoretischen und Kombinatorischen Problemen, volume 29 of International Series of Numerical Mathematics, pages 131-143. Birkhäuser Verlag, 1975.

 1974
1. A. George. On block elimination for sparse linear systems. SIAM Journal on Numerical Analysis, 11(3):585-603, 1974.

 1973
1. A. George. Nested dissection of a regular finite element mesh. SIAM Journal on Numerical Analysis, 10(2):345-363, 1973.

2. 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.

3. J. E. Hopcroft and R. M. Karp. An $n^{5/2}$ algorithm for maximum matchings in bipartite graphs. SIAM Journal on Computing, 2(4):225-231, 1973. Keyword(s): Matching.

 1972
1. 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.

2. R. E. Tarjan. Depth-first search and linear graph algorithms. SIAM Journal on Computing, 1(2):146-160, 1972.

 1970
1. B. M. Irons. A frontal solution program for finite-element analysis. International Journal for Numerical Methods in Engineering, 2(1):5-32, 1970.

2. B. W. Kernighan and S. Lin. An efficient heuristic procedure for partitioning graphs. The Bell System Technical Journal, 49:291-307, February 1970.

3. 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.

 1967
1. W. F. Tinney and J. W. Walker. Direct solutions of sparse network equations by optimally ordered triangular factorization. Proceedings of the IEEE, 55(11):1801-1809, Nov. 1967. Keyword(s): Minimum degree algorithm.

 1963
1. A. L. Dulmage and N. S. Mendelsohn. Remarks on solutions of the optimal assignment problem. SIAM Journal on Applied Mathematics, 11(4):1103-1109, 1963.

2. A. L. Dulmage and N. S. Mendelsohn. Two algorithms for bipartite graphs. SIAM Journal on Applied Mathematics, 11(1):183-194, 1963.

 1961
1. S. Parter. The use of linear graphs in Gauss elimination. SIAM Review, 3(2):119-130, 1961. Keyword(s): Elimination process.

 1959
1. A. L. Dulmage and N. S. Mendelsohn. A structure theory of bipartite graphs of finite exterior dimension. Trans. Roy. Soc. Can. Sec. III, 53:1-13, 1959.

 1958
1. A. L. Dulmage and N. S. Mendelsohn. Coverings of bipartite graphs. Canadian Journal of Mathematics, 10:517-534, 1958.

 1957
1. C. Berge. Two theorems in graph theory. Proceedings of the National Academy of Sciences of the USA, 43:842-844, 1957. Keyword(s): Matching, Alternating path, Augmenting path, Vertex cover.

2. H. M. Markowitz. The elimination form of the inverse and its application to linear programming. Management Science, 3:255-269, 1957.

 1956
1. M. Hall, Jr.. An algorithm for distinct representatives. The American Mathematical Monthly, 63(10):716-717, 1956.

 1955
1. H. W. Kuhn. The Hungarian method for the assignment problem. Naval Research Logistics Quarterly, 2(1--2):83-97, 1955.

 1935
1. P. Hall. On representatives of subsets. Journal of the London Mathematical Society, s1-10(37):26-30, 1935.

BACK TO INDEX