BACK TO INDEX

 Publications on CSC sorted by year
 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. [bibtex-key = caau:10]

 2009
1. R. A. Brualdi and D. M. Cvetkovic. A Combinatorial Approach to Matrix Theory and its Applications. Chapman & Hall/CRC Press, Boca Raton, 2009. Keyword(s): Matrix power, Determinant, Matrix inverse, Linear system solution. [bibtex-key = brcv:09]

2. R. Burkard, M. Dell'Amico, and S. Martello. Assignment Problems. SIAM, Philadelphia, PA, USA, 2009. [bibtex-key = budm:09]

3. M. Manguoglu, A. Sameh, and O. Schenk. PSPIKE: Parallel sparse linear system solver. In In Proc. Euro-Par 2009 Parallel Processing, pages 797-808, 2009. [bibtex-key = mass:09]

4. R. H. Bisseling. Combinatorial problems in high-performance computing. Presentation at Dagstuhl Seminar on Combinatorial Scientific Computing (09061), February 2009. [bibtex-key = biss:09]

5. A. Pothen. Graph matchings in combinatorial scientific computing (Vertex-weighted and parallel edge-weighted). Presentation at Dagstuhl Seminar on Combinatorial Scientific Computing (09061), February 2009. [bibtex-key = poth:09]

 2008
1. E. Agullo. On the out-of-core factorization of large sparse matrices. PhD thesis, Ecole Normale Supérieure de Lyon, Lyon, France, 2008. [bibtex-key = agul:08]

2. M. Halappanavar. Algorithms for Vertex-Weighted Matching in Graphs. PhD thesis, Old Dominion University, Norfolk, Virginia, USA, 2008. [bibtex-key = maha:09]

3. 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. [bibtex-key = aggl:08]

4. M. Elkin, Y. Emek, D. A. Spielman, and S.-H. Teng. Lower-stretch spanning trees. SIAM Journal on Computing, 38(2):608-628, 2008. [bibtex-key = eest:08]

5. 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. [bibtex-key = herr:08]

6. 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. [bibtex-key = sfny:08]

7. F. Manne and R. H. Bisseling. A parallel approximation algorithm for the weighted maximum matching problem. In Roman Wyrzykowski, Konrad Karczewski, Jack Dongarra, and Jerzy Wasniewski, editors, Parallel Processing and Applied Mathematics, volume 4967 of Lecture Notes in Computer Science, pages 708-717, 2008. [bibtex-key = mabi:07]

8. S. Toledo and A. Uchitel. A supernodal out-of-core sparse Gaussian-elimination method. In Roman Wyrzykowski, Konrad Karczewski, Jack Dongarra, and Jerzy Wasniewski, editors, 7th International Conference on Parallel Processing and Applied Mathematics (PPAM 2007),, volume 4967 of Lecture Notes in Computer Science, pages 728-737, 2008. Springer-Verlag Berlin Heidelberg. [bibtex-key = touc:08]

9. J. K. Reid and J. A. Scott. An efficient out-of-core sparse symmetric indefinite direct solver. Technical report RAL-TR-2008-024, Computational Sciences and Engineering Department, Rutherford Appleton Laboratory, Oxon, OX11 0QX, England, December 2008. [bibtex-key = resc:08]

10. F. Pellegrini. SCOTCH 5.1 User's Guide. Laboratoire Bordelais de Recherche en Informatique (LaBRI), 2008. Keyword(s): Graph partitioning, Sparse matrix ordering, Nested dissection. [bibtex-key = pell:08:scotch]

11. I. S. Duff, D. Ruiz, and B. Uçar. Computing a class of bipartite matchings in parallel. Presentation at SIAM 13th Conference on Parallel Processing for Scientific Computing (PP08), Atlanta, GA, USA, March 2008. Keyword(s): Matching. [bibtex-key = duru:08]

 2007
