PSOLVE : A Concurrent Algorithm for Solving Sparse Systems of Linear Equations. - Timothy A. Davis 001; Edward S. Davidson (ICPP, 1987)

Blocking for Parallel Sparse Linear System Solvers. - Santosh G. Abraham; Timothy A. Davis 001 (ICPP (1), 1988)

Pairwise Reduction for the Direct, Parallel Solution of Sparse, Unsymmetric Sets of Linear Equations. - Timothy A. Davis 001; Edward S. Davidson (IEEE Trans. Computers, 1988)

A parallel algorithm for sparse unsymmetric LU factorization - Timothy A. Davis 001 (1989)

Space Efficient Parallel Buddy Memory Management. - Theodore Johnson; Timothy A. Davis 001 (ICCI, 1992)

Parallel Buddy Memory Management. - Theodore Johnson; Timothy A. Davis 001 (Parallel Process. Lett., 1992)

A Distributed Memory, Multifrontal Method for Sequences of Unsymmetric Pattern Matrices. - Steven M. Hadfield; Timothy A. Davis 001 (ICPP (3), 1995)

An Approach for Parallelizing any General Unsymmetric Sparse Matrix Algorithm. - Tariq Rashid; Timothy A. Davis 001 (PP, 1995)

A Concurrent Dynamic Task Graph. - Theodore Johnson; Timothy A. Davis 001; Steven M. Hadfield (Parallel Comput., 1996)

An Approximate Minimum Degree Ordering Algorithm. - Patrick R. Amestoy; Timothy A. Davis 001; Iain S. Duff (SIAM J. Matrix Anal. Appl., 1996)

An Unsymmetric-Pattern Multifrontal Method for Sparse LU Factorization. - Timothy A. Davis 001; Iain S. Duff (SIAM J. Matrix Anal. Appl., 1997)

Modifying a Sparse Cholesky Factorization. - Timothy A. Davis 001; William W. Hager (SIAM J. Matrix Anal. Appl., 1999)

A combined unifrontal/multifrontal method for unsymmetric sparse matrices. - Timothy A. Davis 001; Iain S. Duff (ACM Trans. Math. Softw., 1999)

Irregular 2000 - Workshop on Solving Irregularly Structured Problems in Parallel. - Sartaj Sahni; Timothy A. Davis 001; Sanguthevar Rajasekaran; Sanjay Ranka (IPDPS Workshops, 2000)

Multiple-Rank Modifications of a Sparse Cholesky Factorization. - Timothy A. Davis 001; William W. Hager (SIAM J. Matrix Anal. Appl., 2001)

Algorithm 837: AMD, an approximate minimum degree ordering algorithm. - Patrick Amestoy; Enseeiht-Irit; Timothy A. Davis 001; Iain S. Duff (ACM Trans. Math. Softw., 2004)

A column pre-ordering strategy for the unsymmetric-pattern multifrontal method. - Timothy A. Davis 001 (ACM Trans. Math. Softw., 2004)

Algorithm 832: UMFPACK V4.3 - an unsymmetric-pattern multifrontal method. - Timothy A. Davis 001 (ACM Trans. Math. Softw., 2004)

A column approximate minimum degree ordering algorithm. - Timothy A. Davis 001; John R. Gilbert; Stefan I. Larimore; Esmond G. Ng (ACM Trans. Math. Softw., 2004)

Algorithm 836: COLAMD, a column approximate minimum degree ordering algorithm. - Timothy A. Davis 001; John R. Gilbert; Stefan I. Larimore; Esmond G. Ng (ACM Trans. Math. Softw., 2004)

MATLAB primer, 7th Edition. - Timothy A. Davis 001; Kermit Sigmon (Chapman & Hall, 2005)

Row Modifications of a Sparse Cholesky Factorization. - Timothy A. Davis 001; William W. Hager (SIAM J. Matrix Anal. Appl., 2005)

Model representation with aesthetic computing: Method and empirical study. - Paul A. Fishwick; Timothy A. Davis 001; Jane Douglas (ACM Trans. Model. Comput. Simul., 2005)

Algorithm 849: A concise sparse cholesky factorization package. - Timothy A. Davis 001 (ACM Trans. Math. Softw., 2005)

Direct methods for sparse linear systems. - Timothy A. Davis 001 (SIAM, 2006)

A sparse proximal implementation of the LP dual active set algorithm. - Timothy A. Davis 001; William W. Hager (Math. Program., 2008)

Dual multilevel optimization. - Timothy A. Davis 001; William W. Hager (Math. Program., 2008)

Algorithm 887: CHOLMOD, Supernodal Sparse Cholesky Factorization and Update/Downdate. - Yanqing Chen; Timothy A. Davis 001; William W. Hager; Sivasankaran Rajamanickam (ACM Trans. Math. Softw., 2008)

