| Publication | Date of Publication | Type |
|---|
| Combinatorial BLAS 2.0: Scaling combinatorial algorithms on distributed-memory systems | 2021-06-28 | Paper |
An empirical comparison of graph Laplacian solvers 2016 Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-12 | Paper |
Parallel Sparse Matrix-Matrix Multiplication and Indexing: Implementation and Experiments SIAM Journal on Scientific Computing | 2012-10-26 | Paper |
| Implementing sparse matrices for graph algorithms | 2012-01-05 | Paper |
| scientific article; zbMATH DE number 5994653 (Why is no real title available?) | 2012-01-05 | Paper |
| scientific article; zbMATH DE number 5994655 (Why is no real title available?) | 2012-01-05 | Paper |
| New ideas in sparse matrix matrix multiplication | 2012-01-05 | Paper |
| scientific article; zbMATH DE number 5994667 (Why is no real title available?) | 2012-01-05 | Paper |
Solving path problems on the GPU Parallel Computing | 2010-09-02 | Paper |
Symbolic and Exact Structure Prediction for Sparse Gaussian Elimination with Partial Pivoting SIAM Journal on Matrix Analysis and Applications | 2009-11-06 | Paper |
Obtaining bounds on the two norm of a matrix from the splitting lemma ETNA - Electronic Transactions on Numerical Analysis | 2007-03-16 | Paper |
Obtaining bounds on the two norm of a matrix from the splitting lemma ETNA - Electronic Transactions on Numerical Analysis | 2007-03-16 | Paper |
A column approximate minimum degree ordering algorithm ACM Transactions on Mathematical Software | 2005-07-22 | Paper |
Algorithm 836 ACM Transactions on Mathematical Software | 2005-07-22 | Paper |
A Note on the Column Elimination Tree SIAM Journal on Matrix Analysis and Applications | 2004-01-18 | Paper |
Computing row and column counts for sparse \(QR\) and \(LU\) factorization BIT | 2002-09-19 | Paper |
An assessment of incomplete-LU preconditioners for nonsymmetric linear systems Informatica (Ljubljana) | 2001-10-01 | Paper |
Export restrictions, urban unemployment, and the location of processing activities Economics Letters | 2001-08-20 | Paper |
Geometric Mesh Partitioning: Implementation and Experiments SIAM Journal on Scientific Computing | 1998-09-21 | Paper |
Separators and structure prediction in sparse orthogonal factorization Linear Algebra and its Applications | 1998-02-22 | Paper |
Algorithms for automatic alignment of arrays. Journal of Parallel and Distributed Computing | 1997-08-07 | Paper |
Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree Journal of Algorithms | 1995-08-20 | Paper |
Generating local addresses and communication sets for data-parallel programs Journal of Parallel and Distributed Computing | 1995-07-06 | Paper |
An Efficient Algorithm to Compute Row and Column Counts for Sparse Cholesky Factorization SIAM Journal on Matrix Analysis and Applications | 1994-11-16 | Paper |
Provably good mesh generation Journal of Computer and System Sciences | 1994-11-01 | Paper |
| scientific article; zbMATH DE number 434582 (Why is no real title available?) | 1994-09-20 | Paper |
| scientific article; zbMATH DE number 554767 (Why is no real title available?) | 1994-05-26 | Paper |
Predicting Structure in Sparse Matrix Computations SIAM Journal on Matrix Analysis and Applications | 1994-04-19 | Paper |
| scientific article; zbMATH DE number 219228 (Why is no real title available?) | 1993-06-29 | Paper |
Elimination Structures for Unsymmetric Sparse $LU$ Factors SIAM Journal on Matrix Analysis and Applications | 1993-06-29 | Paper |
Drawing the planar dual Information Processing Letters | 1993-01-16 | Paper |
Highly Parallel Sparse Cholesky Factorization SIAM Journal on Scientific and Statistical Computing | 1993-01-16 | Paper |
Sparse Matrices in MATLAB: Design and Implementation SIAM Journal on Matrix Analysis and Applications | 1992-06-28 | Paper |
Parallel symbolic factorization of sparse linear systems Parallel Computing | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4076453 (Why is no real title available?) | 1988-01-01 | Paper |
Sparse Partial Pivoting in Time Proportional to Arithmetic Operations SIAM Journal on Scientific and Statistical Computing | 1988-01-01 | Paper |
A parallel algorithm for sparse symbolic Cholesky factorization on a multiprocessor Parallel Computing | 1988-01-01 | Paper |
The analysis of a nested dissection algorithm Numerische Mathematik | 1987-01-01 | Paper |
Computing a Sparse Basis for the Null Space SIAM Journal on Algebraic Discrete Methods | 1987-01-01 | Paper |
A parallel graph partitioning algorithm for a message-passing multiprocessor International Journal of Parallel Programming | 1987-01-01 | Paper |
Predicting fill for sparse orthogonal factorization Journal of the ACM | 1986-01-01 | Paper |
A Separator Theorem for Chordal Graphs SIAM Journal on Algebraic Discrete Methods | 1984-01-01 | Paper |
A separator theorem for graphs of bounded genus Journal of Algorithms | 1984-01-01 | Paper |
Graph Coloring Using Eigenvalue Decomposition SIAM Journal on Algebraic Discrete Methods | 1984-01-01 | Paper |
The Pebbling Problem is Complete in Polynomial Space SIAM Journal on Computing | 1980-01-01 | Paper |
A Note on the NP-Completeness of Vertex Elimination on Directed Graphs SIAM Journal on Algebraic Discrete Methods | 1980-01-01 | Paper |
Errata: Geodetic orientations of complete \(k\)-partite graphs Journal of Combinatorial Theory. Series B | 1976-01-01 | Paper |
Geodetic orientations of complete \(k\)-partite graphs Journal of Combinatorial Theory. Series B | 1975-01-01 | Paper |