1. I. Koutis. Combinatorial and algebraic tools for multigrid algorithms. PhD thesis, Carnegie Mellon University, Pittsburgh, May 2007. [bibtex-key = kout:07]

2. 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. [bibtex-key = alol:07]

3. 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. [bibtex-key = frfs:07]

4. S. Maclachlan and Y. Saad. A greedy strategy for coarse-grid selection. SIAM Journal on Scientific Computing, 29(5):1825-1853, 2007. [bibtex-key = masa:07]

5. 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. [bibtex-key = ucay:07a]

6. E. Agullo, A. Guermouche, and J.-Y. L'Excellent. Reducing the I/O volume in an out-of-core sparse multifrontal solver. In S. Aluru, M. Parashar, R. Badrinath, and V. K. Prasanna, editors, High Performance Computing -- HiPC2007; 14th International Conference, volume 4873 of Lecture Notes in Computer Science, pages 260-280, 2007. Keyword(s): Out-of-core factorization, Multifrontal method, Task scheduling, Elimination tree. [bibtex-key = aggl:07]

7. B. Hendrickson and A. Pothen. Combinatorial scientific computing: The enabling power of discrete algorithms in computational science. In M. Dayde, M. L. M. Palma, L. G. A. Coutinho, E. Pacitti, and J. C. Lopes, editors, High Performance Computing for Computational Science---VECPAR 2006, volume 4395 of Lecture Notes in Computer Science, pages 260-280, 2007. Keyword(s): Minimum degree ordering algorithm, Coloring, Jacobian matrix, Sparse Hessian matrix. [bibtex-key = hepo:07]

 2006
1. R. A. Brualdi. Combinatorial Matrix Classes, volume 108 of Encyclopedia of Mathematics and its Applications. Cambridge University Press, 2006. [bibtex-key = brua:06]

2. T. A. Davis. Direct Methods for Sparse Linear Systems, number 2 of Fundamentals of Algorithms. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 2006. [bibtex-key = davi:06]

3. 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. [bibtex-key = cfht:06]

4. 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. [bibtex-key = debk:06]

5. 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. [bibtex-key = aglp:06]

6. 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. [bibtex-key = bghn:06]

7. M. Bollhöfer and O. Schenk. Combinatorial aspects in sparse elimination methods. GAMM Mitteilungen, 29:342-367, 2006. [bibtex-key = bosh:06]

8. A. Guermouche and J.-Y. L'Excellent. Constructing memory-minimizing schedules for multifrontal methods. ACM Transactions on Mathematical Software, 32(1):17-32, 2006. [bibtex-key = gule:06]

9. 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. [bibtex-key = lern:06]

10. 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. [bibtex-key = meit:06]

11. 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. [bibtex-key = styh:06]

12. M. W. Gee, C. M. Siefert, J. J. Hu, R. S. Tuminaro, and M. G. Sala. ML 5.0 smoothed aggregation user's guide. Technical report SAND2006-2649, Sandia National Laboratories, 2006. [bibtex-key = ml-guide:06]

13. J. K. Reid and J. A. Scott. An out-of-core sparse Cholesky solver. Technical report RAL-TR-2006-013, Computational Sciences and Engineering Department, Rutherford Appleton Laboratory, Oxon, OX11 0QX, England, 2006. [bibtex-key = resc:06b]

 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. [bibtex-key = bime:06]

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. [bibtex-key = dupr:05]

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. [bibtex-key = eili:05b]

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. [bibtex-key = eili:05]

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. [bibtex-key = gemp:05]

6. H. W. Kuhn. Statement for Naval Research Logistics. Naval Research Logistics, 52(1):6, 2005. [bibtex-key = kuhn:05b]

7. H. W. Kuhn. The Hungarian method for the assignment problem. Naval Research Logistics, 52(1):7-21, 2005. [bibtex-key = kuhn:05]