Multifrontral multithreaded rank-revealing sparse QR factorization. - Timothy A. Davis 001 (Combinatorial Scientific Computing, 2009)

Dynamic Supernodes in Sparse Cholesky Update/Downdate and Triangular Solves. - Timothy A. Davis 001; William W. Hager (ACM Trans. Math. Softw., 2009)

Hypergraph-Based Unsymmetric Nested Dissection Ordering for Sparse LU Factorization. - Laura Grigori; Erik G. Boman; Simplice Donfack; Timothy A. Davis 001 (SIAM J. Sci. Comput., 2010)

Algorithm 907: KLU, A Direct Sparse Solver for Circuit Simulation Problems. - Timothy A. Davis 001; Ekanathan Palamadai Natarajan (ACM Trans. Math. Softw., 2010)

Algorithm 915, SuiteSparseQR: Multifrontal multithreaded rank-revealing sparse QR factorization. - Timothy A. Davis 001 (ACM Trans. Math. Softw., 2011)

The university of Florida sparse matrix collection. - Timothy A. Davis 001; Yifan Hu 001 (ACM Trans. Math. Softw., 2011)

Algorithm 930: FACTORIZE: An object-oriented linear system solver for MATLAB. - Timothy A. Davis 001 (ACM Trans. Math. Softw., 2013)

Algorithm 933: Reliable calculation of numerical rank, null space bases, pseudoinverse solutions, and basic solutions using suitesparseQR. - Leslie V. Foster; Timothy A. Davis 001 (ACM Trans. Math. Softw., 2013)

A survey of direct methods for sparse linear systems. - Timothy A. Davis 001; Sivasankaran Rajamanickam; Wissam M. Sid-Lakhdar (Acta Numer., 2016)

State-defect constraint pairing graph coarsening method for Karush-Kuhn-Tucker matrices arising in orthogonal collocation methods for optimal control. - Begüm Senses Cannataro; Anil V. Rao; Timothy A. Davis 001 (Comput. Optim. Appl., 2016)

Accelerating sparse Cholesky factorization on GPUs. - Steven C. Rennich; Darko Stosic; Timothy A. Davis 001 (Parallel Comput., 2016)

An Efficient Hybrid Algorithm for the Separable Convex Quadratic Knapsack Problem. - Timothy A. Davis 001; William W. Hager; James T. Hungerford (ACM Trans. Math. Softw., 2016)

Localized solutions of sparse linear systems for geometry processing. - Philipp Herholz; Timothy A. Davis 001; Marc Alexa (ACM Trans. Graph., 2017)

Algorithm 980: Sparse QR Factorization on the GPU. - Sencer Nuri Yeralan; Timothy A. Davis 001; Wissam M. Sid-Lakhdar; Sanjay Ranka (ACM Trans. Math. Softw., 2017)

Graph algorithms via SuiteSparse: GraphBLAS: triangle counting and K-truss. - Timothy A. Davis 001 (HPEC, 2018)

A Multilevel Subtree Method for Single and Batched Sparse Cholesky Factorization. - Meng Tang; Mohamed Gadou; Steven C. Rennich; Timothy A. Davis 001; Sanjay Ranka (ICPP, 2018)

Optimized sparse Cholesky factorization on hybrid multicore architectures. - Meng Tang; Mohamed Gadou; Steven C. Rennich; Timothy A. Davis 001; Sanjay Ranka (J. Comput. Sci., 2018)

Write Quick, Run Fast: Sparse Deep Neural Network in 20 Minutes of Development Time via SuiteSparse: GraphBLAS. - Timothy A. Davis 001; Mohsen Aznaveh; Scott P. Kolodziej (HPEC, 2019)

LAGraph: A Community Effort to Collect Graph Algorithms Built on Top of the GraphBLAS. - Tim Mattson; Timothy A. Davis 001; Manoj Kumar 006; Aydin Buluç; Scott McMillan; José E. Moreira; Carl Yang 002 (IPDPS Workshops, 2019)

On the Tunable Sparse Graph Solver for Pose Graph Optimization in Visual SLAM Problems. - Chieh Chou; Di Wang 020; Dezhen Song; Timothy A. Davis 001 (IROS, 2019)

The SuiteSparse Matrix Collection Website Interface. - Scott P. Kolodziej; Mohsen Aznaveh; Matthew Bullock; Jarrett David; Timothy A. Davis 001; Matthew Henderson; Yifan Hu 001; Read Sandström (J. Open Source Softw., 2019)

Exact Solution of Sparse Linear Systems via Left-Looking Roundoff-Error-Free LU Factorization in Time Proportional to Arithmetic Work. - Christopher J. Lourenco; Adolfo R. Escobedo; Erick Moreno-Centeno; Timothy A. Davis 001 (SIAM J. Matrix Anal. Appl., 2019)

