On the public citation graph
An Automatic Nested Dissection Algorithm for Irregular Finite Element Problems
0 signed · 167 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/bf02478000openalex-snapshot
The theory of graphs and its applications
inferredcites →https://doi.org/10.1016/0022-247x(74)90179-6openalex-snapshot
Partitioning, tearing and modification of sparse linear systems
inferredcites →https://doi.org/10.1016/0309-1708(80)90069-xopenalex-snapshot
An analysis of the finite element method
inferredcites →https://doi.org/10.1016/b978-0-12-141050-6.50009-xopenalex-snapshot
A Recursive Analysis of Dissection Strategies††This work was supported in part by the Office of Naval Research under contract N00014-75-C-0243.
inferredcites →https://doi.org/10.1016/b978-0-12-141050-6.50010-6openalex-snapshot
Applications of an Element Model for Gaussian Elimination11This work was supported in part by NSF Grant GJ-43157 and ONR Grant N00014-67-A-0097-0016.
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.1093/comjnl/9.3.281openalex-snapshot
A Compact Storage Scheme for the Solution of Symmetric Linear Simultaneous Equations
inferredcites →https://doi.org/10.1109/proc.1977.10514openalex-snapshot
A survey of sparse matrix research
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/0710032openalex-snapshot
Nested Dissection of a Regular Finite Element Mesh
inferredcites →https://doi.org/10.1137/0711050openalex-snapshot
On Block Elimination for Sparse Linear Systems
inferredcites →https://doi.org/10.1137/0713020openalex-snapshot
Comparative Analysis of the Cuthill–McKee and the Reverse Cuthill–McKee Ordering Algorithms for Sparse Matrices
inferredcites →https://doi.org/10.1137/0713023openalex-snapshot
An Algorithm for Reducing the Bandwidth and Profile of a Sparse Matrix
inferredcites →https://doi.org/10.1137/0714011openalex-snapshot
Numerical Experiments Using Dissection Methods to Solve n by n Grid Problems
inferredcites →https://doi.org/10.1137/0715021openalex-snapshot
Algorithms for Matrix Partitioning and the Numerical Solution of Finite Element Systems
inferredcites →https://doi.org/10.1137/1003021openalex-snapshot
The Use of Linear Graphs in Gauss Elimination
inferredcites →https://doi.org/10.1145/355841.355845openalex-snapshot
An Implementation of a Pseudoperipheral Node Finder
inferredcites →https://doi.org/10.1145/800195.805928openalex-snapshot
Reducing the bandwidth of sparse symmetric matrices
inferredcites →https://doi.org/10.2307/1911908openalex-snapshot
The Theory of Graphs and Its Applications
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/(sici)1096-9128(200002/03)12:2/3<53::aid-cpe473>3.0.co;2-bopenalex-snapshot
Towards a scalable hybrid sparse solver
inferred← citeshttps://doi.org/10.1002/nme.1620190610openalex-snapshot
A two‐step approach to finite element ordering
inferred← citeshttps://doi.org/10.1002/nme.1620190907openalex-snapshot
Design of a recursive, shape controlling mesh generator
inferred← citeshttps://doi.org/10.1002/nme.1620200411openalex-snapshot
A memory‐economic frontwidth reduction algorithm
inferred← citeshttps://doi.org/10.1002/nme.1620361910openalex-snapshot
An alternative pseudoperipheral node finder for resequencing schemes
inferred← citeshttps://doi.org/10.1002/num.1690080405openalex-snapshot
The primal mixed finite element method and the LBB condition
inferred← citeshttps://doi.org/10.1002/pssb.2221540224openalex-snapshot
LCAO Recursion Approach for the Bound Electron States at the 90°‐Partial Dislocation in Silicon
inferred← citeshttps://doi.org/10.1006/jcph.2001.6976openalex-snapshot
Weak ψ–ω Formulation for Unsteady Flows in 2D Multiply Connected Domains
inferred← citeshttps://doi.org/10.1006/jpdc.2000.1676openalex-snapshot
Fast Parallel Direct Solvers for Coarse Grid Problems
inferred← citeshttps://doi.org/10.1007/11428831_31openalex-snapshot
Multi-pass Mapping Schemes for Parallel Sparse Matrix Computations
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-28438-9_10openalex-snapshot
Improving the Performance of the Vertex Elimination Algorithm for Derivative Calculation
inferred← citeshttps://doi.org/10.1007/3-540-56279-6_62openalex-snapshot
Algorithms for a class of Min-Cut and Max-Cut problem
inferred← citeshttps://doi.org/10.1007/3-540-60321-2_22openalex-snapshot
A reconfigurable parallel algorithm for sparse Cholesky factorization
inferred← citeshttps://doi.org/10.1007/3-540-63138-0_22openalex-snapshot
Parallel sparse Cholesky factorization
inferred← citeshttps://doi.org/10.1007/978-1-4613-8369-7_1openalex-snapshot
An Introduction to Chordal Graphs and Clique Trees
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-3-319-78024-5_18openalex-snapshot
Experiments with Sparse Cholesky Using a Parametrized Task Graph Implementation
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-642-58066-6_6openalex-snapshot
Parallel Direct Solution of Sparse Linear Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-77958-9_16openalex-snapshot
Computer Solution of Systems of Linear Equations in Engineering Geodesy
inferred← citeshttps://doi.org/10.1007/978-3-662-48096-0_36openalex-snapshot
Efficient Nested Dissection for Multicore Architectures
inferred← citeshttps://doi.org/10.1007/978-3-663-14242-3_1openalex-snapshot
Recent Developments in the Numerical Solution of the Navier-Stokes Equations
inferred← citeshttps://doi.org/10.1007/978-3-7091-8752-4_8openalex-snapshot
The Solution of Sparse Systems of Linear Equations
inferred← citeshttps://doi.org/10.1007/978-94-009-6842-4_14openalex-snapshot
Fielday — Finite Element Device Analysis
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/bf01396660openalex-snapshot
The analysis of a nested dissection algorithm
inferred← citeshttps://doi.org/10.1007/bf01407861openalex-snapshot
Task scheduling for parallel sparse Cholesky factorization
inferred← citeshttps://doi.org/10.1007/bf01410102openalex-snapshot
A finite element ? Capacitance method for elliptic problems on regions partitioned into subregions
inferred← citeshttps://doi.org/10.1007/bf01582130openalex-snapshot
Partitioning mathematical programs for parallel solution
inferred← citeshttps://doi.org/10.1007/bf02023054openalex-snapshot
Parallel sparse Gaussian elimination with partial pivoting
inferred← citeshttps://doi.org/10.1007/bf02141748openalex-snapshot
On the validity of a front-oriented approach to partitioning large sparse graphs with a connectivity constraint
inferred← citeshttps://doi.org/10.1007/bfb0107162openalex-snapshot
Finite element solution of unsteady viscous flows past multiple airfoils
inferred← citeshttps://doi.org/10.1007/s00521-024-10392-yopenalex-snapshot
Neural acceleration of incomplete factorization preconditioning
inferred← citeshttps://doi.org/10.1007/s12293-012-0086-yopenalex-snapshot
Benchmarking ordering techniques for nonserial dynamic programming
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/0024-3795(84)90022-3openalex-snapshot
Row-ordering schemes for sparse givens transformations. I. bipartite graph model
inferred← citeshttps://doi.org/10.1016/0024-3795(86)90190-4openalex-snapshot
Row-ordering schemes for sparse givens transformations. II. implicit graph model
inferred← citeshttps://doi.org/10.1016/0041-5553(82)90134-3openalex-snapshot
On precision mesh schemes
inferred← citeshttps://doi.org/10.1016/0045-7949(80)90066-8openalex-snapshot
Algorithms and software for in-core factorization of sparse symmetric positive definite matrices
inferred← citeshttps://doi.org/10.1016/0045-7949(85)90059-8openalex-snapshot
A solution method of equilibrium equations for large structural systems
inferred← citeshttps://doi.org/10.1016/0098-1354(94)00074-3openalex-snapshot
A multifrontal algorithm for the solution of large systems of equations using network-based parallel computing
inferred← citeshttps://doi.org/10.1016/0142-0615(87)90027-5openalex-snapshot
Optimal pivot strategies for load-flow calculation
inferred← citeshttps://doi.org/10.1016/0167-7977(87)90020-7openalex-snapshot
Algebraic aspects of finite-element solutions
inferred← citeshttps://doi.org/10.1016/0167-8191(87)90009-3openalex-snapshot
Symbolic Cholesky factorization on a local-memory multiprocessor
inferred← citeshttps://doi.org/10.1016/0167-8191(89)90016-1openalex-snapshot
Independent set orderings for parallel matrix factorization by Gaussian elimination
inferred← citeshttps://doi.org/10.1016/0167-8191(89)90101-4openalex-snapshot
Communication results for parallel sparse Cholesky factorization on a hypercube
inferred← citeshttps://doi.org/10.1016/0167-8191(93)90045-mopenalex-snapshot
Supernodal symbolic Cholesky factorization on a local-memory multiprocessor
inferred← citeshttps://doi.org/10.1016/0167-8191(95)00024-iopenalex-snapshot
Exploiting large grain parallelism in a sparse direct linear system solver
inferred← citeshttps://doi.org/10.1016/0168-9002(87)90929-6openalex-snapshot
Computer programs for the design and optimization of electron and ion beam lithography systems
inferred← citeshttps://doi.org/10.1016/0377-0427(85)90048-2openalex-snapshot
Algorithms for the reduction of matrix bandwidth and profile
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/0771-050x(79)90011-1openalex-snapshot
Bibliography on the evaluation of numerical software
inferred← citeshttps://doi.org/10.1016/0893-9659(88)90182-6openalex-snapshot
Solution of Algebraic equations generated by the p-version of the finite element method
inferred← citeshttps://doi.org/10.1016/0956-0521(92)90121-xopenalex-snapshot
Decomposition of sparse matrices on parallel computers
inferred← citeshttps://doi.org/10.1016/b978-0-08-032789-1.50016-1openalex-snapshot
A SOLUTION METHOD OF EQUILIBRIUM EQUATIONS FOR LARGE STRUCTURAL SYSTEMS
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.ejor.2017.01.023openalex-snapshot
A hybrid breakout local search and reinforcement learning approach to the vertex separator problem
inferred← citeshttps://doi.org/10.1016/j.jcp.2013.01.036openalex-snapshot
A fast algorithm for sparse matrix computations related to inversion
inferred← citeshttps://doi.org/10.1016/j.jcp.2020.109240openalex-snapshot
A multilevel approach for trace system in HDG discretizations
inferred← citeshttps://doi.org/10.1016/j.parco.2003.05.010openalex-snapshot
Adapting a parallel sparse direct solver to architectures with clusters of SMPs
inferred← citeshttps://doi.org/10.1016/j.parco.2008.01.004openalex-snapshot
A partitioning algorithm for block-diagonal matrices with overlap
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.procs.2011.04.251openalex-snapshot
A Multilevel Cholesky Conjugate Gradients Hybrid Solver for Linear Systems with Multiple Right-hand Sides
inferred← citeshttps://doi.org/10.1016/j.procs.2016.05.312openalex-snapshot
Hybrid Direct and Iterative Solver with Library of Multi-criteria Optimal Orderings for h Adaptive Finite Element Method Computations
inferred← citeshttps://doi.org/10.1016/s0020-0255(96)00174-0openalex-snapshot
Execution of compute-intensive applications into parallel machines
inferred← citeshttps://doi.org/10.1016/s0167-739x(00)00075-3openalex-snapshot
Modeling and improving locality for the sparse-matrix–vector product on cache memories
inferred← citeshttps://doi.org/10.1016/s0167-8191(96)00047-6openalex-snapshot
Solving large nonsymmetric sparse linear systems using MCSPARSE
inferred← citeshttps://doi.org/10.1016/s0167-8191(97)00018-5openalex-snapshot
Parallel ordering using edge contraction
inferred← citeshttps://doi.org/10.1016/s0167-8191(99)00019-8openalex-snapshot
A distributed functional framework for recursive finite element simulations
inferred← citeshttps://doi.org/10.1016/s1570-8659(00)07002-2openalex-snapshot
Gaussian elimination for the solution of linear systems of equations
inferred← citeshttps://doi.org/10.1017/s0962492916000076openalex-snapshot
A survey of direct methods for sparse linear systems
inferred← citeshttps://doi.org/10.1023/a:1021908421589openalex-snapshot
Towards a Tighter Coupling of Bottom-Up and Top-Down Sparse Matrix Ordering Methods
inferred← citeshttps://doi.org/10.1080/10556788.2016.1193177openalex-snapshot
PMORSy: parallel sparse matrix ordering software for fill-in minimization
inferred← citeshttps://doi.org/10.1090/s0025-5718-1980-0583501-0openalex-snapshot
Numerical Stability of Nested Dissection Orderings
inferred← citeshttps://doi.org/10.1093/comjnl/bxm115openalex-snapshot
Vertex-ordering Algorithms for Automatic Differentiation of Computer Codes
inferred← citeshttps://doi.org/10.1109/20.582614openalex-snapshot
On the convergence rate improvement of ICCG solver on the FE mesh
inferred← citeshttps://doi.org/10.1109/access.2023.3262453openalex-snapshot
Neural Acceleration of Graph Based Utility Functions for Sparse Matrices
inferred← citeshttps://doi.org/10.1109/access.2023.3324378openalex-snapshot
Problem Relaxation Methods for Quantum Minimum Fill-in Algorithm
inferred← citeshttps://doi.org/10.1109/icpp.1994.177openalex-snapshot
Scheduling Strategies for Sparse Cholesky Factorization on a Shared Virtual Memory Parallel Computer
inferred← citeshttps://doi.org/10.1109/ipps.1995.395965openalex-snapshot
Geometric mesh partitioning: implementation and experiments
inferred← citeshttps://doi.org/10.1109/pacificvis.2009.4906842openalex-snapshot
A visual canonical adjacency matrix for graphs
inferred← citeshttps://doi.org/10.1109/sfcs.1997.646116openalex-snapshot
Parallelizing elimination orders with linear fill
inferred← citeshttps://doi.org/10.1109/shpcc.1994.296723openalex-snapshot
A reordering and mapping algorithm for parallel sparse Cholesky factorization
inferred← citeshttps://doi.org/10.1109/tcad.1987.1270339openalex-snapshot
A Parallel Solution Method for Large Sparse Systems of Equations
inferred← citeshttps://doi.org/10.1109/tmag.1983.1062867openalex-snapshot
The use of finite elements in the simulation of the steady state operation of a synchronous generator with a known terminal loading condition
inferred← citeshttps://doi.org/10.1111/j.1467-8667.1993.tb00229.xopenalex-snapshot
A Parallel Direct Finite Element Method for Local‐Memory Multiprocessors
inferred← citeshttps://doi.org/10.1137/0209044openalex-snapshot
An Optimal Agorithm for Symbolic Factorization of Symmetric Matrices
inferred← citeshttps://doi.org/10.1137/0611030openalex-snapshot
Partitioning Sparse Matrices with Eigenvectors of Graphs
inferred← citeshttps://doi.org/10.1137/0717024openalex-snapshot
A Minimal Storage Implementation of the Minimum Degree Algorithm
inferred← citeshttps://doi.org/10.1137/0717062openalex-snapshot
An Automatic One-Way Dissection Algorithm for Irregular Finite Element Problems
inferred← citeshttps://doi.org/10.1137/0719088openalex-snapshot
A Fast Solver Free of Fill-In for Finite Element Problems
inferred← citeshttps://doi.org/10.1137/0720022openalex-snapshot
On Row and Column Orderings for Sparse Least Squares Problems
inferred← citeshttps://doi.org/10.1137/080739987openalex-snapshot
Parallel Hybrid Preconditioning: Incomplete Factorization with Selective Sparse Approximate Inversion
inferred← citeshttps://doi.org/10.1137/0902034openalex-snapshot
Solution of Large-Scale Sparse Least Squares Problems Using Auxiliary Storage
inferred← citeshttps://doi.org/10.1137/0905045openalex-snapshot
The Multifrontal Solution of Unsymmetric Sets of Linear Equations
inferred← citeshttps://doi.org/10.1137/0909021openalex-snapshot
Sparse Cholesky Factorization on a Local-Memory Multiprocessor
inferred← citeshttps://doi.org/10.1137/0909057openalex-snapshot
On the Complexity of Sparse $QR$ and $LU$ Factorization of Finite-Element Matrices
inferred← citeshttps://doi.org/10.1137/0912051openalex-snapshot
Automatic Domain Partitioning in Three Dimensions
inferred← citeshttps://doi.org/10.1137/0912063openalex-snapshot
Limiting Communication in Parallel Sparse Cholesky Factorization
inferred← citeshttps://doi.org/10.1137/0916054openalex-snapshot
Efficient Sparse Cholesky Factorization on a Massively Parallel SIMD Computer
inferred← citeshttps://doi.org/10.1137/1033099openalex-snapshot
Parallel Algorithms for Sparse Linear Systems
inferred← citeshttps://doi.org/10.1137/19m1301084openalex-snapshot
An Asynchronous Incomplete Block LU Preconditioner for Computational Fluid Dynamics on Unstructured Grids
inferred← citeshttps://doi.org/10.1137/s0895479892228924openalex-snapshot
A Hybrid Tridiagonalization Algorithm for Symmetric Sparse Matrices
inferred← citeshttps://doi.org/10.1137/s0895479892238270openalex-snapshot
A Cartesian Parallel Nested Dissection Algorithm
inferred← citeshttps://doi.org/10.1137/s0895479896299081openalex-snapshot
Robust Ordering of Sparse Matrices using Multisection
inferred← citeshttps://doi.org/10.1137/s0895479897319313openalex-snapshot
Performance of Greedy Ordering Heuristics for Sparse Cholesky Factorization
inferred← citeshttps://doi.org/10.1137/s1064827594262613openalex-snapshot
Geometric Separators for Finite-Element Meshes
inferred← citeshttps://doi.org/10.1137/s1064827594275339openalex-snapshot
Geometric Mesh Partitioning: Implementation and Experiments
inferred← citeshttps://doi.org/10.1145/181181.181575openalex-snapshot
The parallel solution of nonsymmetric sparse linear systems using the H* reordering and an associated factorization
inferred← citeshttps://doi.org/10.1145/305619.305640openalex-snapshot
Tradeoffs between parallelism and fill in nested dissection
inferred← citeshttps://doi.org/10.1145/3130800.3130849openalex-snapshot
Localized solutions of sparse linear systems for geometry processing
inferred← citeshttps://doi.org/10.1145/355841.355845openalex-snapshot
An Implementation of a Pseudoperipheral Node Finder
inferred← citeshttps://doi.org/10.1145/355887.355891openalex-snapshot
On a Data Structure for Adaptive Finite Element Mesh Refinements
inferred← citeshttps://doi.org/10.1145/355900.355906openalex-snapshot
A Fast Implementation of the Minimum Degree Algorithm Using Quotient Graphs
inferred← citeshttps://doi.org/10.1145/356004.356006openalex-snapshot
A New Implementation of Sparse Gaussian Elimination
inferred← citeshttps://doi.org/10.1145/356044.356047openalex-snapshot
The Multifrontal Solution of Indefinite Sparse Symmetric Linear
inferred← citeshttps://doi.org/10.1145/44128.44131openalex-snapshot
Remarks on implementation of O ( n 1/2 τ) assignment algorithms
inferred← citeshttps://doi.org/10.1145/569147.569149openalex-snapshot
Recent advances in direct methods for solving unsymmetric sparse systems of linear equations
inferred← citeshttps://doi.org/10.1145/5960.5963openalex-snapshot
A node-addition model for symbolic factorization
inferred← citeshttps://doi.org/10.1145/66888.66890openalex-snapshot
A graph partitioning algorithm by node separators
inferred← citeshttps://doi.org/10.1145/76263.76304openalex-snapshot
Communication reduction for distributed sparse matrix factorization on a processor mesh
inferred← citeshttps://doi.org/10.1201/b11644-3openalex-snapshot
Combinatorial Problems in Solving Linear Systems
inferred← citeshttps://doi.org/10.1287/ijoc.10.1.107openalex-snapshot
Sparse Matrix Ordering Methods for Interior Point Linear Programming
inferred← citeshttps://doi.org/10.14288/1.0051474openalex-snapshot
Determining the complete spectrum for sparse symmetric matrices
inferred← citeshttps://doi.org/10.14529/cmse170103openalex-snapshot
Experimental evaluation of algorithms in the parallel multilevel nested dissection method
inferred← citeshttps://doi.org/10.18926/15516openalex-snapshot
Nested Dissection Method on Transputer
inferred← citeshttps://doi.org/10.2172/10145949openalex-snapshot
An introduction to chordal graphs and clique trees
inferred← citeshttps://doi.org/10.2172/6560471openalex-snapshot
An introduction to chordal graphs and clique trees
inferred← citeshttps://doi.org/10.23919/acc.1992.4792387openalex-snapshot
Secondary Re-Ordering Methods for Parallel Partitioned Sparse Inverse Solutions
inferred← citeshttps://doi.org/10.24425/bpas.2018.125938openalex-snapshot
Heuristic algorithm to predict the location of C0 separators for efficient isogeometric analysis simulations with direct solvers
inferred← citeshttps://doi.org/10.26089/nummet.v16r339openalex-snapshot
A parallel multilevel nested dissection algorithm for shared-memory computing systems
inferred← citeshttps://doi.org/10.3390/s8020635openalex-snapshot
Vertex Separators for Partitioning a Graph
inferred← citeshttps://doi.org/10.5753/sbac-pad.2000.41208openalex-snapshot
A Parallel Approach to the Solution of Sparse Linear Systems
inferred← citeshttps://doi.org/10.70675/cf5f1be9zf008z4f63zb7acz65de2fa51dfbopenalex-snapshot
Résolution de problèmes de rayonnement électromagnétique appliqués à l’imagerie médicale avec FreeFEM++
inferred← citeshttps://doi.org/10.7494/cmms.2016.1.0560openalex-snapshot
Bisection weighted by element size ordering algorithm for multi-frontal solver executed over 3D h refined grids
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.