8. Y. Saad. Multilevel ILU with reorderings for diagonal dominance. SIAM Journal on Scientific Computing, 27(3):1032-1057, 2005. [bibtex-key = saad:05]

9. D. Bozdag, Ü. V. Çatalyürek, A. H. Gebremedhin, F. Manne, E. G. Boman, and F. Özgüner. A parallel distance-2 graph coloring algorithm for distributed memory computers. In L. T. Yang, O. F. Rana, B. Di Martino, and J. Dongarra, editors, Proceedings of 2005 International Conference on High Performance Computing and Communications (HPCC-05), volume 3726 of Lecture Notes in Computer Science, pages 796-806, 2005. [bibtex-key = bcgm:05]

10. M. Sala and M. Heroux. Robust algebraic preconditioners with IFPACK 3.0. Technical report SAND-0662, Sandia National Laboratories, 2005. [bibtex-key = ifpack-guide]

 2004
1. R. H. Bisseling. Parallel Scientific Computation: A Structured Approach using BSP and MPI. Oxford University Press, Oxford, UK, March 2004. Keyword(s): Sparse matrix-vector multiplication, Fast Fourier Transform, Wavelet, Bulk synchronous parallel, Parallel computing, Message passing interface. [bibtex-key = biss:04]

2. 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. [bibtex-key = amdv:04]

3. 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. [bibtex-key = bchs:04]

4. 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. [bibtex-key = roto:04]

5. D. A. Spielman and S.-H. Teng. Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems. In STOC'04: Proceedings of the 36th annual ACM symposium on Theory of computing, New York, NY, USA, pages 81-90, 2004. ACM. [bibtex-key = spte:04]

6. J. Riedy and J. Demmel. Parallel weighted bipartite matching and applications. Presentation at SIAM 11th Conference on Parallel Processing for Scientific Computing (PP04), San Francisco, CA, USA, February 2004. Keyword(s): Matching. [bibtex-key = ride:04]

 2003
1. Y. Saad. Iterative Methods for Sparse Linear Systems. SIAM, Philadelphia, 2nd edition, 2003. [bibtex-key = saad:03]

2. E. G. Boman and B. Hendrickson. Support theory for preconditioning. SIAM Journal on Matrix Analysis and Applications, 25(3):694-717, 2003. [bibtex-key = bohe:03]

3. D. Chen and S. Toledo. Vaidya's preconditioners: Implementation and experimental study. Electronic Transactions on Numerical Analysis, 16:30-49, 2003. [bibtex-key = chto:03]

4. 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. [bibtex-key = gulu:03]

5. 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. [bibtex-key = kixz:03]

6. Y. Saad. Finding exact and approximate block structures for ILU preconditioning. SIAM Journal on Scientific Computing, 24(4):1107-1123, 2003. [bibtex-key = saad:03b]

7. D. A. Spielman and S.-H. Teng. Solving sparse, symmetric, diagonally dominant linear systems in time $\mathcal{O}(m^{1.31})$. In 44th Annual IEEE Symposium on Foundations of Computer Science, pages 416-427, 2003. IEEE. [bibtex-key = spte:03]

 2002
1. M. Benzi. Preconditioning techniques for large linear systems: A survey. Journal of Computational Physics, 182(2):418-477, 2002. [bibtex-key = benz:02]

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. [bibtex-key = gupt:02]

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

4. C. Walshaw. The Parallel JOSTLE Library User's Guide, Version 3.0. University of Greenwich, London, UK, 2002. [bibtex-key = wals:02:jostle]

 2001
1. F. Dobrian. External Memory Algorithms for Factoring Sparse Matrices. PhD thesis, Old Dominion University, Norfolk, Virginia, USA, 2001. [bibtex-key = dobr:01]

2. 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. [bibtex-key = adlk:01]

3. 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. [bibtex-key = boll:01]

4. R. Bridson and W.-P. Tang. A structural diagnosis of some IC orderings. SIAM Journal on Scientific Computing, 22(5):1527-1532, 2001. [bibtex-key = brta:01]

