Towards a fast implementation of spectral nested dissection
Proceedings of the 1992 ACM/IEEE conference on Supercomputing
Finding Optimal Ordering of Sparse Matrices for Column-Oriented Parallel Cholesky Factorization
The Journal of Supercomputing
On finding minimum-diameter clique trees
Nordic Journal of Computing
Improving Parallel Ordering of Sparse Matrices Using Genetic Algorithms
Applied Intelligence
Tree decomposition and discrete optimization problems: A survey
Cybernetics and Systems Analysis
Fully dynamic algorithms for chordal graphs and split graphs
ACM Transactions on Algorithms (TALG)
The clique-separator graph for chordal graphs
Discrete Applied Mathematics
Separator orders in interval, cocomparability, and AT-free graphs
Discrete Applied Mathematics
Efficiently solvable perfect phylogeny problems on binary and k-state data with missing values
WABI'11 Proceedings of the 11th international conference on Algorithms in bioinformatics
| Hi-index | 0.00 |