Generalized Nested Dissection
Abstract
Get full access to this article
View all available purchase options and get full access to this article.
References
Information & Authors
Information
Published In
Copyright
History
Authors
Metrics & Citations
Metrics
Citations
If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.
Cited By
- Symbolic matrix factorization for differential-algebraic equations index reductionJournal of Computational and Applied Mathematics, Vol. 448 | 1 Oct 2024
- Multiresolution kernel matrix algebraNumerische Mathematik, Vol. 156, No. 3 | 9 May 2024
- Quasiplanar graphs, string graphs, and the Erdős–Gallai problemEuropean Journal of Combinatorics, Vol. 119 | 1 Jun 2024
- A Near-Field Preconditioner for Surface Integral Equations Based on Nested Dissection ReorderingIEEE Antennas and Wireless Propagation Letters, Vol. 23, No. 5 | 1 May 2024
- Convergence of datalog over (Pre-) SemiringsJournal of the ACM, Vol. 71, No. 2 | 10 April 2024
- Fast simulation of planar Clifford circuitsQuantum, Vol. 8 | 12 February 2024
- Solving Systems of Linear Equations Through Zero Forcing SetComputing and Combinatorics | 9 December 2023
- Sparse-Aware CARM: Rooflining Locality of Sparse ComputationsEuro-Par 2023: Parallel Processing Workshops | 16 April 2024
- Negative-Weight Single-Source Shortest Paths in Near-Linear Time: Now Faster!2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS) | 6 Nov 2023
- A note on the SDP relaxation of the minimum cut problemJournal of Global Optimization, Vol. 87, No. 2-4 | 29 September 2022
- A 16-bit Floating-Point Near-SRAM Architecture for Low-power Sparse Matrix-Vector Multiplication2023 IFIP/IEEE 31st International Conference on Very Large Scale Integration (VLSI-SoC) | 16 Oct 2023
- Maximum Matchings in Geometric Intersection GraphsDiscrete & Computational Geometry, Vol. 70, No. 3 | 9 September 2023
- Scalable Approximate NonSymmetric Autoencoder for Collaborative FilteringProceedings of the 17th ACM Conference on Recommender Systems | 14 September 2023
- In-Timestep Remeshing for Contacting ElastodynamicsACM Transactions on Graphics, Vol. 42, No. 4 | 26 July 2023
- Convergence of Datalog over (Pre-) SemiringsACM SIGMOD Record, Vol. 52, No. 1 | 8 June 2023
- Facial reduction for symmetry reduced semidefinite and doubly nonnegative programsMathematical Programming, Vol. 200, No. 1 | 27 September 2022
- Perturbative readout-error mitigation for near-term quantum computersPhysical Review A, Vol. 107, No. 6 | 30 June 2023
- AdaSfM: From Coarse Global to Fine Incremental Adaptive Structure from Motion2023 IEEE International Conference on Robotics and Automation (ICRA) | 29 May 2023
- An Incomplete Cholesky Preconditioner Based on Orthogonal ApproximationsSIAM Journal on Scientific Computing, Vol. 45, No. 2 | 27 April 2023
- Minimum Cuts in Surface GraphsSIAM Journal on Computing, Vol. 52, No. 1 | 14 February 2023
- Optimal Bond Percolation in Networks by a Fast-Decycling FrameworkComplex Networks and Their Applications XI | 26 January 2023
- Quasiplanar Graphs, String Graphs, and the Erdős-Gallai ProblemGraph Drawing and Network Visualization | 19 January 2023
- Sparse Matrix Ordering AlgorithmsAlgorithms for Sparse Linear Systems | 11 January 2023
- Hardness of Graph-Structured Algebraic and Symbolic ProblemsAlgorithms and Data Structures | 28 July 2023
- Samplets: Construction and scattered data compressionJournal of Computational Physics, Vol. 471 | 1 Dec 2022
- Negative-Weight Single-Source Shortest Paths in Near-linear Time2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS) | 1 Oct 2022
- Large spatial data modeling and analysis: A Krylov subspace approachScandinavian Journal of Statistics, Vol. 49, No. 3 | 11 October 2021
- Convergence of Datalog over (Pre-) SemiringsProceedings of the 41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems | 13 June 2022
- On the Power of Preconditioning in Sparse Linear Regression2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS) | 1 Feb 2022
- Samplets: Construction and Scattered Data CompressionSSRN Electronic Journal, Vol. 267 | 1 Jan 2022
- Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversionMathematical Programming, Vol. 188, No. 1 | 25 May 2020
- Speculative Parallel Reverse Cuthill-McKee Reordering on Multi- and Many-core Architectures2021 IEEE International Parallel and Distributed Processing Symposium (IPDPS) | 1 May 2021
- A fast direct solver for nonlocal operators in wavelet coordinatesJournal of Computational Physics, Vol. 428 | 1 Mar 2021
- Parallel Privacy-Preserving Shortest Paths by Radius-Stepping2021 29th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (PDP) | 1 Mar 2021
- Compression, Inversion, and Approximate PCA of Dense Kernel Matrices at Near-Linear Computational ComplexityMultiscale Modeling & Simulation, Vol. 19, No. 2 | 15 April 2021
- Planar and Toroidal Morphs Made EasierGraph Drawing and Network Visualization | 23 December 2021
- Vecchia–Laplace approximations of generalized Gaussian processes for big non-Gaussian spatial dataComputational Statistics & Data Analysis, Vol. 153 | 1 Jan 2021
- Tractable minor-free generalization of planar zero-field Ising modelsJournal of Statistical Mechanics: Theory and Experiment, Vol. 2020, No. 12 | 21 December 2020
- Memory‐Efficient Bijective Parameterizations of Very‐Large‐Scale ModelsComputer Graphics Forum, Vol. 39, No. 7 | 24 November 2020
- Minimum fill-in: Inapproximability and almost tight lower boundsInformation and Computation, Vol. 271 | 1 Apr 2020
- A multilevel approach for trace system in HDG discretizationsJournal of Computational Physics, Vol. 407 | 1 Apr 2020
- Influencer identification in dynamical complex systemsJournal of Complex Networks, Vol. 8, No. 2 | 5 August 2019
- Product Algebras for Galerkin Discretisations of Boundary Integral Operators and their ApplicationsACM Transactions on Mathematical Software, Vol. 46, No. 1 | 20 March 2020
- An Algebraic Sparsified Nested Dissection Algorithm Using Low-Rank ApproximationsSIAM Journal on Matrix Analysis and Applications, Vol. 41, No. 2 | 4 May 2020
- Sparse Hierarchical Preconditioners Using Piecewise Smooth Approximations of EigenvectorsSIAM Journal on Scientific Computing, Vol. 42, No. 6 | 14 December 2020
- Ensemble Approach for Generalized Network DismantlingComplex Networks and Their Applications VIII | 26 November 2019
- Solving a Bernoulli type free boundary problem with random diffusionESAIM: Control, Optimisation and Calculus of Variations, Vol. 26 | 8 September 2020
- Convexity-increasing morphs of planar graphsComputational Geometry, Vol. 84 | 1 Nov 2019
- Automating algorithm selection: Checking for matrix properties that can simplify computationsJournal of Symbolic Computation, Vol. 94 | 1 Sep 2019
- A Fourier-accelerated volume integral method for elastoplastic contactComputer Methods in Applied Mechanics and Engineering, Vol. 351 | 1 Jul 2019
- Subquadratic Algorithms for the Diameter and the Sum of Pairwise Distances in Planar GraphsACM Transactions on Algorithms, Vol. 15, No. 2 | 7 December 2018
- Compact I/O-Efficient Representation of Separable Graphs and Optimal Tree LayoutsTheory and Applications of Models of Computation | 6 March 2019
- Wave modeling in viscoacoustic media with transverse isotropyGEOPHYSICS, Vol. 84, No. 1 | 1 Jan 2019
- Graph Bisection with Pareto OptimizationACM Journal of Experimental Algorithmics, Vol. 23 | 12 February 2018
- Blended cured quasi-newton for distortion optimizationACM Transactions on Graphics, Vol. 37, No. 4 | 30 July 2018
- Fully Polynomial-Time Parameterized Computations for Graphs and Matrices of Low TreewidthACM Transactions on Algorithms, Vol. 14, No. 3 | 16 June 2018
- Solving a free boundary problem with nonconstant coefficientsMathematical Methods in the Applied Sciences, Vol. 41, No. 10 | 9 May 2018
- Very Large-Scale Global SfM by Distributed Motion Averaging2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition | 1 Jun 2018
- Wilkinson's inertia‐revealing factorization and its application to sparse matricesNumerical Linear Algebra with Applications, Vol. 25, No. 2 | 28 November 2017
- Decomposing a graph into expanding subgraphsRandom Structures & Algorithms, Vol. 52, No. 1 | 13 August 2017
- Convexity-Increasing Morphs of Planar GraphsGraph-Theoretic Concepts in Computer Science | 2 September 2018
- The min-cut and vertex separator problemComputational Optimization and Applications, Vol. 69, No. 1 | 18 September 2017
- Underestimated Cost of Targeted Attacks on Complex NetworksComplexity, Vol. 2018, No. 1 | 17 January 2018
- PMORSy: parallel sparse matrix ordering software for fill-in minimizationOptimization Methods and Software, Vol. 32, No. 2 | 22 June 2016
- Low-rank factorization of electron integral tensors and its application in electronic structure theoryChemical Physics Letters, Vol. 672 | 1 Mar 2017
- Fast Hierarchical Solvers For Sparse Matrices Using Extended Sparsification and Low-Rank ApproximationSIAM Journal on Scientific Computing, Vol. 39, No. 3 | 23 May 2017
- Solving Graph Laplacian Systems Through Recursive Partitioning and Two-Grid PreconditioningSIAM Journal on Matrix Analysis and Applications, Vol. 38, No. 2 | 27 June 2017
- Eigenvector-Based Centrality Measures for Temporal NetworksMultiscale Modeling & Simulation, Vol. 15, No. 1 | 28 March 2017
- $\mathcal{H}$-Matrix Based Second Moment Analysis for Rough Random Fields and Finite Element DiscretizationsSIAM Journal on Scientific Computing, Vol. 39, No. 4 | 6 July 2017
- Practical Implementation Aspects of Large-Scale Optimal Control SolversHybrid Systems, Optimal Control and Hybrid Vehicles | 3 February 2017
- Test ResultsParallel Sparse Direct Solver for Integrated Circuit Simulation | 12 February 2017
- Customizable Contraction HierarchiesACM Journal of Experimental Algorithmics, Vol. 21 | 5 April 2016
- Approximate Gaussian Elimination for Laplacians - Fast, Sparse, and Simple2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS) | 1 Oct 2016
- Vital nodes identification in complex networksPhysics Reports, Vol. 650 | 1 Sep 2016
- Search-space size in contraction hierarchiesTheoretical Computer Science, Vol. 645 | 1 Sep 2016
- Interactively Cutting and Constraining Vertices in Meshes Using Augmented MatricesACM Transactions on Graphics, Vol. 35, No. 2 | 19 February 2016
- Systematically linking qualitative elements of scenarios across levels, scales, and sectorsEnvironmental Modelling & Software, Vol. 79 | 1 May 2016
- A survey of direct methods for sparse linear systemsActa Numerica, Vol. 25 | 23 May 2016
- An algebraic multifrontal preconditioner that exploits the low‐rank propertyNumerical Linear Algebra with Applications, Vol. 23, No. 1 | 24 July 2015
- Shortest Paths in Planar Graphs with Negative Weight EdgesEncyclopedia of Algorithms | 22 April 2016
- Recursive Separator Decompositions for Planar GraphsEncyclopedia of Algorithms | 22 April 2016
- Route Planning in Transportation NetworksAlgorithm Engineering | 11 November 2016
- On the negative cost girth problem in planar networksJournal of Discrete Algorithms, Vol. 35 | 1 Nov 2015
- Valid inequalities and lifting procedures for the shortest path problem in digraphs with negative cyclesOptimization Letters, Vol. 9, No. 2 | 13 May 2014
- Direct Methods for Linear SystemsNumerical Methods in Matrix Computations | 7 October 2014
- Graph Fill-In, Elimination Ordering, Nested Dissection and Contraction HierarchiesGems of Combinatorial Optimization and Graph Algorithms | 12 January 2016
- Transformations of matrix structures work againLinear Algebra and its Applications, Vol. 465 | 1 Jan 2015
- An improved recursive graph bipartitioning algorithm for well balanced domain decomposition2014 21st International Conference on High Performance Computing (HiPC) | 1 Dec 2014
- Parallelization of Reordering Algorithms for Bandwidth and Wavefront ReductionSC14: International Conference for High Performance Computing, Networking, Storage and Analysis | 1 Nov 2014
- Counting and Sampling Minimum Cuts in Genus $$g$$ g GraphsDiscrete & Computational Geometry, Vol. 52, No. 3 | 3 September 2014
- Algebraic Algorithms*Computing Handbook, Third Edition | 8 May 2014
- Shortest-path queries in static networksACM Computing Surveys, Vol. 46, No. 4 | 1 March 2014
- Counting spanning trees using modular decompositionTheoretical Computer Science, Vol. 526 | 1 Mar 2014
- Nearly Linear Time Algorithms for Preconditioning and Solving Symmetric, Diagonally Dominant Linear SystemsSIAM Journal on Matrix Analysis and Applications, Vol. 35, No. 3 | 8 July 2014
- Approaching Optimality for Solving SDD Linear SystemsSIAM Journal on Computing, Vol. 43, No. 1 | 20 February 2014
- Fast Approximate Computations with Cauchy Matrices, Polynomials and Rational FunctionsComputer Science - Theory and Applications | 1 Jan 2014
- Customizable Contraction HierarchiesExperimental Algorithms | 1 Jan 2014
- Recursive Separator Decompositions for Planar GraphsEncyclopedia of Algorithms | 1 October 2014
- Fast shortest-paths algorithms in the presence of few destinations of negative-weight arcsJournal of Discrete Algorithms, Vol. 24 | 1 Jan 2014
- A nested dissection partitioning method for parallel sparse matrix-vector multiplication2013 IEEE High Performance Extreme Computing Conference (HPEC) | 1 Sep 2013
- Matrix sparsification and nested dissection over arbitrary fieldsJournal of the ACM, Vol. 60, No. 4 | 4 September 2013
- Efficient preconditioning of laplacian matrices for computer graphicsACM Transactions on Graphics, Vol. 32, No. 4 | 21 July 2013
- Counting and sampling minimum cuts in genus g graphsProceedings of the twenty-ninth annual symposium on Computational geometry | 17 June 2013
- Minimizing Communication in All-Pairs Shortest Paths2013 IEEE 27th International Symposium on Parallel and Distributed Processing | 1 May 2013
- Numerically exact correlations and sampling in the two-dimensional Ising spin glassPhysical Review E, Vol. 87, No. 4 | 5 April 2013
- Graph Connectivities, Network Coding, and Expander GraphsSIAM Journal on Computing, Vol. 42, No. 3 | 2 May 2013
- Conditioning Analysis of Incomplete Cholesky Factorizations with Orthogonal DroppingSIAM Journal on Matrix Analysis and Applications, Vol. 34, No. 3 | 1 August 2013
- Chapter 11: Heat Transfer and Flow Structure near the Planetary Probe SurfaceHypersonic Aerodynamics and Heat Transfer | 1 Jan 2013
- Preconditioning for Sparse Linear Systems at the Dawn of the 21st Century: History, Current Developments, and Future PerspectivesISRN Applied Mathematics, Vol. 2012 | 26 Dec 2012
- On optimal preprocessing for contraction hierarchiesProceedings of the 5th ACM SIGSPATIAL International Workshop on Computational Transportation Science | 6 November 2012
- HyperSfM2012 Second International Conference on 3D Imaging, Modeling, Processing, Visualization & Transmission | 1 Oct 2012
- Benchmarking ordering techniques for nonserial dynamic programmingMemetic Computing, Vol. 4, No. 3 | 22 June 2012
- Updated sparse cholesky factors for corotational elastodynamicsACM Transactions on Graphics, Vol. 31, No. 5 | 7 September 2012
- Almost Exact MatchingsAlgorithmica, Vol. 63, No. 1-2 | 30 April 2011
- Many Distances in Planar GraphsAlgorithmica, Vol. 62, No. 1-2 | 15 October 2010
- Combinatorial Scientific ComputingCombinatorial Scientific Computing | 29 March 2012
- Combinatorial Problems in Solving Linear SystemsCombinatorial Scientific Computing | 29 March 2012
- Homology Flows, Cohomology CutsSIAM Journal on Computing, Vol. 41, No. 6 | 18 December 2012
- Lean Algebraic Multigrid (LAMG): Fast Graph Laplacian Linear SolverSIAM Journal on Scientific Computing, Vol. 34, No. 4 | 23 August 2012
- How to Draw a Graph, RevisitedExpanding the Frontiers of Visual Analytics and Visualization | 1 Jan 2012
- Algorithm 915, SuiteSparseQRACM Transactions on Mathematical Software, Vol. 38, No. 1 | 7 December 2011
- Separator Theorems for Minor-Free and Shallow Minor-Free Graphs with Applications2011 IEEE 52nd Annual Symposium on Foundations of Computer Science | 1 Oct 2011
- Graph Connectivities, Network Coding, and Expander Graphs2011 IEEE 52nd Annual Symposium on Foundations of Computer Science | 1 Oct 2011
- On 3D modeling of seismic wave propagation via a structured parallel multifrontal direct Helmholtz solverGeophysical Prospecting, Vol. 59, No. 5 | 22 August 2011
- Online environment mappingCVPR 2011 | 1 Jun 2011
- Numerical Thinking in Algorithm Design and AnalysisComputer Science | 22 October 2011
- Counting Spanning Trees in Graphs Using Modular DecompositionWALCOM: Algorithms and Computation | 1 Jan 2011
- Small Grid Embeddings of 3-PolytopesDiscrete & Computational Geometry, Vol. 45, No. 1 | 30 September 2010
- A Multilevel Cholesky Conjugate Gradients Hybrid Solver for Linear Systems with Multiple Right-hand SidesProcedia Computer Science, Vol. 4 | 1 Jan 2011
- Universality of 3D percolation exponents and first-order corrections to scaling for conductivity exponentsPhysica A: Statistical Mechanics and its Applications, Vol. 389, No. 23 | 1 Dec 2010
- A Linear-Time Algorithm for Symmetric Convex Drawings of Internally Triconnected Plane GraphsAlgorithmica, Vol. 58, No. 2 | 5 February 2009
- Solving Linear Systems through Nested Dissection2010 IEEE 51st Annual Symposium on Foundations of Computer Science | 1 Oct 2010
- Approaching Optimality for Solving SDD Linear Systems2010 IEEE 51st Annual Symposium on Foundations of Computer Science | 1 Oct 2010
- Multi-level submap based SLAM using nested dissection2010 IEEE/RSJ International Conference on Intelligent Robots and Systems | 1 Oct 2010
- Immunization strategy by cutting edgesJournal of Computer Applications, Vol. 30, No. 7 | 29 Jul 2010
- Randomized Preprocessing of Homogeneous Linear Systems of EquationsLinear Algebra and its Applications, Vol. 432, No. 12 | 1 Jul 2010
- Single source shortest paths in H -minor free graphsTheoretical Computer Science, Vol. 411, No. 34-36 | 1 Jul 2010
- Building graph separators with the recursive rotation algorithm for the nested dissection methodNumerical Analysis and Applications, Vol. 3, No. 3 | 26 August 2010
- Brief announcementProceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures | 13 June 2010
- A Separator Theorem for String Graphs and its ApplicationsCombinatorics, Probability and Computing, Vol. 19, No. 3 | 7 October 2009
- Shortest paths in directed planar graphs with negative lengthsACM Transactions on Algorithms, Vol. 6, No. 2 | 6 April 2010
- Fast Dynamic Transitive Closure with LookaheadAlgorithmica, Vol. 56, No. 2 | 25 January 2008
- Hypergraph-Based Unsymmetric Nested Dissection Ordering for Sparse LU FactorizationSIAM Journal on Scientific Computing, Vol. 32, No. 6 | 30 November 2010
- Parallel Hybrid Preconditioning: Incomplete Factorization with Selective Sparse Approximate InversionSIAM Journal on Scientific Computing, Vol. 32, No. 3 | 14 May 2010
- Superfast Multifrontal Method for Large Structured Linear Systems of EquationsSIAM Journal on Matrix Analysis and Applications, Vol. 31, No. 3 | 4 December 2009
- On the Numerical Rank of the Off-Diagonal Blocks of Schur Complements of Discretized Elliptic PDEsSIAM Journal on Matrix Analysis and Applications, Vol. 31, No. 5 | 1 July 2010
- Drawing 3-Polytopes with Good Vertex ResolutionGraph Drawing | 1 Jan 2010
- Succinct Representations of Separable GraphsCombinatorial Pattern Matching | 1 Jan 2010
- The Laplacian Paradigm: Emerging Algorithms for Massive GraphsTheory and Applications of Models of Computation | 1 Jan 2010
- Shortest Paths in Planar Graphs with Real Lengths in O(nlog2 n/loglogn) TimeAlgorithms – ESA 2010 | 1 Jan 2010
- Sparse direct factorizations through unassembled hyper-matricesComputer Methods in Applied Mechanics and Engineering, Vol. 199, No. 9-12 | 1 Jan 2010
- Sparse matrix factorization on massively parallel computersProceedings of the Conference on High Performance Computing Networking, Storage and Analysis | 14 November 2009
- Iterated D-SLAM map joining: evaluating its performance in terms of consistency, accuracy and efficiencyAutonomous Robots, Vol. 27, No. 4 | 18 September 2009
- Exact algorithm for sampling the two-dimensional Ising spin glassPhysical Review E, Vol. 80, No. 4 | 30 October 2009
- A linear-time algorithm to find a separator in a graph excluding a minorACM Transactions on Algorithms, Vol. 5, No. 4 | 6 November 2009
- Minimum cuts and shortest homologous cyclesProceedings of the twenty-fifth annual symposium on Computational geometry | 8 June 2009
- Domain decomposition based $${\mathcal H}$$ -LU preconditioningNumerische Mathematik, Vol. 112, No. 4 | 3 March 2009
- Homology flows, cohomology cutsProceedings of the forty-first annual ACM symposium on Theory of computing | 31 May 2009
- Sums-of-Products and Subproblem IndependenceFundamental Problems in Computing | 1 Jan 2009
- A Separator Theorem for String Graphs and Its ApplicationsWALCOM: Algorithms and Computation | 1 Jan 2009
- Resolving Loads with Positive Interior StressesAlgorithms and Data Structures | 1 Jan 2009
- Separator theorems and Turán-type results for planar intersection graphsAdvances in Mathematics, Vol. 219, No. 3 | 1 Oct 2008
- Matrix Sparsification for Rank and Determinant Computations via Nested Dissection2008 49th Annual IEEE Symposium on Foundations of Computer Science | 1 Oct 2008
- Sparse Local Submap Joining Filter for Building Large-Scale MapsIEEE Transactions on Robotics, Vol. 24, No. 5 | 1 Oct 2008
- Parallel black box $$\mathcal {H}$$ -LU preconditioning for elliptic boundary value problemsComputing and Visualization in Science, Vol. 11, No. 4-6 | 1 April 2008
- PT-Scotch: A tool for efficient parallel graph orderingParallel Computing, Vol. 34, No. 6-8 | 1 Jul 2008
- Finding a Better Immunization StrategyPhysical Review Letters, Vol. 101, No. 5 | 31 July 2008
- Graph partitioning into isolated, high conductance clustersProceedings of the twentieth annual symposium on Parallelism in algorithms and architectures | 14 June 2008
- Convex drawings of graphs with non-convex boundary constraintsDiscrete Applied Mathematics, Vol. 156, No. 12 | 1 Jun 2008
- Additive preconditioning and aggregation in matrix computationsComputers & Mathematics with Applications, Vol. 55, No. 8 | 1 Apr 2008
- Rigidity in Finite-Element Matrices: Sufficient Conditions for the Rigidity of Structures and SubstructuresSIAM Journal on Matrix Analysis and Applications, Vol. 30, No. 1 | 23 January 2008
- Holographic AlgorithmsSIAM Journal on Computing, Vol. 37, No. 5 | 8 February 2008
- Shortest Paths in Planar Graphs with Negative Weight EdgesEncyclopedia of Algorithms | 1 Jan 2008
- Sparse shape functions for tetrahedral p-FEM using integrated Jacobi polynomialsComputing, Vol. 80, No. 4 | 16 August 2007
- The schur aggregation for solving linear systems of equationsProceedings of the 2007 international workshop on Symbolic-numeric computation | 25 July 2007
- Bond-propagation algorithm for thermodynamic functions in general two-dimensional Ising modelsPhysical Review B, Vol. 76, No. 1 | 5 July 2007
- Tectonic SAM: Exact, Out-of-Core, Submap-Based SLAMProceedings 2007 IEEE International Conference on Robotics and Automation | 1 Apr 2007
- Applications of the FETI-DP-RBS-LNA Algorithm on Large Scale Problems with Localized NonlinearitiesDomain Decomposition Methods in Science and Engineering XVI | 1 Jan 2007
- Almost Exact MatchingsApproximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 1 Jan 2007
- Partitioning and Blocking Issues for a Parallel Incomplete FactorizationApplied Parallel Computing. State of the Art in Scientific Computing | 1 Jan 2007
- Root-Finding with Eigen-SolvingSymbolic-Numeric Computation | 1 Jan 2007
- Out-of-Core Bundle Adjustment for Large-Scale 3D Reconstruction2007 IEEE 11th International Conference on Computer Vision | 1 Jan 2007
- Accidental Algorthims2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06) | 1 Oct 2006
- Planar graphs, negative weight edges, shortest paths, and near linear timeJournal of Computer and System Sciences, Vol. 72, No. 5 | 1 Aug 2006
- New shape functions for triangular p-FEM using integrated Jacobi polynomialsNumerische Mathematik, Vol. 103, No. 3 | 11 April 2006
- Maximum matchings in planar graphs via gaussian eliminationAlgorithmica, Vol. 45, No. 1 | 1 May 2006
- Effective Preconditioning through Ordering Interleaved with Incomplete FactorizationSIAM Journal on Matrix Analysis and Applications, Vol. 27, No. 4 | 31 July 2006
- Applying Parallel Direct Solver Techniques to Build Robust High Performance PreconditionersApplied Parallel Computing. State of the Art in Scientific Computing | 1 Jan 2006
- Finding effective support-tree preconditionersProceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures | 18 July 2005
- Efficient parallel factorization and solution of structured and unstructured linear systemsJournal of Computer and System Sciences, Vol. 71, No. 1 | 1 Jul 2005
- A fast implementation of the FETI-DP method: FETI-DP-RBS-LNA and applications on large scale problems with localized non-linearitiesInternational Journal for Numerical Methods in Engineering, Vol. 63, No. 6 | 1 January 2005
- Planar minimally rigid graphs and pseudo-triangulationsComputational Geometry, Vol. 31, No. 1-2 | 1 May 2005
- On Even Triangulations of 2-Connected Embedded GraphsSIAM Journal on Computing, Vol. 34, No. 3 | 27 July 2006
- Drawing Phylogenetic TreesAlgorithms and Computation | 1 Jan 2005
- ParCYCLIC: finite element modelling of earthquake liquefaction response on parallel computersInternational Journal for Numerical and Analytical Methods in Geomechanics, Vol. 28, No. 12 | 2 August 2004
- Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systemsProceedings of the thirty-sixth annual ACM symposium on Theory of computing | 13 June 2004
- The design and implementation of a new out-of-core sparse cholesky factorization methodACM Transactions on Mathematical Software, Vol. 30, No. 1 | 1 March 2004
- Maximum Matchings in Planar Graphs via Gaussian EliminationAlgorithms – ESA 2004 | 1 Jan 2004
- Planar minimally rigid graphs and pseudo-triangulationsProceedings of the nineteenth annual symposium on Computational geometry | 8 June 2003
- On Even Triangulations of 2-Connected Embedded GraphsComputing and Combinatorics | 24 June 2003
- Task scheduling using a block dependency DAG for block-oriented sparse Cholesky factorizationParallel Computing, Vol. 29, No. 1 | 1 Jan 2003
- Solving sparse, symmetric, diagonally-dominant linear systems in time O(m/sup 1.31/44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings. | 1 Jan 2003
- Preconditioning Techniques for Large Linear Systems: A SurveyJournal of Computational Physics, Vol. 182, No. 2 | 1 Nov 2002
- Recent advances in direct methods for solving unsymmetric sparse systems of linear equationsACM Transactions on Mathematical Software, Vol. 28, No. 3 | 1 September 2002
- Symbolic and Numeric Methods for Exploiting Structure in Constructing Resultant MatricesJournal of Symbolic Computation, Vol. 33, No. 4 | 1 Apr 2002
- A Simple Linear Time Algorithm for Finding Even Triangulations of 2-Connected Bipartite Plane GraphsAlgorithms — ESA 2002 | 29 August 2002
- Min–max-boundary domain decompositionTheoretical Computer Science, Vol. 261, No. 2 | 1 Jun 2001
- Recursive conditioningArtificial Intelligence, Vol. 126, No. 1-2 | 1 Feb 2001
- Software PackagesDrawing Graphs | 25 April 2001
- Numerical linear algebra algorithms and softwareNumerical Analysis: Historical Developments in the 20th Century | 1 Jan 2001
- Fast maximum likelihood estimation of very large spatial autoregressive models: a characteristic polynomial approachComputational Statistics & Data Analysis, Vol. 35, No. 3 | 1 Jan 2001
- Planar graphs, negative weight edges, shortest paths, and near linear timeProceedings 42nd IEEE Symposium on Foundations of Computer Science | 1 Jan 2001
- Refining an approximate inverseJournal of Computational and Applied Mathematics, Vol. 123, No. 1-2 | 1 Nov 2000
- Numerical linear algebra algorithms and softwareJournal of Computational and Applied Mathematics, Vol. 123, No. 1-2 | 1 Nov 2000
- New Algorithm for the Ising Problem: Partition Function for Finite Lattice GraphsPhysical Review Letters, Vol. 84, No. 26 | 26 June 2000
- Hybridizing nested dissection and halo approximate minimum degree for efficient sparse matrix orderingConcurrency: Practice and Experience, Vol. 12, No. 2-3 | 1 January 2000
- Parallel Complexity of Computations with General and Toeplitz-Like Matrices Filled with Integers and ExtensionsSIAM Journal on Computing, Vol. 30, No. 4 | 27 July 2006
- Orderings for Factorized Sparse Approximate Inverse PreconditionersSIAM Journal on Scientific Computing, Vol. 21, No. 5 | 25 July 2006
- Schur Complement Systems in the Mixed-Hybrid Finite Element Approximation of the Potential Fluid Flow ProblemSIAM Journal on Scientific Computing, Vol. 22, No. 2 | 25 July 2006
- Preconditioning Highly Indefinite and Nonsymmetric MatricesSIAM Journal on Scientific Computing, Vol. 22, No. 4 | 17 February 2012
- A Dynamic Algorithm for Maintaining Graph PartitionsAlgorithm Theory - SWAT 2000 | 15 March 2002
- Gaussian elimination for the solution of linear systems of equationsSolution of Equation in ℝn (Part 3), Techniques of Scientific Computing (Part 3) | 1 Jan 2000
- Nested graph dissection and approximation algorithmsProceedings 41st Annual Symposium on Foundations of Computer Science | 1 Jan 2000
- Hybridizing nested dissection and halo approximate minimum degree for efficient sparce matrix orderingParallel and Distributed Processing | 28 October 2006
- ReferencesComputer Solution of Large Linear Systems | 1 Jan 1999
- A graph-theoretic approach to queueing analysis part i: theoryCommunications in Statistics. Stochastic Models, Vol. 15, No. 5 | 1 Jan 1999
- Efficient approximate solution of sparse linear systemsComputers & Mathematics with Applications, Vol. 36, No. 9 | 1 Nov 1998
- Robust Ordering of Sparse Matrices using MultisectionSIAM Journal on Matrix Analysis and Applications, Vol. 19, No. 3 | 31 July 2006
- Geometric Separators for Finite-Element MeshesSIAM Journal on Scientific Computing, Vol. 19, No. 2 | 25 July 2006
- Min-Max-Boundary Domain DecompositionComputing and Combinatorics | 4 June 2002
- Geometric separator theorems and applicationsProceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280) | 1 Jan 1998
- Treewidth for graphs with small chordalityDiscrete Applied Mathematics, Vol. 79, No. 1-3 | 1 Nov 1997
- How Good is Recursive Bisection?SIAM Journal on Scientific Computing, Vol. 18, No. 5 | 25 July 2006
- Separators and structure prediction in sparse orthogonal factorizationLinear Algebra and its Applications, Vol. 262 | 1 Sep 1997
- Faster Shortest-Path Algorithms for Planar GraphsJournal of Computer and System Sciences, Vol. 55, No. 1 | 1 Aug 1997
- Parallel ordering using edge contractionParallel Computing, Vol. 23, No. 8 | 1 Aug 1997
- Fast Nested Dissection for Finite Element MeshesSIAM Journal on Matrix Analysis and Applications, Vol. 18, No. 3 | 31 July 2006
- Highly scalable parallel algorithms for sparse matrix factorizationIEEE Transactions on Parallel and Distributed Systems, Vol. 8, No. 5 | 1 May 1997
- Separators for sphere-packings and nearest neighbor graphsJournal of the ACM, Vol. 44, No. 1 | 15 January 1997
- Weighted graph separators and their applicationsAlgorithms — ESA '97 | 30 July 2005
- Graph Partitioning Algorithms with Applications to Scientific ComputingParallel Numerical Algorithms | 1 Jan 1997
- Application of the Newton method to the calculation of internal supersonic separated flowsJournal of Applied Mechanics and Technical Physics, Vol. 38, No. 1 | 1 Jan 1997
- Parallelizing elimination orders with linear fillProceedings 38th Annual Symposium on Foundations of Computer Science | 1 Jan 1997
- A Comparison of Computational Complexities of Hfem and Abc Based Finite Element MethodsJournal of Electromagnetic Waves and Applications, Vol. 11, No. 12 | 3 April 2012
- Solving large nonsymmetric sparse linear systems using MCSPARSEParallel Computing, Vol. 22, No. 10 | 1 Dec 1996
- Multifrontal Computation with the Orthogonal Factors of Sparse MatricesSIAM Journal on Matrix Analysis and Applications, Vol. 17, No. 3 | 17 February 2012
- A Graph-Coloring Result and Its Consequences for Polygon-Guarding ProblemsSIAM Journal on Discrete Mathematics, Vol. 9, No. 2 | 12 July 2006
- An Algebraic Model for Combinatorial ProblemsSIAM Journal on Computing, Vol. 25, No. 2 | 13 July 2006
- On the ordering of sparse linear systemsTheoretical Computer Science, Vol. 156, No. 1-2 | 1 Mar 1996
- Linear Algorithms for Partitioning Embedded Graphs of Bounded GenusSIAM Journal on Discrete Mathematics, Vol. 9, No. 1 | 1 August 2006
- Fast separator decomposition for finite element meshesComputing and Combinatorics | 4 June 2005
- OBDDs of a monotone function and of its prime implicantsAlgorithms and Computation | 11 October 2005
- Automatic parallelization of the conjugate gradient algorithmLanguages and Compilers for Parallel Computing | 9 June 2005
- BibliographyCombinatorial Geometry | 28 October 2011
- Flow in Planar Graphs with Multiple Sources and SinksSIAM Journal on Computing, Vol. 24, No. 5 | 13 July 2006
- A new approach to solving three combinatorial enumeration problems on planar graphsDiscrete Applied Mathematics, Vol. 60, No. 1-3 | 1 Jun 1995
- Parallel computation of a Krylov matrix for a sparse and structured inputMathematical and Computer Modelling, Vol. 21, No. 11 | 1 Jun 1995
- How to draw a planar clustered graphComputing and Combinatorics | 20 June 2005
- Efficient parallel solution of sparse eigenvalue and eigenvector problemsProceedings of IEEE 36th Annual Foundations of Computer Science | 1 Jan 1995
- Provably good mesh generationJournal of Computer and System Sciences, Vol. 48, No. 3 | 1 Jun 1994
- Steady flow with separation past a thin airfoil at high Reynolds numbersFluid Dynamics, Vol. 29, No. 2 | 1 Apr 1994
- Flow in planar graphs with vertex capacitiesAlgorithmica, Vol. 11, No. 3 | 1 Mar 1994
- Deepness analysis: Bringing optimal fronts to triangular finite element methodParallel and Distributed Computing Theory and Practice | 1 June 2005
- Supersonic viscous perfect gas flow past a circular cylinderFluid Dynamics, Vol. 28, No. 6 | 1 Jan 1994
- Efficient Decomposition of Internally-Regular Grids for Massively Parallel ProcessingMassively Parallel Processing Applications and Development | 1 Jan 1994
- O(N/sup 1.5/) solution of hybrid FEM problemsProceedings of IEEE Antennas and Propagation Society International Symposium and URSI National Radio Science Meeting | 1 Jan 1994
- Parallel algorithms for k-tree recognition and its applicationsProceedings of the Twenty-Seventh Hawaii International Conference on System Sciences HICSS-94 | 1 Jan 1994
- Fast and Efficient Parallel Solution of Sparse Linear SystemsSIAM Journal on Computing, Vol. 22, No. 6 | 31 July 2006
- A Note on Probabilistic Analysis of a Sparse Matrix Factorization Scheme and Random GraphsProbability in the Engineering and Informational Sciences, Vol. 7, No. 4 | 27 July 2009
- Dividing and conquering the squareDiscrete Applied Mathematics, Vol. 43, No. 2 | 1 May 1993
- Edge separators for graphs of bounded genus with applicationsTheoretical Computer Science, Vol. 112, No. 2 | 1 May 1993
- Cutting down on Fill Using Nested Dissection: Provably Good Elimination OrderingsGraph Theory and Sparse Matrix Computation | 1 Jan 1993
- Automatic Mesh PartitioningGraph Theory and Sparse Matrix Computation | 1 Jan 1993
- An O(nlog/sup 3/ n) algorithm for the real root problemProceedings of 1993 IEEE 34th Annual Foundations of Computer Science | 1 Jan 1993
- Not all planar diagraphs have small cycle separatorsInformation Processing Letters, Vol. 44, No. 2 | 1 Nov 1992
- Sparse matrix techniques applied to deconvolutionComputers & Electrical Engineering, Vol. 18, No. 6 | 1 Nov 1992
- A parallel algorithm for elimination tree computation and symbolic factorizationParallel Computing, Vol. 18, No. 8 | 1 Aug 1992
- Complexity of Computations with Matrices and PolynomialsSIAM Review, Vol. 34, No. 2 | 2 August 2006
- Space and time efficient implementations of parallel nested dissectionProceedings of the fourth annual ACM symposium on Parallel algorithms and architectures | 1 June 1992
- Approximating treewidth, pathwidth, and minimum elimination tree heightGraph-Theoretic Concepts in Computer Science | 5 June 2005
- Edge separators for graphs of bounded genus with applicationsGraph-Theoretic Concepts in Computer Science | 5 June 2005
- Efficient algorithms for solving systems of linear equations and path problemsSTACS 92 | 2 June 2005
- Towards a fast implementation of spectral nested dissectionProceedings Supercomputing '92 | 1 Jan 1992
- Parallel Algorithms for Sparse Linear SystemsSIAM Review, Vol. 33, No. 3 | 18 July 2006
- Automatic Domain Partitioning in Three DimensionsSIAM Journal on Scientific and Statistical Computing, Vol. 12, No. 4 | 13 July 2006
- On wiedemann's method of solving sparse linear systemsApplied Algebra, Algebraic Algorithms and Error-Correcting Codes | 7 June 2005
- Complexity of Algorithms for Linear Systems of EquationsComputer Algorithms for Solving Linear Algebraic Equations | 1 Jan 1991
- A unified geometric approach to graph separators[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science | 1 Jan 1991
- On the Performance of the Minimum Degree Ordering for Gaussian EliminationSIAM Journal on Matrix Analysis and Applications, Vol. 11, No. 1 | 17 July 2006
- Efficient sequential and parallel algorithms for planar minimum cost flowAlgorithms | 4 June 2005
- Planar separators and the Euclidean normAlgorithms | 4 June 2005
- Planar Graph ProblemsComputational Graph Theory | 1 Jan 1990
- Path Problems in GraphsComputational Graph Theory | 1 Jan 1990
- Estimating the extremal eigenvalues of a symmetric matrixComputers & Mathematics with Applications, Vol. 20, No. 2 | 1 Jan 1990
- Solution of sparse positive definite systems on a hypercube* *Research was supported by the Applied Mathematical Sciences Research Program of the Office of Energy Research, U.S. Department of Energy, and by the Canadian Natural Sciences and Engineering Research Council under grant A5509.Parallel Algorithms for Numerical Linear Algebra | 1 Jan 1990
- Provably good mesh generationProceedings [1990] 31st Annual Symposium on Foundations of Computer Science | 1 Jan 1990
- Approximation through multicommodity flowProceedings [1990] 31st Annual Symposium on Foundations of Computer Science | 1 Jan 1990
- Solution of sparse positive definite systems on a hypercubeJournal of Computational and Applied Mathematics, Vol. 27, No. 1-2 | 1 Sep 1989
- Multigrid Monte Carlo method. Conceptual foundationsPhysical Review D, Vol. 40, No. 6 | 15 September 1989
- Parallel implementation of sparse LU decomposition for chemical engineering applicationsComputers & Chemical Engineering, Vol. 13, No. 8 | 1 Aug 1989
- Acceleration of circuit simulation on a parallel transputer workstationMicroprocessing and Microprogramming, Vol. 27, No. 1-5 | 1 Aug 1989
- Testing the necklace condition for shortest tours and optimal factors in the planeTheoretical Computer Science, Vol. 66, No. 2 | 1 Aug 1989
- Algorithms for multicommodity flows in planar graphsAlgorithmica, Vol. 4, No. 1-4 | 1 Jun 1989
- Fast and efficient solution of path algebra problemsJournal of Computer and System Sciences, Vol. 38, No. 3 | 1 Jun 1989
- Algebraic multi-grid method for disordered systemsNuclear Physics B - Proceedings Supplements, Vol. 9 | 1 Jun 1989
- Local optimization on graphsDiscrete Applied Mathematics, Vol. 23, No. 2 | 1 May 1989
- On the Complexity of Sparse $QR$ and $LU$ Factorization of Finite-Element MatricesSIAM Journal on Scientific and Statistical Computing, Vol. 9, No. 5 | 13 July 2006
- A parallel graph partitioning algorithm for a message-passing multiprocessorSupercomputing | 27 May 2005
- New Numerical Algorithms for Critical Phenomena (Multi-Grid Methods and All That)Computer Simulation Studies in Condensed Matter Physics | 1 Jan 1988
- Edge separators for planar graphs and their applicationsMathematical Foundations of Computer Science 1988 | 1 Jan 1988
- All graphs have cycle separators and planar directed depth-first search is in DNCVLSI Algorithms and Architectures | 1 Jan 1988
- Some nested dissection order is nearly optimalInformation Processing Letters, Vol. 26, No. 6 | 1 Jan 1988
- ReferencesPlanar Graphs: Theory and Algorithms | 1 Jan 1988
- Étude de la séparation et de l'élimination sur une famille de graphes quotients déduite d'une méthode de dissections emboîtéesRAIRO - Theoretical Informatics and Applications, Vol. 22, No. 2 | 8 January 2011
- Automatic graph drawing and readability of diagramsIEEE Transactions on Systems, Man, and Cybernetics, Vol. 18, No. 1 | 1 Jan 1988
- Fast Algorithms for Shortest Paths in Planar Graphs, with ApplicationsSIAM Journal on Computing, Vol. 16, No. 6 | 13 July 2006
- A parallel graph partitioning algorithm for a message-passing multiprocessorInternational Journal of Parallel Programming, Vol. 16, No. 6 | 1 Dec 1987
- A Parallel Solution Method for Large Sparse Systems of EquationsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, Vol. 6, No. 6 | 1 Nov 1987
- A parallel algorithm for finding a separator in planar graphs28th Annual Symposium on Foundations of Computer Science (sfcs 1987) | 1 Oct 1987
- Algorithmic Aspects of Symbolic Switch Network AnalysisIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, Vol. 6, No. 4 | 1 Jul 1987
- Solving Tridiagonal Systems on Ensemble ArchitecturesSIAM Journal on Scientific and Statistical Computing, Vol. 8, No. 3 | 14 July 2006
- Response : Solving Linear EquationsScience, Vol. 236, No. 4800 | 24 Apr 1987
- An algorithm for multicommodity flows in a class of planar networksElectronics and Communications in Japan (Part I: Communications), Vol. 70, No. 2 | 23 March 2007
- Testing the necklace condition for Shortest Tours and optimal factors in the planeAutomata, Languages and Programming | 29 May 2005
- Update to "data parallel algorithms"Communications of the ACM, Vol. 30, No. 1 | 1 January 1987
- Iterative Methods for the Solution of Elliptic Problems on Regions Partitioned into SubstructuresSIAM Journal on Numerical Analysis, Vol. 23, No. 6 | 14 July 2006
- Fast and efficient linear programming and linear least-squares computationsComputers & Mathematics with Applications, Vol. 12, No. 12 | 1 Dec 1986
- Parallel nested dissection for path algebra computationsOperations Research Letters, Vol. 5, No. 4 | 1 Oct 1986
- Efficient parallel linear programmingOperations Research Letters, Vol. 5, No. 3 | 1 Aug 1986
- The analysis of a nested dissection algorithmNumerische Mathematik, Vol. 50, No. 4 | 1 Jul 1986
- Finding small simple cycle separators for 2-connected planar graphsJournal of Computer and System Sciences, Vol. 32, No. 3 | 1 Jun 1986
- Fast and efficient parallel linear programming and linear least squares computationsVLSI Algorithms and Architectures | 1 June 2005
- On the inherent combinatorial complexity of geometric problems in d - dimensional spaceMathematical Foundations of Computer Science 1986 | 1 Jan 1986
- Auxiliary Storage Methods for Solving Finite Element SystemsSIAM Journal on Scientific and Statistical Computing, Vol. 6, No. 4 | 14 July 2006
- Solving narrow banded systems on ensemble architecturesACM Transactions on Mathematical Software, Vol. 11, No. 3 | 1 September 1985
- An $O(n\log ^2 n)$ Algorithm for Maximum Flow in Undirected Planar NetworksSIAM Journal on Computing, Vol. 14, No. 3 | 2 August 2006
- Drawing plane graphs nicelyActa Informatica, Vol. 22, No. 2 | 1 June 1985
- Calculs de complexit� relatifs � une m�thode de dissection embo�t�eNumerische Mathematik, Vol. 47, No. 2 | 1 Jun 1985
- On factored discretizations of the laplacian for the fast solution of Poisson's equation on general regionsBIT, Vol. 24, No. 4 | 1 Dec 1984
- A Separator Theorem for Chordal GraphsSIAM Journal on Algebraic Discrete Methods, Vol. 5, No. 3 | 31 July 2006
- A separator theorem for graphs of bounded genusJournal of Algorithms, Vol. 5, No. 3 | 1 Sep 1984
- The Solution of Sparse Systems of Linear EquationsAnalysis and Simulation of Semiconductor Devices | 1 Jan 1984
- Direct Methods for Solving Finite Element EquationsFinite Element Solution of Boundary Value Problems | 1 Jan 1984
- ReferencesSparse Matrix Technology | 1 Jan 1984
- Partition of planar flow networks24th Annual Symposium on Foundations of Computer Science (sfcs 1983) | 1 Nov 1983
- Shortest path problems in planar graphs24th Annual Symposium on Foundations of Computer Science (sfcs 1983) | 1 Nov 1983
- Experience with the Parallel Solution of Partial Differential Equations on a Distributed Computing SystemIEEE Transactions on Computers, Vol. C-31, No. 12 | 1 Dec 1982
- A New Implementation of Sparse Gaussian EliminationACM Transactions on Mathematical Software, Vol. 8, No. 3 | 1 September 1982
- Optimizing synchronous systems22nd Annual Symposium on Foundations of Computer Science (sfcs 1981) | 1 Oct 1981
- Applications of a Planar Separator TheoremSIAM Journal on Computing, Vol. 9, No. 3 | 13 July 2006
- Algorithms and software for in-core factorization of sparse symmetric positive definite matricesComputers & Structures, Vol. 11, No. 6 | 1 Jun 1980
- Numerical stability of nested dissection orderingsMathematics of Computation, Vol. 35, No. 152 | 1 January 1980
View Options
- Access via your Institution
- Questions about how to access this content? Contact SIAM at [email protected].