The cyclic coloring problem and estimation of spare hessian matrices
SIAM Journal on Algebraic and Discrete Methods
The role of elimination trees in sparse factorization
SIAM Journal on Matrix Analysis and Applications
Computing the block triangular form of a sparse matrix
ACM Transactions on Mathematical Software (TOMS)
Elimination structures for unsymmetric sparse LU factors
SIAM Journal on Matrix Analysis and Applications
An Approximate Minimum Degree Ordering Algorithm
SIAM Journal on Matrix Analysis and Applications
Parallel Algorithms for Adaptive Mesh Refinement
SIAM Journal on Scientific Computing
Algorithms on strings, trees, and sequences: computer science and computational biology
Algorithms on strings, trees, and sequences: computer science and computational biology
The Efficient Computation of Sparse Jacobian Matrices Using Automatic Differentiation
SIAM Journal on Scientific Computing
Understanding search engines: mathematical modeling and text retrieval
Understanding search engines: mathematical modeling and text retrieval
Hypergraph-Partitioning-Based Decomposition for Parallel Sparse-Matrix Vector Multiplication
IEEE Transactions on Parallel and Distributed Systems
Authoritative sources in a hyperlinked environment
Journal of the ACM (JACM)
The Design and Use of Algorithms for Permuting Large Entries to the Diagonal of Sparse Matrices
SIAM Journal on Matrix Analysis and Applications
Improving performance of sparse matrix-vector multiplication
SC '99 Proceedings of the 1999 ACM/IEEE conference on Supercomputing
Graph partitioning models for parallel computing
Parallel Computing - Special issue on graph partioning and parallel computing
A new kind of science
Triangle: Engineering a 2D Quality Mesh Generator and Delaunay Triangulator
FCRC '96/WACG '96 Selected papers from the Workshop on Applied Computational Geormetry, Towards Geometric Engineering
Iterative Methods for Sparse Linear Systems
Iterative Methods for Sparse Linear Systems
Support Theory for Preconditioning
SIAM Journal on Matrix Analysis and Applications
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Reducing Complexity in Parallel Algebraic Multigrid Preconditioners
SIAM Journal on Matrix Analysis and Applications
Linear time 1/2 -approximation algorithm for maximum weighted matching in general graphs
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Parallel hypergraph partitioning for scientific computing
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Fast and accurate structural RNA alignment by progressive lagrangian optimization
CompLife'05 Proceedings of the First international conference on Computational Life Sciences
The architecture of a proteomic network in the yeast
CompLife'05 Proceedings of the First international conference on Computational Life Sciences
| Hi-index | 0.00 |
Combinatorial algorithms have long played a crucial, albeit under-recognized role in scientific computing. This impact ranges well beyond the familiar applications of graph algorithms in sparse matrices to include mesh generation, optimization, computational biology and chemistry, data analysis and parallelization. Trends in science and in computing suggest strongly that the importance of discrete algorithms in computational science will continue to grow. This paper reviews some of these many past successes and highlights emerging areas of promise and opportunity.