5. 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. [bibtex-key = duko:01]

6. D. Hysom and A. Pothen. A scalable parallel algorithm for incomplete factor preconditioning. SIAM Journal on Scientific Computing, 22(6):2194-2215, 2001. [bibtex-key = hypo:01]

7. J. Schulze. Towards a tighter coupling of bottom-up and top-down sparse matrix ordering methods. BIT Numerical Mathematics, 41(4):800-841, 2001. [bibtex-key = schu:01]

8. K. Stüben. A review of algebraic multigrid. Journal of Computational and Applied Mathematics, 128(1--2):281-309, 2001. [bibtex-key = stub:01]

9. Ü. V. Çatalyürek and C. Aykanat. A fine-grain hypergraph model for $2$D decomposition of sparse matrices. In Proceedings of the 15th International Parallel and Distributed Processing Symposium (IPDPS, San Francisco, CA, 2001. Keyword(s): Sparse matrix-vector multiplication, Hypergraph partitioning, Hypergraph model, Communication cost. [bibtex-key = caay:01]

10. P. Heggernes, S. C. Eisenstat, G. Kumfert, and A. Pothen. The computational complexity of the minimum degree algorithm. In Proceedings of NIK 2001---14th Norwegian Computer Science Conference, Tromso, Norway, pages 98-109, 2001. [bibtex-key = hekp:01]

 2000
1. R. S. Varga. Matrix Iterative Analysis. Springer, Berlin, Heidelberg, New York, Second edition, 2000. [bibtex-key = varg:00]

2. 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. [bibtex-key = amde:00]

3. 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. [bibtex-key = beht:00]

4. M. Benzi and M. Tůma. Orderings for factorized sparse approximate inverse preconditioners. SIAM Journal on Scientific Computing, 21(5):1851-1868, 2000. [bibtex-key = betu:00]

5. E. Chow. A priori sparsity patterns for parallel sparse approximate inverse preconditioners. SIAM Journal on Scientific Computing, 21(5):1804-1822, 2000. [bibtex-key = chow:00]

6. 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. [bibtex-key = heko:00]

7. R. S. Tuminaro and C. Tong. Parallel smoothed aggregation multigrid: Aggregation strategies on massively parallel machines. In Supercomputing '00: Proceedings of the 2000 ACM/IEEE conference on Supercomputing (CDROM), Washington, DC, USA, pages 5, 2000. IEEE Computer Society. [bibtex-key = tuto:00]

 1999
1. G. A. Meurant. Computer Solution of Large Linear Systems, volume 28 of Studies in Mathematics and Its Applications. North-Holland, Amsterdam, Netherlands, 1999. [bibtex-key = meur:99]

2. 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. [bibtex-key = ngpr:99]

3. Ü. 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. [bibtex-key = caay:99]

4. 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. [bibtex-key = besd:99]

5. 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. [bibtex-key = degll:99]

6. 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. [bibtex-key = duko:99]

7. 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. [bibtex-key = duvo:99]

8. J. R. Gilbert and S. Toledo. High-performance out-of-core sparse LU factorization. In 9th SIAM Conference on Parallel Processing for Scientific Computing (CDROM), pages p.10, 1999. [bibtex-key = gito:99]

9. Ü. V. Çatalyürek and C. Aykanat. PaToH: A multilevel hypergraph partitioning tool, Version 3.0. Bilkent University, Department of Computer Engineering, Ankara, 06533 Turkey. PaToH is available at http://bmi.osu.edu/umit/software.htm, 1999. Keyword(s): Hypergraph partitioning. [bibtex-key = caay:99a]

 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. [bibtex-key = aslu:98]

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. [bibtex-key = hero:98]

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

4. G. Karypis and V. Kumar. MeTiS: A software package for partitioning unstructured graphs, partitioning meshes, and computing fill-reducing orderings of sparse matrices version 4.0. University of Minnesota, Department of Comp. Sci. and Eng., Army HPC Research Center, Minneapolis, 1998. Keyword(s): Graph partitioning, Sparse matrix ordering, Nested dissection. [bibtex-key = kaku:98:metis]

 1997
1. C. Ashcraft and J. W. H. Liu. Using domain decomposition to find graph bisectors. BIT, 37(3):506-534, 1997. [bibtex-key = aslu:97]

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. [bibtex-key = chsa:97]

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. [bibtex-key = dadu:97]

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

5. G. Karypis and V. Kumar. Parallel threshold-based ILU factorization. In Supercomputing '97: Proceedings of the 1997 ACM/IEEE conference on Supercomputing (CDROM), New York, NY, USA, pages 1-24, 1997. ACM. [bibtex-key = kaku:97]

6. S. Guattery. Graph embedding techniques for bounding condition numbers of incomplete factor preconditioners. Technical report ICASE Report No.97-47, Institute for Computer Applications in Science and Engineering, NASA Langley Research Center, Hampton, Virginia, 1997. [bibtex-key = guat:97]

 1996
1. K. D. Gremban. Combinatorial Preconditioners for Sparse, Symmetric, Diagonally Dominant Linear Systems. PhD thesis, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA, USA, 1996. [bibtex-key = grem:96]

2. A. Joshi. Topics in Optimization and Sparse Linear Systems. PhD thesis, Department of Computer Science, University of Illinois Urbana-Champaign, Urbana, IL, USA, December 1996. [bibtex-key = josh:96]

3. 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. [bibtex-key = amdd:96]

4. 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. [bibtex-key = bemt:96]

5. M. Olschowka and A. Neumaier. A new pivoting strategy for Gaussian elimination. Linear Algebra and Its Applications, 240:131-151, 1996. [bibtex-key = olne:96]

6. C. Ashcraft and J. W. H. Liu. A partition improvement algorithm for generalized nested dissection. Technical report BCSTECH-94-020, Boeing Computer Services, Seattle, WA, USA, 1996. [bibtex-key = aslu:96]

7. A. Gupta. Fast and effective algorithms for graph partitioning and sparse matrix ordering. Technical report RC 20496 (90799), IBM Research Division, T. J. Watson Research Center, Yorktown Heights, NY, USA, 1996. [bibtex-key = gupt:96]

 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. [bibtex-key = ashc:95]

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. [bibtex-key = clta:95]

3. K. D. Gremban, G. L. Miller, and M. Zagha. Performance evaluation of a parallel preconditioner. In 9th International Parallel Processing Symposium, Santa Barbara, pages 65-69, April 1995. IEEE. [bibtex-key = grmz:95]

4. B. Hendrickson and R. Leland. A multilevel algorithm for partitioning graphs. In Supercomputing '95: Proceedings of the 1995 ACM/IEEE conference on Supercomputing (CDROM), New York, NY, USA, pages 28, 1995. ACM. [bibtex-key = heli:95]

5. B. Hendrickson and R. Leland. The Chaco user's guide, version 2.0. Sandia National Laboratories, Alburquerque, NM, 87185, 1995. Keyword(s): Graph partitioning, Sparse matrix ordering, Nested dissection. [bibtex-key = heli:95chaco]

 1994
1. O. Axelsson. Iterative solution methods. Cambridge University Press, Cambridge, 1994. [bibtex-key = axel:94]

2. V. Kumar, A. Grama, A. Gupta, and G. Karypis. Introduction to Parallel Computing: Desing and Analysis of Algorithms. The Benjamin/Cummings Publishing Company, Inc., 1994. [bibtex-key = kggk:94]

3. 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. [bibtex-key = basi:94]

4. Y. Saad. ILUT: A dual threshold incomplete LU factorization. Numerical Linear Algebra with Applications, 1(4):387-402, 1994. [bibtex-key = saad:94]

 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. [bibtex-key = bhln:93]

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. [bibtex-key = gili:93]

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. [bibtex-key = linp:93]

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. [bibtex-key = posu:93]

5. R. H. Bisseling. Parallel Iterative Solution of Sparse Linear Systems on a Transputer Network. In A. E. Fincham and B. Ford, editors, Parallel Computation, volume 46 of The Institute of Mathematics and its Applications Conference Series. New Series, pages 253-271, 1993. Oxford University Press, Oxford, UK. Keyword(s): GMRES, Cyclic distribution, Sparse matrix-vector multiplication, Communication cost. [bibtex-key = biss93]

6. T. N. Bui and C. Jones. A heuristic for reducing fill-in in sparse matrix factorization. In 6th SIAM Conference on Parallel Processing for Scientific Computing, Norfolk, Virginia, USA, pages 445-452, 1993. Keyword(s): Graph partitioning, Multilevel algorithm. [bibtex-key = bujo:93]

 1992
1. M. Marcus and H. Minc. A Survey of Matrix Theory and Matrix Inequalities. Dover, (Unabridged, unaltered republication of the corrected (1969) printing of the work published by Prindle, Weber, & Schmidt, Boston, 1964), 1992. [bibtex-key = mami:92]

2. R. A. Brualdi. The symbiotic relationship of combinatorics and matrix theory. Linear Algebra and its Applications, 162--164:65-105, 1992. [bibtex-key = brua:92]

3. 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. [bibtex-key = azft:92]

4. 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. [bibtex-key = azft:92b]

5. 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. [bibtex-key = gims:92]

6. J. R. Gilbert and R. Schreiber. Highly parallel sparse Cholesky factorization. SIAM Journal on Scientific and Statistical Computing, 13(5):1151-1172, 1992. [bibtex-key = gisc:92]

7. R. Greenlaw. A model classifying algorithms as inherently sequential with applications to graph searching. Information and Computation, 97(2):133-149, 1992. [bibtex-key = gree:92]

8. J. W. H. Liu. The multifrontal method for sparse matrix solution: Theory and practice. SIAM Review, 34(1):82-109, 1992. [bibtex-key = liu:92]

 1991
1. R. A. Brualdi and H. J. Ryser. Combinatorial Matrix Theory, volume 39 of Encyclopedia of Mathematics and its Applications. Cambridge University Press, 1991. [bibtex-key = brry:91]

2. 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. [bibtex-key = abmp:91]

3. M. T. Heath, E. Ng, and B. W. Peyton. Parallel algorithms for sparse linear systems. SIAM Review, 33(3):420-460, 1991. [bibtex-key = henp:91]

4. P. M. Vaidya. Solving linear equations with symmetric diagonally dominant matrices by constructing good preconditioners. Note: Unpublished manuscript presented at the IMA Workshop on Graph Theory and Sparse Matrix Computation, October 1991. [bibtex-key = vaid:91]

 1990
1. T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. MIT Press, First edition, 1990. [bibtex-key = colr:90]

2. 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. [bibtex-key = dddh:90]

3. 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. [bibtex-key = liu:90]

4. 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. [bibtex-key = onsz:90]

5. A. Pothen and C.-J. Fan. Computing the block triangular form of a sparse matrix. ACM Transactions on Mathematical Software, 16:303-324, 1990. [bibtex-key = pofa:90]

6. 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. [bibtex-key = posl:90]

 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. [bibtex-key = asgr:89]

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

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. [bibtex-key = geng:89]

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. [bibtex-key = geli:89]

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. [bibtex-key = geln:88]

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. [bibtex-key = liu:89]

 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. [bibtex-key = degr:88]

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. [bibtex-key = gipe:88]

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. [bibtex-key = liu:88]

 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. [bibtex-key = rust:87]

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. [bibtex-key = feta:87]

3. J. R. Gilbert and R. E. Tarjan. The analysis of a nested dissection algorithm. Numerische Mathematik, 50(4):377-404, 1987. [bibtex-key = gita:87]

 1986
1. I. S. Duff, A. M. Erisman, and J. K. Reid. Direct Methods for Sparse Matrices. Oxford University Press, London, 1986. [bibtex-key = duer:86]

2. L. Lovasz and M. D. Plummer. Matching Theory, North-Holland mathematics studies. Elsevier Science Publishers, Amsterdam, Netherlands, 1986. [bibtex-key = lopl:86]

3. 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. [bibtex-key = liu:86b]

4. 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. [bibtex-key = liu:86]

5. 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. [bibtex-key = luby:86]

 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. [bibtex-key = liu:85]

2. J. H. Reif. Depth-first search is inherently sequential. Information Processing Letters, 20(5):229-234, 1985. [bibtex-key = reif:85]

3. H. D. Simon. Incomplete LU preconditioners for conjugate-gradient-type iterative methods. In Proceedings of the 1985 Reservoir Simulation Symposium, Dallas, pages 387-396, February 1985. [bibtex-key = simo:85]

 1984
1. A. Pothen. Sparse Null Bases and Marriage Theorems. PhD thesis, Department of Computer Science, Cornell University, Ithaca, New York, 1984. [bibtex-key = po:phd]

2. 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. [bibtex-key = dure:84]

3. D. J. Rose. Convergent regular splittings for singular $M$-matrices. SIAM Journal on Algebraic and Discrete Methods, 5(1):133-144, 1984. [bibtex-key = rose:84]

 1983
1. R. E. Tarjan. Data Structures and Network Algorithms, volume 44 of CBMS-NSF Regional Conference Series in Applied Mathematics. SIAM, Philadelphia, PA, USA, 1983. [bibtex-key = tarj:83]

2. 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. [bibtex-key = dure:83b]

3. 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. [bibtex-key = dure:83]

 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. [bibtex-key = egss:82]

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. [bibtex-key = jeke:82]

3. R. Schreiber. A new implementation of sparse Gaussian elimination. ACM Transactions on Mathematical Software, 8(3):256-276, 1982. [bibtex-key = schr:82]

4. I. S. Duff. Full matrix techniques in sparse Gaussian elimination. In G. A. Watson, editor, Proceedings of 1981 Dundee Biennal Conference on Numerical Analysis, volume 912 of Lecture Notes in Mathematics, pages 71-84, 1982. [bibtex-key = duff:81]

5. C. M. Fiduccia and R. M. Mattheyses. A linear-time heuristic for improving network partitions. In DAC '82: Proceedings of the 19th Conference on Design Automation, Piscataway, NJ, USA, pages 175-181, 1982. IEEE Press. [bibtex-key = fima:82]

6. I. S. Duff and J. K. Reid. MA27--A set of Fortran subroutines for solving sparse symmetric sets of linear equations. Technical report AERE R10533, HMSO, London, UK, 1982. [bibtex-key = dure:ma27:82]

 1981
1. A. George and J. W. H. Liu. Computer Solution of Large Sparse Positive Definite Systems. Prentice-Hall, Englewood Cliffs, N.J., 1981. [bibtex-key = geli:81]

2. I. S. Duff. Algorithm 575: Permutations for a zero-free diagonal. ACM Transactions on Mathematical Software, 7(3):387-390, 1981. [bibtex-key = duff:81d]

3. I. S. Duff. On algorithms for obtaining a maximum transversal. ACM Transactions on Mathematical Software, 7(3):315-330, 1981. [bibtex-key = duff:81c]

4. M. Yannakakis. Computing the minimum fill-in is NP-complete. SIAM Journal on Algebraic and Discrete Methods, 2(1):77-79, 1981. [bibtex-key = yann:81]

 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. [bibtex-key = geor:80]

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. [bibtex-key = geli:80]

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. [bibtex-key = geli:80b]

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. [bibtex-key = gilb:80]

 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. [bibtex-key = lirt:79]

2. R. J. Lipton and R. E. Tarjan. A separator theorem for planar graphs. SIAM Journal on Applied Mathematics, 36:177-189, 1979. [bibtex-key = lita:79]

 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. [bibtex-key = dure:78b]

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. [bibtex-key = dure:78a]

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. [bibtex-key = geli:78]

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. [bibtex-key = gemc:78]

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. [bibtex-key = gepv:78]

6. I. Gustafsson. A class of first order factorization methods. BIT Numerical Mathematics, 18(2):142-156, 1978. [bibtex-key = gust:78]

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. [bibtex-key = rota:78]

8. B. Speelpenning. The generalized element method. Technical report UIUCDCS-R-78-946, Department of Computer Science, University of Illinois at Urbana-Champaign, Illinois, 1978. [bibtex-key = spee:78]

 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. [bibtex-key = duff:77]

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. [bibtex-key = mevo:77]

 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. [bibtex-key = gust:76]

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. [bibtex-key = duer:76]

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. [bibtex-key = gips:76]

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. [bibtex-key = lish:76]

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. [bibtex-key = rotl:76]

 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. [bibtex-key = will:75]

 1974
1. A. George. On block elimination for sparse linear systems. SIAM Journal on Numerical Analysis, 11(3):585-603, 1974. [bibtex-key = geor:74]

2. 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. [bibtex-key = rowh:74]

 1973
1. A. George. Nested dissection of a regular finite element mesh. SIAM Journal on Numerical Analysis, 10(2):345-363, 1973. [bibtex-key = geor:73]

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. [bibtex-key = homr:73]

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. [bibtex-key = hoka:73]

 1972
1. I. S. Duff. Analysis of Sparse Systems. PhD thesis, Oxford University, England, 1972. [bibtex-key = duff:72]

2. 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. [bibtex-key = rose:72]

3. R. E. Tarjan. Depth-first search and linear graph algorithms. SIAM Journal on Computing, 1(2):146-160, 1972. [bibtex-key = tarj:72]

 1971
1. A. J. George. Computer Implementation of the Finite Element Method. PhD thesis, Stanford University, Stanford, CA, USA, 1971. [bibtex-key = geor:71]

 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. [bibtex-key = iron:70]

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

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. [bibtex-key = rose:70]

 1969
1. E. Cuthill and J. McKee. Reducing the bandwidth of sparse symmetric matrices. In Proceedings of the 24th national conference, New York, NY, USA, pages 157-172, 1969. ACM. [bibtex-key = cumc:69]

 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. [bibtex-key = tiwa:67]

 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. [bibtex-key = dume:63b]

2. A. L. Dulmage and N. S. Mendelsohn. Two algorithms for bipartite graphs. SIAM Journal on Applied Mathematics, 11(1):183-194, 1963. [bibtex-key = dume:63a]

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

 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. [bibtex-key = dume:59]

 1958
1. A. L. Dulmage and N. S. Mendelsohn. Coverings of bipartite graphs. Canadian Journal of Mathematics, 10:517-534, 1958. [bibtex-key = dume:58]

 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. [bibtex-key = berg:57]

2. H. M. Markowitz. The elimination form of the inverse and its application to linear programming. Management Science, 3:255-269, 1957. [bibtex-key = mark:57]

 1956
1. M. Hall, Jr.. An algorithm for distinct representatives. The American Mathematical Monthly, 63(10):716-717, 1956. [bibtex-key = hall:56]

 1955
1. H. W. Kuhn. The Hungarian method for the assignment problem. Naval Research Logistics Quarterly, 2(1--2):83-97, 1955. [bibtex-key = kuhn:55]

 1935
1. P. Hall. On representatives of subsets. Journal of the London Mathematical Society, s1-10(37):26-30, 1935. [bibtex-key = hall:35]

BACK TO INDEX