On the public citation graph

On Algorithms for Obtaining a Maximum Transversal

0 signed · 192 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/nav.3800020109openalex-snapshot
The Hungarian method for the assignment problem
inferredcites →https://doi.org/10.1002/nav.3800030404openalex-snapshot
Variants of the hungarian method for assignment problems
inferredcites →https://doi.org/10.1093/imamat/19.3.339openalex-snapshot
On Permutations to Block Triangular Form
inferredcites →https://doi.org/10.1109/proc.1977.10514openalex-snapshot
A survey of sparse matrix research
inferredcites →https://doi.org/10.1112/jlms/s1-10.37.26openalex-snapshot
On Representatives of Subsets
inferredcites →https://doi.org/10.1137/0111014openalex-snapshot
Two Algorithms for Bipartite Graphs
inferredcites →https://doi.org/10.1137/0201010openalex-snapshot
Depth-First Search and Linear Graph Algorithms
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/0702028openalex-snapshot
Partitioning and Tearing Systems of Equations
inferredcites →https://doi.org/10.1137/1004088openalex-snapshot
On an Approach to Techniques for the Analysis of the Structure of Large Systems of Equations
inferredcites →https://doi.org/10.1145/355780.355785openalex-snapshot
An Implementation of Tarjan's Algorithm for the Block Triangularization of a Matrix
inferredcites →https://doi.org/10.1145/355958.355968openalex-snapshot
Algorithm 575: Permutations for a Zero-Free Diagonal [F1]
inferredcites →https://doi.org/10.21236/ad0705364openalex-snapshot
GRAPH THEORY
inferredcites →https://doi.org/10.2307/2309562openalex-snapshot
An Algorithm for Distinct Representatives
inferredcites →https://doi.org/10.5287/ora-5zakxaoxwopenalex-snapshot
Analysis of sparse systems

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.2139/ssrn.4509550openalex-extracted
Electric Dq0 Library for Smart Grid Simulation
inferred← citeshttps://doi.org/10.1002/aic.690310629openalex-snapshot
Letters to the editor
inferred← citeshttps://doi.org/10.1002/aic.690311110openalex-snapshot
A simultaneous‐modular approach to process flowsheeting and optimization. Part I: Theory and implementation
inferred← citeshttps://doi.org/10.1002/nla.2080openalex-snapshot
A residual based sparse approximate inverse preconditioning procedure for large sparse linear systems
inferred← citeshttps://doi.org/10.1002/nla.427openalex-snapshot
Ordering techniques for singly bordered block diagonal forms for unsymmetric parallel sparse direct solvers
inferred← citeshttps://doi.org/10.1007/11758501_47openalex-snapshot
On the Selection of a Transversal to Solve Nonlinear Systems with Interval Arithmetic
inferred← citeshttps://doi.org/10.1007/3-540-63138-0_23openalex-snapshot
Unstructured graph partitioning for sparse linear system solving
inferred← citeshttps://doi.org/10.1007/978-1-4419-1216-9_1openalex-snapshot
Decompositions of Large-Scale Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-05089-8_1openalex-snapshot
Direct Methods for Linear Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-53429-9_3openalex-snapshot
Overall Solver Flow
inferred← citeshttps://doi.org/10.1007/978-3-319-91938-6_10openalex-snapshot
Symbolic Detection of Steady States of Autonomous Differential Biological Systems by Transformation into Block Triangular Form
inferred← citeshttps://doi.org/10.1007/978-3-322-90142-2_8openalex-snapshot
Literatur
inferred← citeshttps://doi.org/10.1007/978-3-642-22453-9_1openalex-snapshot
Sparse Matrix Methods for Circuit Simulation Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-34336-0_7openalex-snapshot
A Consistent Preliminary Design Process for Mechatronic Systems
inferred← citeshttps://doi.org/10.1007/978-94-009-0369-2_3openalex-snapshot
Generalized and Sparse Least Squares Problems
inferred← citeshttps://doi.org/10.1007/978-94-009-9935-0_15openalex-snapshot
Generalized Reduced Gradient Software for Linearly and Nonlinearly Constrained Problems
inferred← citeshttps://doi.org/10.1007/978-94-011-0135-6_2openalex-snapshot
Numerical Methods for the Simulation of Differential-Algebraic Process Models
inferred← citeshttps://doi.org/10.1007/978-94-017-7188-7_2openalex-snapshot
Fundamental Kernels
inferred← citeshttps://doi.org/10.1007/bf01580890openalex-snapshot
A hierarchical algorithm for making sparse matrices sparser
inferred← citeshttps://doi.org/10.1007/bf02025533openalex-snapshot
Ordering algorithms for irreducible sparse linear systems
inferred← citeshttps://doi.org/10.1007/bf02061063openalex-snapshot
Algorithms for solving nonlinear dynamic decision models
inferred← citeshttps://doi.org/10.1007/bfb0031609openalex-snapshot
Sparse matrix ordering with Scotch
inferred← citeshttps://doi.org/10.1007/s10288-004-0038-6openalex-snapshot
Reformulation and convex relaxation techniques for global optimization
inferred← citeshttps://doi.org/10.1007/s10543-007-0116-1openalex-snapshot
On the row merge tree for sparse LU factorization with partial pivoting
inferred← citeshttps://doi.org/10.1007/s10589-005-4802-0openalex-snapshot
Hyper-Sparsity in the Revised Simplex Method and How to Exploit it
inferred← citeshttps://doi.org/10.1007/s10601-007-9027-7openalex-snapshot
A Reinforcement Learning Approach to Interval Constraint Propagation
inferred← citeshttps://doi.org/10.1007/s10898-006-9005-4openalex-snapshot
An Exact Reformulation Algorithm for Large Nonconvex NLPs Involving Bilinear Terms
inferred← citeshttps://doi.org/10.1007/s12532-020-00181-8openalex-snapshot
Implementation of an interior point method with basis preconditioning
inferred← citeshttps://doi.org/10.1016/0010-4485(93)90081-xopenalex-snapshot
Active occurrence-matrix-based approach to design decomposition
inferred← citeshttps://doi.org/10.1016/0010-4485(96)88488-0openalex-snapshot
Algorithms for the structural diagnosis and decomposition of sparse, underconstrained design systems
inferred← citeshttps://doi.org/10.1016/0024-3795(84)90164-2openalex-snapshot
Signsolvability revisited
inferred← citeshttps://doi.org/10.1016/0098-1354(82)80001-xopenalex-snapshot
On the simultaneous solution and optimization of large-scale engineering systems
inferred← citeshttps://doi.org/10.1016/0098-1354(83)80008-8openalex-snapshot
An approach to large-scale nonlinear programming
inferred← citeshttps://doi.org/10.1016/0098-1354(84)80011-3openalex-snapshot
Sparse matrix methods for equation-based chemical process flowsheeting—I
inferred← citeshttps://doi.org/10.1016/0098-1354(88)85062-2openalex-snapshot
The mathematical modelling of transient systems using differential-algebraic equations
inferred← citeshttps://doi.org/10.1016/0098-1354(93)80031-hopenalex-snapshot
Index analysis of unsteady-state chemical process systems—I. An algorithm for problem formulation
inferred← citeshttps://doi.org/10.1016/0098-1354(93)80240-nopenalex-snapshot
Equation-oriented dynamic simulation current status and future perspectives
inferred← citeshttps://doi.org/10.1016/0098-1354(94)00081-6openalex-snapshot
Generalized block-tridiagonal matrix orderings for parallel computation in process flowsheeting
inferred← citeshttps://doi.org/10.1016/0098-1354(94)00094-5openalex-snapshot
Structural analysis of differential-algebraic equation systems—theory and applications
inferred← citeshttps://doi.org/10.1016/0098-1354(95)00074-7openalex-snapshot
Reliability of iterative linear equation solvers in chemical process simulation
inferred← citeshttps://doi.org/10.1016/b978-0-08-030557-8.50023-0openalex-snapshot
THE CONCEPT OF READING AS ANALYSIS OF MACROECONOMIC MODELS
inferred← citeshttps://doi.org/10.1016/b978-0-12-557580-5.50015-6openalex-snapshot
References
inferred← citeshttps://doi.org/10.1016/b978-0-409-90175-7.50009-8openalex-snapshot
COMPUTATION SEQUENCE IN PROCESS FLOWSHEET CALCULATIONS
inferred← citeshttps://doi.org/10.1016/j.amc.2013.03.016openalex-snapshot
A new preconditioner for indefinite and asymmetric matrices
inferred← citeshttps://doi.org/10.1016/j.cam.2018.08.033openalex-snapshot
A transformation approach that makes SPAI, PSAI and RSAI procedures efficient for large double irregular nonsymmetric sparse linear systems
inferred← citeshttps://doi.org/10.1016/j.compchemeng.2005.05.006openalex-snapshot
Order reduction of large scale DAE models
inferred← citeshttps://doi.org/10.1016/j.compchemeng.2005.08.011openalex-snapshot
Consistency of general point conditions for DAE systems
inferred← citeshttps://doi.org/10.1016/j.conengprac.2018.07.010openalex-snapshot
Real Time Optimization for steam management in an evaporation section
inferred← citeshttps://doi.org/10.1016/j.cor.2012.12.009openalex-snapshot
Push-relabel based algorithms for the maximum transversal problem
inferred← citeshttps://doi.org/10.1016/j.laa.2004.08.019openalex-snapshot
A new class of preconditioners for large-scale linear systems from interior point methods for linear programming
inferred← citeshttps://doi.org/10.1016/j.mcm.2011.09.030openalex-snapshot
Structural analysis for static and dynamic models
inferred← citeshttps://doi.org/10.1016/j.parco.2004.12.008openalex-snapshot
Stabilized bordered block diagonal forms for parallel sparse solvers
inferred← citeshttps://doi.org/10.1016/j.parco.2011.09.004openalex-snapshot
Parallel algorithms for bipartite matching problems on distributed memory computers
inferred← citeshttps://doi.org/10.1016/j.parco.2014.03.004openalex-snapshot
On parallel push–relabel based algorithms for bipartite maximum matching
inferred← citeshttps://doi.org/10.1016/s0019-0578(07)60140-2openalex-snapshot
Data flow modeling for batch and hybrid processes
inferred← citeshttps://doi.org/10.1016/s0076-5392(08)63419-0openalex-snapshot
Chapter 1 Structured Systems
inferred← citeshttps://doi.org/10.1016/s0076-5392(08)63428-1openalex-snapshot
Appendix Graph-Theoretic Algorithms
inferred← citeshttps://doi.org/10.1016/s0098-1354(01)00655-xopenalex-snapshot
Equation-based SPYRO® model and solver for the simulation of the steam cracking process
inferred← citeshttps://doi.org/10.1016/s0098-1354(02)00007-8openalex-snapshot
Model decomposition based method for solving general dynamic optimization problems
inferred← citeshttps://doi.org/10.1016/s0098-1354(97)00231-7openalex-snapshot
An equation analyser for process models
inferred← citeshttps://doi.org/10.1016/s0098-1354(99)00271-9openalex-snapshot
Matrix ordering strategies for process engineering: graph partitioning algorithms for parallel computation
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/s0928-4869(00)00020-3openalex-snapshot
Modular representation of complex hybrid systems: application to the simulation of batch processes
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)33816-8openalex-snapshot
Efficient construction of linear state-space models from index one DAEs
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)62455-8openalex-snapshot
The Concept of Reading as Analysis of Macroeconomic Models
inferred← citeshttps://doi.org/10.1016/s1570-7946(00)80040-1openalex-snapshot
An algorithm for efficient specification analysis in large-scale dynamic process simulation
inferred← citeshttps://doi.org/10.1016/s1570-7946(00)80100-5openalex-snapshot
Equation based SPYRO® model and solver for the simulation of the steam cracking process
inferred← citeshttps://doi.org/10.1017/s0962492916000076openalex-snapshot
A survey of direct methods for sparse linear systems
inferred← citeshttps://doi.org/10.1023/a:1008658514906openalex-snapshot
Recovery from Numerical Instability during Basis Reinversion
inferred← citeshttps://doi.org/10.1023/a:1021943902025openalex-snapshot
Computing Row and Column Counts for Sparse QR and LU Factorization
inferred← citeshttps://doi.org/10.1057/jors.1992.76openalex-snapshot
Construction of LU Factors of the Basis to Reduce Build-Up during Simplex Iterations
inferred← citeshttps://doi.org/10.1080/00207178908547364openalex-snapshot
Optimum feedback patterns in multivariable control systems
inferred← citeshttps://doi.org/10.1080/10556788.2017.1288730openalex-snapshot
On solving hybrid optimal control problems with higher index DAEs
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198508380.001.0001openalex-snapshot
Direct Methods for Sparse Matrices
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198508380.002.0001openalex-snapshot
Glossary of Symbols
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198508380.002.0005openalex-snapshot
Copyright Page
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198508380.002.0006openalex-snapshot
Preface
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198508380.003.0001openalex-snapshot
Introduction
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198508380.003.0002openalex-snapshot
Sparse matrices: storage schemes and simple operations
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198508380.003.0003openalex-snapshot
Gaussian elimination for dense matrices: the algebraic problem
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198508380.003.0004openalex-snapshot
Gaussian elimination for dense matrices: numerical considerations
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198508380.003.0005openalex-snapshot
Gaussian elimination for sparse matrices: an introduction
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198508380.003.0006openalex-snapshot
Reduction to block triangular form
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198508380.003.0007openalex-snapshot
Local pivotal strategies for sparse matrices
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198508380.003.0008openalex-snapshot
Ordering sparse matrices for band solution
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198508380.003.0009openalex-snapshot
Orderings based on dissection
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198508380.003.0010openalex-snapshot
Implementing Gaussian elimination without symbolic factorize
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198508380.003.0011openalex-snapshot
Implementing Gaussian elimination with symbolic factorize
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198508380.003.0012openalex-snapshot
Gaussian elimination using trees
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198508380.003.0013openalex-snapshot
Graphs for symmetric and unsymmetric matrices
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198508380.003.0014openalex-snapshot
The solve phase
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198508380.003.0015openalex-snapshot
Other sparsity-oriented issues
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198508380.005.0001openalex-snapshot
Matrix and vector norms
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198508380.005.0002openalex-snapshot
Pictures of sparse matrices
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198508380.005.0003openalex-snapshot
Solutions to selected exercises
inferred← citeshttps://doi.org/10.1093/imatrm/tnaa003openalex-snapshot
The Pantelides algorithm for delay differential-algebraic equations
inferred← citeshttps://doi.org/10.1109/71.663864openalex-snapshot
Efficient sparse LU factorization with partial pivoting on distributed memory architectures
inferred← citeshttps://doi.org/10.1109/81.273921openalex-snapshot
Balanced decompositions of sparse systems for multilevel parallel processing
inferred← citeshttps://doi.org/10.1109/ase.2003.1240315openalex-snapshot
Semi-automatic fault localization and behavior verification for physical system simulation models
inferred← citeshttps://doi.org/10.1109/cacsd.1994.288938openalex-snapshot
Determination of perturbation index of a DAE with maximum weighted matching algorithm
inferred← citeshttps://doi.org/10.1109/dac.1990.114886openalex-snapshot
A hierarchy preserving hierarchical compactor
inferred← citeshttps://doi.org/10.1109/iccp.2013.6646131openalex-snapshot
Sparse matrix permutations to a block triangular form in a distributed environment
inferred← citeshttps://doi.org/10.1109/imtc.2001.928188openalex-snapshot
Automatic structure analysis of large scale differential algebraic systems
inferred← citeshttps://doi.org/10.1109/ipdps.2000.846068openalex-snapshot
Using postordering and static symbolic factorization for parallel sparse LU
inferred← citeshttps://doi.org/10.1109/iscas.2010.5537195openalex-snapshot
Parallel sparse matrix solver for direct circuit simulations on FPGAs
inferred← citeshttps://doi.org/10.1109/proc.1977.10514openalex-snapshot
A survey of sparse matrix research
inferred← citeshttps://doi.org/10.1109/sc.1998.10030openalex-snapshot
Making Sparse Gaussian Elimination Scalable by Static Pivoting
inferred← citeshttps://doi.org/10.1134/s0005117909030187openalex-snapshot
Combinatorial optimization in system configuration design
inferred← citeshttps://doi.org/10.1137/030602733openalex-snapshot
Multilevel ILU With Reorderings for Diagonal Dominance
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/0607066openalex-snapshot
Computing the Structural Index
inferred← citeshttps://doi.org/10.1137/0608037openalex-snapshot
Computing a Sparse Basis for the Null Space
inferred← citeshttps://doi.org/10.1137/0608045openalex-snapshot
The Null Space Problem II. Algorithms
inferred← citeshttps://doi.org/10.1137/0611030openalex-snapshot
Partitioning Sparse Matrices with Eigenvectors of Graphs
inferred← citeshttps://doi.org/10.1137/0612037openalex-snapshot
Nested Epsilon Decompositions of Linear Systems: Weakly Coupled and Overlapping Blocks
inferred← citeshttps://doi.org/10.1137/0614046openalex-snapshot
Sparsity Analysis of the $QR$ Factorization
inferred← citeshttps://doi.org/10.1137/080713409openalex-snapshot
Weighted Matrix Ordering and Parallel Banded Preconditioners for Iterative Linear System Solvers
inferred← citeshttps://doi.org/10.1137/0905043openalex-snapshot
Direct Methods for Solving Sparse Systems of Linear Equations
inferred← citeshttps://doi.org/10.1137/0908072openalex-snapshot
Symbolic Factorization for Sparse Gaussian Elimination with Partial Pivoting
inferred← citeshttps://doi.org/10.1137/0909014openalex-snapshot
The Consistent Initialization of Differential-Algebraic Systems
inferred← citeshttps://doi.org/10.1137/1026001openalex-snapshot
Staircase Matrices and Systems
inferred← citeshttps://doi.org/10.1137/120900800openalex-snapshot
An Approach to Making SPAI and PSAI Preconditioning Effective for Large Irregular Sparse Linear Systems
inferred← citeshttps://doi.org/10.1137/s0895479887139455openalex-snapshot
Predicting Structure in Sparse Matrix Computations
inferred← citeshttps://doi.org/10.1137/s0895479892230973openalex-snapshot
Some Results on Structure Prediction in Sparse $QR$ Factorization
inferred← citeshttps://doi.org/10.1137/s0895479894246905openalex-snapshot
An Unsymmetric-Pattern Multifrontal Method for Sparse LU Factorization
inferred← citeshttps://doi.org/10.1137/s0895479894278952openalex-snapshot
An Approximate Minimum Degree Ordering Algorithm
inferred← citeshttps://doi.org/10.1137/s0895479898337385openalex-snapshot
S + : Efficient 2D Sparse LU Factorization on Parallel Machines
inferred← citeshttps://doi.org/10.1137/s1064827599361308openalex-snapshot
Preconditioning Highly Indefinite and Nonsymmetric Matrices
inferred← citeshttps://doi.org/10.1145/1024074.1024079openalex-snapshot
A column approximate minimum degree ordering algorithm
inferred← citeshttps://doi.org/10.1145/123186.123311openalex-snapshot
A hierarchy preserving hierarchical compactor
inferred← citeshttps://doi.org/10.1145/151271.151275openalex-snapshot
ODEXPERT: an expert system to select numerical solvers for initial value ODE systems
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/1824801.1824814openalex-snapshot
Algorithm 907
inferred← citeshttps://doi.org/10.1145/2049662.2049663openalex-snapshot
The university of Florida sparse matrix collection
inferred← citeshttps://doi.org/10.1145/2049662.2049670openalex-snapshot
Algorithm 915, SuiteSparseQR
inferred← citeshttps://doi.org/10.1145/2049673.2049677openalex-snapshot
Design, implementation, and analysis of maximum transversal algorithms
inferred← citeshttps://doi.org/10.1145/229473.229476openalex-snapshot
The design of MA48
inferred← citeshttps://doi.org/10.1145/277651.277658openalex-snapshot
Elimination forest guided 2D sparse LU factorization
inferred← citeshttps://doi.org/10.1145/2967938.2967943openalex-snapshot
Sparso
inferred← citeshttps://doi.org/10.1145/3162068openalex-snapshot
Gradually typed symbolic expressions
inferred← citeshttps://doi.org/10.1145/3175493.3162068openalex-snapshot
Gradually typed symbolic expressions
inferred← citeshttps://doi.org/10.1145/3442348openalex-snapshot
Algorithm 1015
inferred← citeshttps://doi.org/10.1145/3545008.3545035openalex-snapshot
Highly Parallel Linear Forest Extraction from a Weighted Graph on GPUs
inferred← citeshttps://doi.org/10.1145/355958.355968openalex-snapshot
Algorithm 575: Permutations for a Zero-Free Diagonal [F1]
inferred← citeshttps://doi.org/10.1145/358746.358768openalex-snapshot
ACM forum
inferred← citeshttps://doi.org/10.1145/369028.369092openalex-snapshot
Sparse LU factorization with partial pivoting on distributed memory machines
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/5925.5932openalex-snapshot
Predicting fill for sparse orthogonal factorization
inferred← citeshttps://doi.org/10.1145/592843.592848openalex-snapshot
A software package for sparse orthogonal factorization and updating
inferred← citeshttps://doi.org/10.1145/66888.66890openalex-snapshot
A graph partitioning algorithm by node separators
inferred← citeshttps://doi.org/10.1145/98267.98287openalex-snapshot
Computing the block triangular form of a sparse matrix
inferred← citeshttps://doi.org/10.1145/992200.992205openalex-snapshot
A column pre-ordering strategy for the unsymmetric-pattern multifrontal method
inferred← citeshttps://doi.org/10.1177/0037549704046340openalex-snapshot
Automated Static Analysis of Equation-Based Components
inferred← citeshttps://doi.org/10.1177/0037549706071902openalex-snapshot
A Framework for Implementation-Independent Simulation Models
inferred← citeshttps://doi.org/10.1201/9781420010572.ch40openalex-snapshot
Sparse Matrix Methods
inferred← citeshttps://doi.org/10.1201/b11644-15openalex-snapshot
Scotch and PT-Scotch Graph Partitioning Software
inferred← citeshttps://doi.org/10.1201/b11644-3openalex-snapshot
Combinatorial Problems in Solving Linear Systems
inferred← citeshttps://doi.org/10.1201/b16113-62openalex-snapshot
Sparse Matrix Methods
inferred← citeshttps://doi.org/10.1201/b16132-60openalex-snapshot
The Probabilistic Method
inferred← citeshttps://doi.org/10.1201/b16132-82openalex-snapshot
Matchings and Assignments
inferred← citeshttps://doi.org/10.13182/nt00-a3155openalex-snapshot
Efficient Simulation Modeling of an Integrated High-Level-Waste Processing Complex
inferred← citeshttps://doi.org/10.21236/ada487623openalex-snapshot
Evaluating Sparse Linear System Solvers on Scalable Parallel Architectures
inferred← citeshttps://doi.org/10.2172/10146336openalex-snapshot
A tight and explicit representation of Q in sparse QR factorization
inferred← citeshttps://doi.org/10.2172/5256662openalex-snapshot
A tight and explicit representation of Q in sparse QR factorization
inferred← citeshttps://doi.org/10.31274/rtd-180813-9652openalex-snapshot
Development of a process simulator using object oriented programming: Numerical procedures and convergence studies
inferred← citeshttps://doi.org/10.3182/20050703-6-cz-1902.01558openalex-snapshot
ORDER REDUCTION OF DAE MODELS
inferred← citeshttps://doi.org/10.3384/ecp12076433openalex-snapshot
Survey of appropriate matching algorithms for large scale systems of differential algebraic equations
inferred← citeshttps://doi.org/10.3384/ecp17132565openalex-snapshot
Transformation of Differential Algebraic Array Equations to Index One Form
inferred← citeshttps://doi.org/10.3390/pr12010019openalex-snapshot
Electric DQ0 Library Model for Smart Grid Simulation
inferred← citeshttps://doi.org/10.3390/sym11101199openalex-snapshot
Software Tool for Acausal Physical Modelling and Simulation
inferred← citeshttps://doi.org/10.4173/mic.1983.3.2openalex-snapshot
Partitioning and Tearing of Networks Applied to Process Flowsheeting
inferred← citeshttps://doi.org/10.48550/arxiv.1407.7072openalex-snapshot
Fast Spammer Detection Using Structural Rank
inferred← citeshttps://doi.org/10.48550/arxiv.2104.03546openalex-snapshot
Graph Partitioning and Sparse Matrix Ordering using Reinforcement Learning and Graph Neural Networks
inferred← citeshttps://doi.org/10.5555/3108096.3108110openalex-snapshot
Pivoting strategy for fast LU decomposition of sparse block matrices
inferred← citeshttps://doi.org/10.5555/509058.509092openalex-snapshot
Making Sparse Gaussian Elimination Scalable by Static Pivoting
inferred← citeshttps://doi.org/10.70675/6b0ffd8cz093az4b54z8acbz93509d4c89ceopenalex-snapshot
Modélisation du démarrage et de la réactivation rapide d’une turbine d’hélicoptère
inferred← citeshttps://doi.org/10.70675/e4dcfd4bz4187z49c2za000zf3c0cc4667f2openalex-snapshot
Méthodes et outils ensemblistes pour le pré-dimensionnement de systèmes mécatroniques
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.