On the public citation graph
Making sparse matrices sparser: Computational results
0 signed · 24 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/bf01580890openalex-snapshot
A hierarchical algorithm for making sparse matrices sparser
inferredcites →https://doi.org/10.1016/b978-0-12-566780-7.50017-9openalex-snapshot
A Fast Algorithm that makes Matrices Optimally Sparse
inferredcites →https://doi.org/10.1109/tassp.1984.1164450openalex-snapshot
Combinatorial optimization:Algorithms and complexity
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/0406005openalex-snapshot
The Weighted Sparsity Problem: Complexity and Algorithms
inferredcites →https://doi.org/10.1287/ijoc.1.2.84openalex-snapshot
Data Structures and Programming Techniques for the Implementation of Karmarkar's Algorithm
inferredcites →https://doi.org/10.1287/mnsc.3.3.255openalex-snapshot
The Elimination form of the Inverse and its Application to Linear Programming
inferredcites →https://doi.org/10.1287/moor.5.3.321openalex-snapshot
Converting Linear Programs to Network Problems
inferredcites →https://doi.org/10.21236/ada131387openalex-snapshot
A Combinatorial Approach to Some Sparse Matrix Problems.
inferredcites →https://doi.org/10.2307/2322374openalex-snapshot
Combinatorial Optimization: Algorithms and Complexity.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/bf01580890openalex-snapshot
A hierarchical algorithm for making sparse matrices sparser
inferred← citeshttps://doi.org/10.1007/s10589-019-00114-9openalex-snapshot
Computing the spark: mixed-integer programming for the (vector) matroid girth problem
inferred← citeshttps://doi.org/10.1007/s12532-020-00186-3openalex-snapshot
Mixed-integer programming techniques for the connected max-k-cut problem
inferred← citeshttps://doi.org/10.1016/j.orl.2019.06.001openalex-snapshot
Sparsity of integer formulations for binary programs
inferred← citeshttps://doi.org/10.1137/0406005openalex-snapshot
The Weighted Sparsity Problem: Complexity and Algorithms
inferred← citeshttps://doi.org/10.1145/155743.152620openalex-snapshot
Implementation and computational results for the hierarchical algorithm for making sparse matrices sparser
inferred← citeshttps://doi.org/10.1145/3364504openalex-snapshot
Matrix Multiplication, a Little Faster
inferred← citeshttps://doi.org/10.1287/ijoc.9.1.73openalex-snapshot
Presolve Analysis of Linear Programs Prior to Applying an Interior Point Method
inferred← citeshttps://doi.org/10.48550/arxiv.2008.03759openalex-snapshot
Sparsifying the Operators of Fast Matrix Multiplication Algorithms
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.