A separator theorem for graphs of bounded genus
Journal of Algorithms
Finding small simple cycle separators for 2-connected planar graphs
Journal of Computer and System Sciences
Efficient parallel solution of linear systems
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Partitioning sparse matrices with eigenvectors of graphs
SIAM Journal on Matrix Analysis and Applications
A separator theorem for graphs with an excluded minor and its applications
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Performance of dynamic load balancing algorithms for unstructured mesh calculations
Concurrency: Practice and Experience
Separator based parallel divide and conquer in computational geometry
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Points, spheres, and separators: a unified geometric approach to graph partitioning
Points, spheres, and separators: a unified geometric approach to graph partitioning
Approximating center points with iterated radon points
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
A deterministic linear time algorithm for geometric separators and its applications
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Area-Efficient VLSI Computation
Area-Efficient VLSI Computation
Computer Solution of Large Sparse Positive Definite
Computer Solution of Large Sparse Positive Definite
| Hi-index | 0.00 |