Algorithm 1000: SuiteSparse: GraphBLAS: Graph Algorithms in the Language of Sparse Linear Algebra. - Timothy A. Davis 001 (ACM Trans. Math. Softw., 2019)

A GraphBLAS solution to the SIGMOD 2014 Programming Contest using multi-source BFS. - Márton Elekes 001; Attila Nagy; Dávid Sándor; János Benjamin Antal; Timothy A. Davis 001; Gábor Szárnyas (HPEC, 2020)

Evaluation of Graph Analytics Frameworks Using the GAP Benchmark Suite. - Ariful Azad; Mohsen Mahmoudi Aznaveh; Scott Beamer; Mark P. Blanco; Jinhao Chen; Luke D'Alessandro; Roshan Dathathri; Timothy A. Davis 001; Kevin Deweese; Jesun Firoz; Henry A. Gabb; Gurbinder Gill; et al. (IISWC, 2020)

Parallel GraphBLAS with OpenMP. - Mohsen Aznaveh; Jinhao Chen; Timothy A. Davis 001; Bálint Hegyi; Scott P. Kolodziej; Timothy G. Mattson; Gábor Szárnyas (CSC, 2020)

Generalized Gains for Hybrid Vertex Separator Algorithms. - Scott P. Kolodziej; Timothy A. Davis 001 (CSC, 2020)

Design and Implementation of a Parallel Markowitz Threshold Algorithm. - Timothy A. Davis 001; Iain S. Duff; Stojce Nakov (SIAM J. Matrix Anal. Appl., 2020)

Algorithm 1003: Mongoose, a Graph Coarsening and Partitioning Library. - Timothy A. Davis 001; William W. Hager; Scott P. Kolodziej; Sencer Nuri Yeralan (ACM Trans. Math. Softw., 2020)

The GraphBLAS in Julia and Python: the PageRank and Triangle Centralities. - Michel Pelletier; Will Kimmerer; Timothy A. Davis 001; Timothy G. Mattson (HPEC, 2021)

LAGraph: Linear Algebra, Network Analysis Libraries, and the Study of Graph Algorithms. - Gábor Szárnyas; David A. Bader; Timothy A. Davis 001; James Kitchen; Timothy G. Mattson; Scott McMillan; Erik Welch (IPDPS Workshops, 2021)

QLB: Collision-Aware Quasi-Newton Solver with Cholesky and L-BFGS for Nonlinear Time Integration. - Bethany Witemeyer; Nicholas J. Weidner; Timothy A. Davis 001; Theodore Kim; Shinjiro Sueda (MIG, 2021)

Sparse Exact Factorization Update. - Jinhao Chen; Timothy A. Davis 001; Christopher J. Lourenco; Erick Moreno-Centeno (IA3@SC, 2021)

Algorithm 1021: SPEX Left LU, Exactly Solving Sparse Linear Systems via a Sparse Left-looking Integer-preserving LU Factorization. - Christopher J. Lourenco; Jinhao Chen; Erick Moreno-Centeno; Timothy A. Davis 001 (ACM Trans. Math. Softw., 2022)

PAQR: Pivoting Avoiding QR factorization. - Wissam M. Sid-Lakhdar; Sébastien Cayrols; Daniel Bielich; Ahmad Abdelfattah; Piotr Luszczek; Mark Gates; Stanimire Tomov; Hans Johansen; David B. Williams-Young; Timothy A. Davis 001; Jack J. Dongarra; Hartwig Anzt (IPDPS, 2023)

Algorithm 1037: SuiteSparse:GraphBLAS: Parallel Graph Algorithms in the Language of Sparse Linear Algebra. - Timothy A. Davis 001 (ACM Trans. Math. Softw., 2023)

Indexed Binary Operations in the GraphBLAS. - Timothy G. Mattson; Manaswinee Bezbaruah; Matthias Maier; Scott McMillan; Michel Pelletier; Erik Welch; Timothy A. Davis 001 (HPEC, 2024)

Interface for Sparse Linear Algebra Operations. - Ahmad Abdelfattah; Willow Ahrens; Hartwig Anzt; Chris Armstrong; Ben Brock; Aydin Buluç; Federico Busato; Terry Cojean; Timothy A. Davis 001; Jim Demmel; Grace Dinh; David Gardener; et al. (CoRR, 2024)

Algorithm 1050: SPEX Cholesky, LDL, and Backslash for Exactly Solving Sparse Linear Systems. - Lorena Mejia-Domenzain; Jinhao Chen; Christopher J. Lourenco; Erick Moreno-Centeno; Timothy A. Davis 001 (ACM Trans. Math. Softw., 2024)

Binsparse: A Specification for Cross-Platform Storage of Sparse Matrices and Tensors. - Benjamin Brock; Willow Ahrens; Hameer Abbasi; Timothy A. Davis 001; Juni Kim; James Kitchen; Spencer Patty; Isaac Virshup; Erik Welch (CoRR, 2025)