On the public citation graph
The analysis of a nested dissection algorithm
0 signed · 125 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bf01389708openalex-snapshot
Calculs de complexit� relatifs � une m�thode de dissection embo�t�e
inferredcites →https://doi.org/10.1016/0196-6774(84)90019-1openalex-snapshot
A separator theorem for graphs of bounded genus
inferredcites →https://doi.org/10.1016/b978-1-4832-3187-7.50018-0openalex-snapshot
A GRAPH-THEORETIC STUDY OF THE NUMERICAL SOLUTION OF SPARSE POSITIVE DEFINITE SYSTEMS OF LINEAR EQUATIONS
inferredcites →https://doi.org/10.1112/jlms/s1-39.1.12openalex-snapshot
Decomposition of Finite Graphs Into Forests
inferredcites →https://doi.org/10.1137/0136016openalex-snapshot
A Separator Theorem for Planar Graphs
inferredcites →https://doi.org/10.1137/0205021openalex-snapshot
Algorithmic Aspects of Vertex Elimination on Graphs
inferredcites →https://doi.org/10.1137/0602010openalex-snapshot
Computing the Minimum Fill-In is NP-Complete
inferredcites →https://doi.org/10.1137/0603022openalex-snapshot
On the Problem of Partitioning Planar Graphs
inferredcites →https://doi.org/10.1137/0605032openalex-snapshot
A Separator Theorem for Chordal Graphs
inferredcites →https://doi.org/10.1137/0710032openalex-snapshot
Nested Dissection of a Regular Finite Element Mesh
inferredcites →https://doi.org/10.1137/0715069openalex-snapshot
An Automatic Nested Dissection Algorithm for Irregular Finite Element Problems
inferredcites →https://doi.org/10.1137/1003021openalex-snapshot
The Use of Linear Graphs in Gauss Elimination
inferredcites →https://doi.org/10.1145/800057.808703openalex-snapshot
Finding small simple cycle separators for 2-connected planar graphs.
inferredcites →https://doi.org/10.1145/800070.802180openalex-snapshot
A layout strategy for VLSI which is provably good (Extended Abstract)
inferredcites →https://doi.org/10.1184/r1/6587528openalex-snapshot
A layout for the shuffle-exchange network
inferredcites →https://doi.org/10.1515/crll.1869.70.185openalex-snapshot
Sur les assemblages de lignes.
inferredcites →https://doi.org/10.2307/2007640openalex-snapshot
Computer Solution of Large Sparse Positive Definite Systems.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/inco.1995.1111openalex-snapshot
On Parallel Computations with Banded Matrices
inferred← citeshttps://doi.org/10.1006/jpdc.1997.1413openalex-snapshot
Models and Scheduling Algorithms for Mixed Data and Task Parallel Programs
inferred← citeshttps://doi.org/10.1007/3-540-18991-2_29openalex-snapshot
A parallel graph partitioning algorithm for a message-passing multiprocessor
inferred← citeshttps://doi.org/10.1007/3-540-44985-x_8openalex-snapshot
A Dynamic Algorithm for Maintaining Graph Partitions
inferred← citeshttps://doi.org/10.1007/3-540-48311-x_147openalex-snapshot
Estimating Computer Performance for Parallel Sparse QR Factorisation
inferred← citeshttps://doi.org/10.1007/3-540-55895-0_424openalex-snapshot
Partitioning and mapping for parallel nested dissection on distributed memory architectures
inferred← citeshttps://doi.org/10.1007/3-540-61332-3_152openalex-snapshot
Fast separator decomposition for finite element meshes
inferred← citeshttps://doi.org/10.1007/3-540-63397-9_11openalex-snapshot
Weighted graph separators and their applications
inferred← citeshttps://doi.org/10.1007/978-1-4613-8369-7_2openalex-snapshot
Cutting down on Fill Using Nested Dissection: Provably Good Elimination Orderings
inferred← citeshttps://doi.org/10.1007/978-1-4613-8369-7_3openalex-snapshot
Automatic Mesh Partitioning
inferred← citeshttps://doi.org/10.1007/978-1-4614-1168-0_15openalex-snapshot
Numerical Thinking in Algorithm Design and Analysis
inferred← citeshttps://doi.org/10.1007/978-3-319-51317-1_9openalex-snapshot
Practical Implementation Aspects of Large-Scale Optimal Control Solvers
inferred← citeshttps://doi.org/10.1007/978-3-319-93701-4_60openalex-snapshot
Bisections-Weighted-by-Element-Size-and-Order Algorithm to Optimize Direct Solver Performance on 3D hp-adaptive Grids
inferred← citeshttps://doi.org/10.1007/978-3-540-68891-4_8openalex-snapshot
A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-13562-0_2openalex-snapshot
The Laplacian Paradigm: Emerging Algorithms for Massive Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-39206-1_9openalex-snapshot
Search-Space Size in Contraction Hierarchies
inferred← citeshttps://doi.org/10.1007/978-3-642-76717-3_2openalex-snapshot
Complexity of Algorithms for Linear Systems of Equations
inferred← citeshttps://doi.org/10.1007/bf01388998openalex-snapshot
A parallel graph partitioning algorithm for a message-passing multiprocessor
inferred← citeshttps://doi.org/10.1007/bf01396049openalex-snapshot
Algorithmique et calculs de complexit� pour un solveur de type dissections embo�t�es
inferred← citeshttps://doi.org/10.1007/bfb0054369openalex-snapshot
Minimal elimination of planar graphs
inferred← citeshttps://doi.org/10.1007/pl00009250openalex-snapshot
Separators in Graphs with Negative and Multiple Vertex Weights
inferred← citeshttps://doi.org/10.1007/s004530010031openalex-snapshot
Partitioning Planar Graphs with Vertex Costs: Algorithms and Applications
inferred← citeshttps://doi.org/10.1007/s00454-023-00564-3openalex-snapshot
Maximum Matchings in Geometric Intersection Graphs
inferred← citeshttps://doi.org/10.1007/s12293-012-0086-yopenalex-snapshot
Benchmarking ordering techniques for nonserial dynamic programming
inferred← citeshttps://doi.org/10.1007/s12532-012-0040-5openalex-snapshot
LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison
inferred← citeshttps://doi.org/10.1016/0020-0190(88)90191-3openalex-snapshot
Some nested dissection order is nearly optimal
inferred← citeshttps://doi.org/10.1016/0167-8191(90)90061-dopenalex-snapshot
Expression for massively parallel algorithms — description and illustrative example
inferred← citeshttps://doi.org/10.1016/0377-0427(89)90364-6openalex-snapshot
Solution of sparse positive definite systems on a hypercube
inferred← citeshttps://doi.org/10.1016/0895-7177(95)00084-fopenalex-snapshot
Parallel computation of a Krylov matrix for a sparse and structured input
inferred← citeshttps://doi.org/10.1016/b978-0-444-88621-7.50012-8openalex-snapshot
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.
inferred← citeshttps://doi.org/10.1016/j.comgeo.2006.05.005openalex-snapshot
On the stabbing number of a random Delaunay triangulation
inferred← citeshttps://doi.org/10.1016/j.finel.2021.103718openalex-snapshot
Simulation of large dimensional reinforced and prestressed concrete structures using a new adaptive static condensation method including automatic mesh partitioning
inferred← citeshttps://doi.org/10.1016/j.ic.2020.104514openalex-snapshot
Minimum fill-in: Inapproximability and almost tight lower bounds
inferred← citeshttps://doi.org/10.1016/j.parco.2018.10.005openalex-snapshot
Concurrency of three-dimensional refined isogeometric analysis
inferred← citeshttps://doi.org/10.1016/j.spasta.2015.10.006openalex-snapshot
Multi-level restricted maximum likelihood covariance estimation and kriging for large non-gridded spatial datasets
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.07.003openalex-snapshot
Search-space size in contraction hierarchies
inferred← citeshttps://doi.org/10.1016/s0898-1221(98)00191-6openalex-snapshot
Efficient approximate solution of sparse linear systems
inferred← citeshttps://doi.org/10.1017/s0962492914000038openalex-snapshot
Communication lower bounds and optimal algorithms for numerical linear algebra
inferred← citeshttps://doi.org/10.1017/s0962492916000076openalex-snapshot
A survey of direct methods for sparse linear systems
inferred← citeshttps://doi.org/10.1038/s41534-025-01056-3openalex-snapshot
Optimization complexity and resource minimization of emitter-based photonic graph state generation protocols
inferred← citeshttps://doi.org/10.1051/ita/1988220202451openalex-snapshot
É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ées
inferred← citeshttps://doi.org/10.1080/15427951.2016.1182952openalex-snapshot
Tree decompositions and social graphs
inferred← citeshttps://doi.org/10.1088/1742-6596/180/1/012015openalex-snapshot
Factorization-based sparse solvers and preconditioners
inferred← citeshttps://doi.org/10.1103/6hj9-tgctopenalex-snapshot
Efficient local classification of parity-based material topology
inferred← citeshttps://doi.org/10.1109/focs.2008.14openalex-snapshot
Matrix Sparsification for Rank and Determinant Computations via Nested Dissection
inferred← citeshttps://doi.org/10.1109/focs.2010.28openalex-snapshot
Solving Linear Systems through Nested Dissection
inferred← citeshttps://doi.org/10.1109/focs.2011.15openalex-snapshot
Separator Theorems for Minor-Free and Shallow Minor-Free Graphs with Applications
inferred← citeshttps://doi.org/10.1109/focs.2018.00019openalex-snapshot
Graph Sketching against Adaptive Adversaries Applied to the Minimum Degree Algorithm
inferred← citeshttps://doi.org/10.1109/iccad66269.2025.11240789openalex-snapshot
SubtreeLU: High-Performance Parallel Sparse LU Factorization for Circuit Simulation
inferred← citeshttps://doi.org/10.1109/icdm.2013.77openalex-snapshot
Tree-Like Structure in Large Social and Information Networks
inferred← citeshttps://doi.org/10.1109/sfcs.1991.185417openalex-snapshot
A unified geometric approach to graph separators
inferred← citeshttps://doi.org/10.1109/sfcs.1997.646116openalex-snapshot
Parallelizing elimination orders with linear fill
inferred← citeshttps://doi.org/10.1109/sfcs.2000.892072openalex-snapshot
Nested graph dissection and approximation algorithms
inferred← citeshttps://doi.org/10.1109/tc.2013.7openalex-snapshot
An Efficient Memetic Algorithm for theMax-Bisection Problem
inferred← citeshttps://doi.org/10.1134/s1995423910030055openalex-snapshot
Building graph separators with the recursive rotation algorithm for the nested dissection method
inferred← citeshttps://doi.org/10.1137/0222073openalex-snapshot
Fast and Efficient Parallel Solution of Sparse Linear Systems
inferred← citeshttps://doi.org/10.1137/060650295openalex-snapshot
Rigidity in Finite-Element Matrices: Sufficient Conditions for the Rigidity of Structures and Substructures
inferred← citeshttps://doi.org/10.1137/060675253openalex-snapshot
On the Graph Bisection Cut Polytope
inferred← citeshttps://doi.org/10.1137/0611010openalex-snapshot
The Role of Elimination Trees in Sparse Factorization
inferred← citeshttps://doi.org/10.1137/09074543xopenalex-snapshot
Superfast Multifrontal Method for Large Structured Linear Systems of Equations
inferred← citeshttps://doi.org/10.1137/090757575openalex-snapshot
Hypergraph Partitioning-Based Fill-Reducing Ordering for Symmetric Matrices
inferred← citeshttps://doi.org/10.1137/090769156openalex-snapshot
Minimizing Communication in Numerical Linear Algebra
inferred← citeshttps://doi.org/10.1137/090771430openalex-snapshot
Nearly Linear Time Algorithms for Preconditioning and Solving Symmetric, Diagonally Dominant Linear Systems
inferred← citeshttps://doi.org/10.1137/1.9781611977073.7openalex-snapshot
Nested Dissection Meets IPMs: Planar Min-Cost Flow in Nearly-Linear Time
inferred← citeshttps://doi.org/10.1137/19m129526xopenalex-snapshot
Compression, Inversion, and Approximate PCA of Dense Kernel Matrices at Near-Linear Computational Complexity
inferred← citeshttps://doi.org/10.1137/22m1538260openalex-snapshot
The Shortest Even Cycle Problem Is Tractable
inferred← citeshttps://doi.org/10.1137/25m175857xopenalex-snapshot
Randomized Block Low-Rank Matrix Compression by Tagging
inferred← citeshttps://doi.org/10.1137/s0895479893259509openalex-snapshot
Multifrontal Computation with the Orthogonal Factors of Sparse Matrices
inferred← citeshttps://doi.org/10.1137/s0895479895284282openalex-snapshot
Fast Nested Dissection for Finite Element Meshes
inferred← citeshttps://doi.org/10.1137/s0895480194272183openalex-snapshot
Linear Algorithms for Partitioning Embedded Graphs of Bounded Genus
inferred← citeshttps://doi.org/10.1137/s1064827593255135openalex-snapshot
How Good is Recursive Bisection?
inferred← citeshttps://doi.org/10.1145/100216.100255openalex-snapshot
Separators in two and three dimensions
inferred← citeshttps://doi.org/10.1145/1378533.1378559openalex-snapshot
Graph partitioning into isolated, high conductance clusters
inferred← citeshttps://doi.org/10.1145/160985.161005openalex-snapshot
A deterministic linear time algorithm for geometric separators and its applications
inferred← citeshttps://doi.org/10.1145/215399.215423openalex-snapshot
Modeling the benefits of mixed data and task parallelism
inferred← citeshttps://doi.org/10.1145/237218.237401openalex-snapshot
Convex drawings of graphs in two and three dimensions (preliminary version)
inferred← citeshttps://doi.org/10.1145/2508028.2505989openalex-snapshot
Matrix sparsification and nested dissection over arbitrary fields
inferred← citeshttps://doi.org/10.1145/2629641openalex-snapshot
A Parallel Sparse Direct Solver via Hierarchical DAG Scheduling
inferred← citeshttps://doi.org/10.1145/305619.305640openalex-snapshot
Tradeoffs between parallelism and fill in nested dissection
inferred← citeshttps://doi.org/10.1145/3173045openalex-snapshot
Graph Bisection with Pareto Optimization
inferred← citeshttps://doi.org/10.1145/318789.318820openalex-snapshot
Data traffic reduction schemes for Cholesky factorization on asynchronous multiprocessor systems
inferred← citeshttps://doi.org/10.1145/3519935.3520030openalex-snapshot
The shortest even cycle problem is tractable
inferred← citeshttps://doi.org/10.1145/3581784.3607046openalex-snapshot
Bringing Order to Sparsity: A Sparse Matrix Reordering Study on Multicore CPUs
inferred← citeshttps://doi.org/10.1145/3712285.3759885openalex-snapshot
Improving SpGEMM Performance Through Matrix-Reordering and Cluster-wise Computation
inferred← citeshttps://doi.org/10.1145/3744639openalex-snapshot
Nested Dissection Meets IPMs: Planar Min-Cost Flow in Nearly-Linear Time
inferred← citeshttps://doi.org/10.1145/66888.66890openalex-snapshot
A graph partitioning algorithm by node separators
inferred← citeshttps://doi.org/10.1155/2017/7072197openalex-snapshot
Development and Application of a New High-Efficiency Sparse Linear System Solver in the Thermal-Hydraulic System Analysis Code
inferred← citeshttps://doi.org/10.1201/9781584888239-c17openalex-snapshot
Algebraic and Numerical Algorithms
inferred← citeshttps://doi.org/10.1201/b11644-3openalex-snapshot
Combinatorial Problems in Solving Linear Systems
inferred← citeshttps://doi.org/10.1364/oe.457233openalex-snapshot
Effect of choices of boundary conditions on the numerical efficiency of direct solutions of finite difference frequency domain systems with perfectly matched layers
inferred← citeshttps://doi.org/10.17077/etd.k6brlr42openalex-snapshot
Construction and application of hierarchical matrix preconditioners
inferred← citeshttps://doi.org/10.2139/ssrn.7484836openalex-snapshot
Evaluating Quantum Algorithms for Traffic Equilibrium Computation
inferred← citeshttps://doi.org/10.21914/anziamj.v42i0.631openalex-snapshot
The scalability of parallel computers for sparse QR factorisation
inferred← citeshttps://doi.org/10.3233/fi-1995-2241openalex-snapshot
A DETERMINISTIC LINEAR TIME ALGORITHM FOR GEOMETRIC SEPARATORS AND ITS APPLICATIONS
inferred← citeshttps://doi.org/10.3390/s8020635openalex-snapshot
Vertex Separators for Partitioning a Graph
inferred← citeshttps://doi.org/10.4230/lipics.ipec.2020.33openalex-snapshot
Graph Bisection with Pareto-Optimization
inferred← citeshttps://doi.org/10.48550/arxiv.1311.3731openalex-snapshot
Chapter 10: Algebraic Algorithms
inferred← citeshttps://doi.org/10.48550/arxiv.1711.08446openalex-snapshot
On Computing Min-Degree Elimination Orderings
inferred← citeshttps://doi.org/10.5555/1283383.1283396openalex-snapshot
Maximum matching in graphs with an excluded minor
inferred← citeshttps://doi.org/10.70675/635276edz935ez4c82zb8d7z8966aee60c21openalex-snapshot
Combler l’écart entre H-Matrices et méthodes directes creuses pour la résolution de systèmes linéaires de grandes tailles
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.