| 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 | 2019-09-12 | Paper |
| Parallel Sparse Matrix-Matrix Multiplication and Indexing: Implementation and Experiments | 2012-10-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3108685 | 2012-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3108687 | 2012-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3108697 | 2012-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3108698 | 2012-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3108702 | 2012-01-05 | Paper |
| Solving path problems on the GPU | 2010-09-02 | Paper |
| Symbolic and Exact Structure Prediction for Sparse Gaussian Elimination with Partial Pivoting | 2009-11-06 | Paper |
| Obtaining bounds on the two norm of a matrix from the splitting lemma | 2007-03-16 | Paper |
| A column approximate minimum degree ordering algorithm | 2005-07-22 | Paper |
| Algorithm 836 | 2005-07-22 | Paper |
| A Note on the Column Elimination Tree | 2004-01-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2730089 | 2001-10-01 | Paper |
| Geometric Mesh Partitioning: Implementation and Experiments | 1998-09-21 | Paper |
| Separators and structure prediction in sparse orthogonal factorization | 1998-02-22 | Paper |
| Algorithms for automatic alignment of arrays. | 1997-08-07 | Paper |
| Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree | 1995-08-20 | Paper |
| Generating local addresses and communication sets for data-parallel programs | 1995-07-06 | Paper |
| An Efficient Algorithm to Compute Row and Column Counts for Sparse Cholesky Factorization | 1994-11-16 | Paper |
| Provably good mesh generation | 1994-11-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3139384 | 1994-09-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4288583 | 1994-05-26 | Paper |
| Predicting Structure in Sparse Matrix Computations | 1994-04-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4694712 | 1993-06-29 | Paper |
| Elimination Structures for Unsymmetric Sparse $LU$ Factors | 1993-06-29 | Paper |
| Drawing the planar dual | 1993-01-16 | Paper |
| Highly Parallel Sparse Cholesky Factorization | 1993-01-16 | Paper |
| Sparse Matrices in MATLAB: Design and Implementation | 1992-06-28 | Paper |
| Parallel symbolic factorization of sparse linear systems | 1990-01-01 | Paper |
| A parallel algorithm for sparse symbolic Cholesky factorization on a multiprocessor | 1988-01-01 | Paper |
| Sparse Partial Pivoting in Time Proportional to Arithmetic Operations | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3806672 | 1988-01-01 | Paper |
| The analysis of a nested dissection algorithm | 1987-01-01 | Paper |
| A parallel graph partitioning algorithm for a message-passing multiprocessor | 1987-01-01 | Paper |
| Computing a Sparse Basis for the Null Space | 1987-01-01 | Paper |
| Predicting fill for sparse orthogonal factorization | 1986-01-01 | Paper |
| Graph Coloring Using Eigenvalue Decomposition | 1984-01-01 | Paper |
| A separator theorem for graphs of bounded genus | 1984-01-01 | Paper |
| A Separator Theorem for Chordal Graphs | 1984-01-01 | Paper |
| The Pebbling Problem is Complete in Polynomial Space | 1980-01-01 | Paper |
| A Note on the NP-Completeness of Vertex Elimination on Directed Graphs | 1980-01-01 | Paper |
| Errata: Geodetic orientations of complete \(k\)-partite graphs | 1976-01-01 | Paper |
| Geodetic orientations of complete \(k\)-partite graphs | 1975-01-01 | Paper |
