On the public citation graph
Algorithmic Aspects of Vertex Elimination on Directed Graphs
0 signed · 171 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.1002/jgt.3190020209openalex-snapshot
Perfect Elimination and Chordal Bipartite Graphs
inferredcites →https://doi.org/10.1007/978-1-4684-2001-2_9openalex-snapshot
Reducibility among Combinatorial Problems
inferredcites →https://doi.org/10.1007/bf02165411openalex-snapshot
Gaussian elimination is not optimal
inferredcites →https://doi.org/10.1016/0020-0190(71)90006-8openalex-snapshot
Efficient determination of the transitive closure of a directed graph
inferredcites →https://doi.org/10.1016/0022-247x(70)90282-9openalex-snapshot
Triangulated graphs and the elimination process
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/b978-0-12-141050-6.50006-4openalex-snapshot
GRAPH THEORY AND GAUSSIAN ELIMINATION
inferredcites →https://doi.org/10.1016/b978-0-12-141050-6.50011-8openalex-snapshot
AN OPTIMIZATION PROBLEM ARISING FROM TEARING METHODS
inferredcites →https://doi.org/10.1016/b978-0-12-141050-6.50020-9openalex-snapshot
CONSIDERATIONS IN THE DESIGN OF SOFTWARE FOR SPARSE GAUSSIAN ELIMINATION**This research was supported in part by NSF Grant GJ-43157 and ONR Grant N0014-67-A-0097-0016.
inferredcites →https://doi.org/10.1016/b978-0-12-141050-6.50021-0openalex-snapshot
FINDING THE BLOCK LOWER TRIANGULAR FORM OF A SPARSE MATRIX
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/imamat/15.2.161openalex-snapshot
Regular Algebra Applied to Path-finding Problems
inferredcites →https://doi.org/10.1093/imamat/7.3.273openalex-snapshot
An Algebra for Network Routing Problems
inferredcites →https://doi.org/10.1109/swat.1971.4openalex-snapshot
Boolean matrix multiplication and transitive closure
inferredcites →https://doi.org/10.1137/0201008openalex-snapshot
The Transitive Reduction of a Directed Graph
inferredcites →https://doi.org/10.1137/0201010openalex-snapshot
Depth-First Search and Linear Graph Algorithms
inferredcites →https://doi.org/10.1137/0202018openalex-snapshot
Toward Characterization of Perfect Elimination Digraphs
inferredcites →https://doi.org/10.1137/0202019openalex-snapshot
An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
inferredcites →https://doi.org/10.1137/0203022openalex-snapshot
A Note on Perfect Elimination Digraphs
inferredcites →https://doi.org/10.1137/0205012openalex-snapshot
A Fast Algorithm for Finding an Optimal Ordering for Vertex Elimination on a Graph
inferredcites →https://doi.org/10.1137/0205021openalex-snapshot
Algorithmic Aspects of Vertex Elimination on Graphs
inferredcites →https://doi.org/10.1145/321556.321565openalex-snapshot
Symbolic Generation of an Optimal Crout Algorithm for Sparse Systems of Linear Equations
inferredcites →https://doi.org/10.1145/800116.803775openalex-snapshot
Algorithmic aspects of vertex elimination
inferredcites →https://doi.org/10.1145/800157.805047openalex-snapshot
The complexity of theorem-proving procedures
inferredcites →https://doi.org/10.2307/2004501openalex-snapshot
Computer Solution of Linear Algebraic Systems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cta.4490080204openalex-snapshot
A new a priori ordering method for sparse systems of equations based on an ordered output set
inferred← citeshttps://doi.org/10.1006/jsco.1996.0141openalex-snapshot
Integer Matrix Diagonalization
inferred← citeshttps://doi.org/10.1007/3-540-44590-0_37openalex-snapshot
Reordering the Reorderable Matrix as an Algorithmic Problem
inferred← citeshttps://doi.org/10.1007/3-540-44862-4_61openalex-snapshot
Markowitz-Type Heuristics for Computing Jacobian Matrices Efficiently
inferred← citeshttps://doi.org/10.1007/3-540-45322-9_9openalex-snapshot
Prospects for Simulated Annealing Algorithms in Automatic Differentiation
inferred← citeshttps://doi.org/10.1007/978-1-4613-8369-7_4openalex-snapshot
Structural Representations of Schur Complements in Sparse Matrices
inferred← citeshttps://doi.org/10.1007/978-1-4613-8369-7_5openalex-snapshot
Irreducibility and Primitivity of Perron Complements: Application of the Compressed Directed Graph
inferred← citeshttps://doi.org/10.1007/978-1-4613-8369-7_6openalex-snapshot
Predicting Structure in Nonsymmetric Sparse Matrix Factorizations
inferred← citeshttps://doi.org/10.1007/978-3-030-81691-9_12openalex-snapshot
FRaGenLP: A Generator of Random Linear Programming Problems for Cluster Computing Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-25820-6_2openalex-snapshot
Sparse Matrices and Their Graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-25820-6_3openalex-snapshot
Introduction to Matrix Factorizations
inferred← citeshttps://doi.org/10.1007/978-3-031-25820-6_7openalex-snapshot
Stability, Ill-Conditioning, and Symmetric Indefinite Factorizations
inferred← citeshttps://doi.org/10.1007/978-3-322-96645-2_2openalex-snapshot
Direkte Verfahren zur Lösung Linearer Gleichungssysteme
inferred← citeshttps://doi.org/10.1007/978-3-540-24605-3_24openalex-snapshot
Guiding SAT Diagnosis with Tree Decompositions
inferred← citeshttps://doi.org/10.1007/978-3-642-20712-9_35openalex-snapshot
Recognizing Sparse Perfect Elimination Bipartite 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-94-010-9054-4_18openalex-snapshot
Making Maximum Entropy Computations Easier By Adding Extra Constraints (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/bf01087548openalex-snapshot
Sparse linear problems of the least squares method
inferred← citeshttps://doi.org/10.1007/bf02104831openalex-snapshot
Combinatorial analysis (nonnegative matrices, algorithmic problems)
inferred← citeshttps://doi.org/10.1007/bfb0112537openalex-snapshot
A bipartite quotient graph model for unsymmetric matrices
inferred← citeshttps://doi.org/10.1007/s00202-006-0007-5openalex-snapshot
Efficient Reordering for Direct Methods in Analog Circuit Simulation
inferred← citeshttps://doi.org/10.1007/s10107-003-0456-9openalex-snapshot
Optimal accumulation of Jacobian matrices by elimination methods on the dual computational graph
inferred← citeshttps://doi.org/10.1007/s10543-010-0299-8openalex-snapshot
The importance of structure in incomplete factorization preconditioners
inferred← citeshttps://doi.org/10.1007/s11227-021-04270-wopenalex-snapshot
swSuperLU: A highly scalable sparse direct solver on Sunway manycore architecture
inferred← citeshttps://doi.org/10.1016/0016-0032(80)90028-9openalex-snapshot
Degree Switching Operations in Networks and Large Scale Systems Assignment Problems
inferred← citeshttps://doi.org/10.1016/0024-3795(84)90207-6openalex-snapshot
Positive definite completions of partial Hermitian matrices
inferred← citeshttps://doi.org/10.1016/0024-3795(85)90223-xopenalex-snapshot
Report on the Dublin matrix theory conference, March 1984
inferred← citeshttps://doi.org/10.1016/0024-3795(93)90121-4openalex-snapshot
Predicting the structure of sparse orthogonal factors
inferred← citeshttps://doi.org/10.1016/0024-3795(93)90241-fopenalex-snapshot
Recognizing badly presented Z-modules
inferred← citeshttps://doi.org/10.1016/0045-7949(79)90112-3openalex-snapshot
Algorithms and software for in-core factorization of sparse symmetric positive definite matrices
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/0304-3975(95)00151-4openalex-snapshot
On the ordering of sparse linear systems
inferred← citeshttps://doi.org/10.1016/b978-0-12-141050-6.50006-4openalex-snapshot
GRAPH THEORY AND GAUSSIAN ELIMINATION
inferred← citeshttps://doi.org/10.1016/b978-0-12-141050-6.50007-6openalex-snapshot
PARTITIONING USING PAQ++This research was supported in part by the Office of Naval Research Grant N00014-67-A-0077-0021, by a National Science Foundation Graduate Fellowship and by Argonne National Laboratory.
inferred← citeshttps://doi.org/10.1016/b978-0-12-289260-8.50011-xopenalex-snapshot
Triangulated Graphs
inferred← citeshttps://doi.org/10.1016/b978-0-12-289260-8.50019-4openalex-snapshot
Perfect Gaussian Elimination
inferred← citeshttps://doi.org/10.1016/b978-0-444-70396-5.50018-2openalex-snapshot
A Non-Iterative Maximum Entropy Algorithm
inferred← citeshttps://doi.org/10.1016/j.artint.2022.103669openalex-snapshot
A local method for identifying causal relations under Markov equivalence
inferred← citeshttps://doi.org/10.1016/j.dam.2013.05.005openalex-snapshot
Digraphs of bounded elimination width
inferred← citeshttps://doi.org/10.1016/j.dam.2018.06.028openalex-snapshot
On strictly chordality- k graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2005.12.009openalex-snapshot
Minimal fill in O ( n 2.69 ) time
inferred← citeshttps://doi.org/10.1016/j.disc.2013.04.001openalex-snapshot
A note on perfect partial elimination
inferred← citeshttps://doi.org/10.1016/j.eswa.2022.117962openalex-snapshot
A sequential direct hybrid algorithm to compute stationary distribution of continuous-time Markov chain
inferred← citeshttps://doi.org/10.1016/j.ijepes.2023.109517openalex-snapshot
GPU-resident sparse direct linear solvers for alternating current optimal power flow analysis
inferred← citeshttps://doi.org/10.1016/j.neunet.2022.06.028openalex-snapshot
Active learning of causal structures with deep reinforcement learning
inferred← citeshttps://doi.org/10.1016/j.parco.2007.12.003openalex-snapshot
On finding approximate supernodes for an efficient block-ILU(k) factorization
inferred← citeshttps://doi.org/10.1016/j.parco.2017.06.003openalex-snapshot
Basker: Parallel sparse LU factorization utilizing hierarchical parallelism and data layouts
inferred← citeshttps://doi.org/10.1016/j.pnucene.2018.04.020openalex-snapshot
Development and verification of the activation analysis code AMY
inferred← citeshttps://doi.org/10.1016/j.pnucene.2024.105599openalex-snapshot
An efficient method for solving flow field in high temperature gas-cooled reactor
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.02.038openalex-snapshot
Digraph measures: Kelly decompositions, games, and orderings
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.07.003openalex-snapshot
Search-space size in contraction hierarchies
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115187openalex-snapshot
Efficient diagonalization of symmetric matrices associated with graphs of small treewidth
inferred← citeshttps://doi.org/10.1016/s0166-218x(00)00384-xopenalex-snapshot
Deterministic inverse zero-patterns
inferred← citeshttps://doi.org/10.1016/s0167-5060(04)80060-8openalex-snapshot
Perfect Gaussian Elimination
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)80169-0openalex-snapshot
Chapter 5 Computational methods in probability theory
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:1009970723383openalex-snapshot
Fast Evaluation of Partial Derivatives and Interval Slopes
inferred← citeshttps://doi.org/10.1023/a:1022806215452openalex-snapshot
Several results on chordal bipartite graphs
inferred← citeshttps://doi.org/10.1080/03081089508818336openalex-snapshot
Determinantal formulae and nonsymmetric gaussian perfect elimination
inferred← citeshttps://doi.org/10.1080/10556788.2011.580745openalex-snapshot
On optimality preserving eliminations for the minimum edge count and optimal Jacobian accumulation problems in linearized DAGs
inferred← citeshttps://doi.org/10.1080/10556788.2017.1397145openalex-snapshot
On lower bounds for optimal Jacobian accumulation
inferred← citeshttps://doi.org/10.1080/15326349908807564openalex-snapshot
A graph-theoretic approach to queueing analysis part i: theory
inferred← citeshttps://doi.org/10.1088/1742-6596/180/1/012015openalex-snapshot
Factorization-based sparse solvers and preconditioners
inferred← citeshttps://doi.org/10.1090/conm/754/15141openalex-snapshot
Iterative methods for linear systems of equations: A brief historical journey
inferred← citeshttps://doi.org/10.1108/17563781111136676openalex-snapshot
Computational complexity of some intelligent computing systems
inferred← citeshttps://doi.org/10.1109/59.14579openalex-snapshot
An efficient heuristic ordering algorithm for partial matrix refactorization
inferred← citeshttps://doi.org/10.1109/access.2024.3510672openalex-snapshot
Data-Driven Fault Recovery With Software-Defined Smart Transmission Grids
inferred← citeshttps://doi.org/10.1109/hipc.2014.7116880openalex-snapshot
Reducing elimination tree height for parallel LU factorization of sparse unsymmetric matrices
inferred← citeshttps://doi.org/10.1109/hipc53243.2021.00024openalex-snapshot
Deciding Non-Compressible Blocks in Sparse Direct Solvers using Incomplete Factorization
inferred← citeshttps://doi.org/10.1109/ijcnn55064.2022.9891912openalex-snapshot
How to Learn the Optimal Clique Decompositions in Solving Semidefinite Relaxations for OPF
inferred← citeshttps://doi.org/10.1109/ipdpsw.2016.92openalex-snapshot
Basker: A Threaded Sparse LU Factorization Utilizing Hierarchical Parallelism and Data Layouts
inferred← citeshttps://doi.org/10.1109/lcomm.2004.828183openalex-snapshot
On General Linear Block Code Decoding Using the Sum–Product Iterative Decoder
inferred← citeshttps://doi.org/10.1109/pesgm.2018.8586437openalex-snapshot
Symbolic Factorization Re-utilization for Contingency Analysis
inferred← citeshttps://doi.org/10.1109/proc.1977.10514openalex-snapshot
A survey of sparse matrix research
inferred← citeshttps://doi.org/10.1109/tpas.1978.354729openalex-snapshot
An Optimal Ordering Algorithm for Sparse Matrix Applications
inferred← citeshttps://doi.org/10.1109/tpds.2021.3090316openalex-snapshot
gSoFa: Scalable Sparse Symbolic LU Factorization on GPUs
inferred← citeshttps://doi.org/10.1115/1.2826095openalex-snapshot
Kinematic Synthesis of Deployable-Foldable Truss Structures Using Graph Theory, Part 2: Generation of Deployable Truss Module Design Concepts
inferred← citeshttps://doi.org/10.1115/1.4055241openalex-snapshot
Combining Uneliminated Algebraic Formulations With Sparse Linear Solvers to Increase the Speed and Accuracy of Homotopy Path Tracking for Kinematic Synthesis
inferred← citeshttps://doi.org/10.1137/0205021openalex-snapshot
Algorithmic Aspects of Vertex Elimination on Graphs
inferred← citeshttps://doi.org/10.1137/0405005openalex-snapshot
A Forward Lower Restricted Ordering Algorithm for Digraphs
inferred← citeshttps://doi.org/10.1137/050629343openalex-snapshot
Symbolic and Exact Structure Prediction for Sparse Gaussian Elimination with Partial Pivoting
inferred← citeshttps://doi.org/10.1137/050637315openalex-snapshot
Diagonal Markowitz Scheme with Local Symmetrization
inferred← citeshttps://doi.org/10.1137/050638102openalex-snapshot
Parallel Symbolic Factorization for Sparse LU with Static Pivoting
inferred← citeshttps://doi.org/10.1137/050643581openalex-snapshot
Algorithmic Aspects of Elimination Trees for Sparse Unsymmetric Matrices
inferred← citeshttps://doi.org/10.1137/0601033openalex-snapshot
A Note on the NP-Completeness of Vertex Elimination on Directed Graphs
inferred← citeshttps://doi.org/10.1137/0602010openalex-snapshot
Computing the Minimum Fill-In is NP-Complete
inferred← citeshttps://doi.org/10.1137/0608027openalex-snapshot
Inherited Matrix Entries: Principal Submatrices of the Inverse
inferred← citeshttps://doi.org/10.1137/0610007openalex-snapshot
Inherited Matrix Entries: $LU$ Factorizations
inferred← citeshttps://doi.org/10.1137/0611028openalex-snapshot
A Nondeterministic Parallel Algorithm for General Unsymmetric Sparse LU Factorization
inferred← citeshttps://doi.org/10.1137/0613017openalex-snapshot
Exploiting Structural Symmetry in Unsymmetric Sparse Symbolic Factorization
inferred← citeshttps://doi.org/10.1137/0614024openalex-snapshot
Elimination Structures for Unsymmetric Sparse $LU$ Factors
inferred← citeshttps://doi.org/10.1137/0717024openalex-snapshot
A Minimal Storage Implementation of the Minimum Degree Algorithm
inferred← citeshttps://doi.org/10.1137/09077432xopenalex-snapshot
A Fast Parallel Algorithm for Selected Inversion of Structured Sparse Matrices with Application to 2D Electronic Structure Calculations
inferred← citeshttps://doi.org/10.1137/1020067openalex-snapshot
Complexity of Combinatorial Algorithms
inferred← citeshttps://doi.org/10.1137/16m1062454openalex-snapshot
Reordering Strategy for Blocking Optimization in Sparse Linear Solvers
inferred← citeshttps://doi.org/10.1137/s0895479801393770openalex-snapshot
A Note on the Column Elimination Tree
inferred← citeshttps://doi.org/10.1137/s089547980240563xopenalex-snapshot
The Theory of Elimination Trees for Sparse Unsymmetric Matrices
inferred← citeshttps://doi.org/10.1137/s0895479887139455openalex-snapshot
Predicting Structure in Sparse Matrix Computations
inferred← citeshttps://doi.org/10.1137/s1064827500376193openalex-snapshot
A Scalable Parallel Algorithm for Incomplete Factor Preconditioning
inferred← citeshttps://doi.org/10.1145/220346.220377openalex-snapshot
A solution to the extended gcd problem
inferred← citeshttps://doi.org/10.1145/331532.331561openalex-snapshot
Efficient parallel computation of ILU(k) preconditioners
inferred← citeshttps://doi.org/10.1145/355791.355796openalex-snapshot
Two Fast Algorithms for Sparse Matrices: Multiplication and Permuted Transposition
inferred← citeshttps://doi.org/10.1145/3572848.3577486openalex-snapshot
End-to-End LU Factorization of Large Matrices on GPUs
inferred← citeshttps://doi.org/10.1145/3624062.3624253openalex-snapshot
Parallel Symbolic Cholesky Factorization
inferred← citeshttps://doi.org/10.1145/3731599.3767440openalex-snapshot
Performance-Portable Symbolic Factorization through Common Graph Operations
inferred← citeshttps://doi.org/10.1145/377792.377823openalex-snapshot
A parallel algorithm for sparse symbolic LU factorization without pivoting on out—of—core matrices
inferred← citeshttps://doi.org/10.1145/800116.803775openalex-snapshot
Algorithmic aspects of vertex elimination
inferred← citeshttps://doi.org/10.1145/800116.803776openalex-snapshot
Linear algorithms to recognize interval graphs and test for the consecutive ones property
inferred← citeshttps://doi.org/10.1155/s0161171295000378openalex-snapshot
Algorithmic aspects of bipartite graphs
inferred← citeshttps://doi.org/10.1177/10943420251400893openalex-snapshot
Efficient large-scale sparse LU factorization for fast radio frequency circuit simulation
inferred← citeshttps://doi.org/10.1201/b11644-3openalex-snapshot
Combinatorial Problems in Solving Linear Systems
inferred← citeshttps://doi.org/10.12677/hjwc.2017.75019openalex-snapshot
Node Scheduling Optimization Algorithm in Heterogeneous Ad Hoc Networks Based on MIMO
inferred← citeshttps://doi.org/10.1287/trsc.1050.0124openalex-snapshot
A Multiple Pairs Shortest Path Algorithm
inferred← citeshttps://doi.org/10.13182/nse09-14openalex-snapshot
Computing the Matrix Exponential in Burnup Calculations
inferred← citeshttps://doi.org/10.13182/nse12-52openalex-snapshot
Solving Linear Systems with Sparse Gaussian Elimination in the Chebyshev Rational Approximation Method
inferred← citeshttps://doi.org/10.14529/jsfi210303openalex-snapshot
VaLiPro: Linear Programming Validator for Cluster Computing Systems
inferred← citeshttps://doi.org/10.18154/rwth-conv-143056openalex-snapshot
Exploitation of structural sparsity in algorithmic differentiation
inferred← citeshttps://doi.org/10.2118/182640-msopenalex-snapshot
An Improved Slack Variable Method to Determine Active Constraints in Large Surface Networks
inferred← citeshttps://doi.org/10.2172/5206570openalex-snapshot
Finite sparse matrix techniques. [Solution of linear systems Ax = b]
inferred← citeshttps://doi.org/10.2172/6987948openalex-snapshot
Predicting structure in nonsymmetric sparse matrix factorizations
inferred← citeshttps://doi.org/10.2514/6.1995-1423openalex-snapshot
A systematic methodology for the conceptual design of deployable truss structures
inferred← citeshttps://doi.org/10.3990/1.9789036534765openalex-snapshot
Bipartite graphs and the decomposition of systems of equations
inferred← citeshttps://doi.org/10.46298/dmtcs.2131openalex-snapshot
Disimplicial arcs, transitive vertices, and disimplicial eliminations
inferred← citeshttps://doi.org/10.48456/tr-704openalex-snapshot
Complexity and infinite games on finite graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1601.05725openalex-snapshot
Basker: A Threaded Sparse LU Factorization Utilizing Hierarchical Parallelism and Data Layouts
inferred← citeshttps://doi.org/10.48550/arxiv.1604.05573openalex-snapshot
On Efficient Decoding and Design of Sparse Random Linear Network Codes
inferred← citeshttps://doi.org/10.48550/arxiv.2001.06211openalex-snapshot
Incomplete selected inversion for linear-scaling electronic structure calculations
inferred← citeshttps://doi.org/10.48550/arxiv.math/9406205openalex-snapshot
Recognizing badly presented Z-modules
inferred← citeshttps://doi.org/10.5555/1283383.1283452openalex-snapshot
Digraph measures: Kelly decompositions, games, and orderings
inferred← citeshttps://doi.org/10.5555/644108.644152openalex-snapshot
Certifying and repairing solutions to large LPs how good are LP-solvers?
inferred← citeshttps://doi.org/10.70675/015702c8z8bcbz4506z8a47z57bde0ee520bopenalex-snapshot
Scalable GNN Solutions for CFD Simulations
inferred← citeshttps://doi.org/10.70675/2d3dc7a6z954fz4fb2za82azc87d01a2a180openalex-snapshot
Résolution des équations de Navier-Stokes linéarisées pour l'aéroélasticité, l’optimisation de forme et l’aéroacoustique
inferred← citeshttps://doi.org/10.70675/e437c495z786ez458dzb88dz67742cb983afopenalex-snapshot
Improving the memory and time overhead of low-rank parallel linear sparse direct solvers
inferred← citeshttps://doi.org/10.70675/f03dcd69za905z4dc5za2d4zd420c3f7370fopenalex-snapshot
Utilisation de la compression low-rank pour réduire la complexité des solveurs creux parallèles basés sur des techniques de factorisation directes.
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.