On the public citation graph

On the Probable Performance of Heuristics for Bandwidth Minimization

https://doi.org/10.1137/0215041
0 signed · 36 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.1007/bf02239468openalex-snapshot
Note on minimizing the bandwidth of sparse, symmetric matrices
inferredcites →https://doi.org/10.1007/bf02252900openalex-snapshot
Minimizing the bandwidth of sparse symmetric matrices
inferredcites →https://doi.org/10.1007/bf02280884openalex-snapshot
The NP-Completeness of the bandwidth minimization problem
inferredcites →https://doi.org/10.1016/0022-0000(79)90045-xopenalex-snapshot
Fast probabilistic algorithms for hamiltonian circuits and matchings
inferredcites →https://doi.org/10.1137/0134037openalex-snapshot
Complexity Results for Bandwidth Minimization
inferredcites →https://doi.org/10.1145/800195.805928openalex-snapshot
Reducing the bandwidth of sparse symmetric matrices
inferredcites →https://doi.org/10.21136/cmj.1970.100949openalex-snapshot
A remark on a problem of Harary
inferredcites →https://doi.org/10.5486/pmd.1959.6.3-4.12openalex-snapshot
On random graphs. I.

What points at this work

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

inferred← citeshttps://doi.org/10.1002/rsa.3240050303openalex-snapshot
Finding hidden hamiltonian cycles
inferred← citeshttps://doi.org/10.1006/jagm.1998.0997openalex-snapshot
Approximating the Bandwidth for Asteroidal Triple-Free Graphs
inferred← citeshttps://doi.org/10.1006/jcss.1999.1682openalex-snapshot
Approximating the Bandwidth via Volume Respecting Embeddings
inferred← citeshttps://doi.org/10.1007/3-540-44985-x_2openalex-snapshot
Coping with the NP-Hardness of the Graph Bandwidth Problem
inferred← citeshttps://doi.org/10.1007/3-540-46784-x_28openalex-snapshot
Linear Orderings of Random Geometric Graphs
inferred← citeshttps://doi.org/10.1007/3-540-50728-0_57openalex-snapshot
Bandwidth and profile minimization
inferred← citeshttps://doi.org/10.1007/3-540-60313-1_161openalex-snapshot
Approximating the bandwidth for asteroidal triple-free graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-02029-2_15openalex-snapshot
On the Cubicity of AT-Free Graphs and Circular-Arc Graphs
inferred← citeshttps://doi.org/10.1007/978-94-009-2411-6_7openalex-snapshot
Bandwidth in Multigrids for Random Graphs
inferred← citeshttps://doi.org/10.1007/s00373-011-1099-xopenalex-snapshot
Cubicity and Bandwidth
inferred← citeshttps://doi.org/10.1007/s10732-026-09604-6openalex-snapshot
Small boundary: a family of linear-time greedy heuristics for the minimum linear arrangement problem
inferred← citeshttps://doi.org/10.1016/0166-218x(91)90046-yopenalex-snapshot
Lattice bandwidth of random graphs
inferred← citeshttps://doi.org/10.1016/0890-5401(92)90012-5openalex-snapshot
The online graph bandwidth problem
inferred← citeshttps://doi.org/10.1016/j.cor.2021.105422openalex-snapshot
Lower bounds for the bandwidth problem
inferred← citeshttps://doi.org/10.1016/j.cosrev.2026.100962openalex-snapshot
A survey of heuristics for the minimum linear arrangement problem
inferred← citeshttps://doi.org/10.1016/s0012-365x(00)00278-8openalex-snapshot
Approximating layout problems on random graphs
inferred← citeshttps://doi.org/10.1016/s0377-2217(02)00715-4openalex-snapshot
GRASP and path relinking for the matrix bandwidth minimization
inferred← citeshttps://doi.org/10.1023/a:1008374125234openalex-snapshot
Hiding Cliques for Cryptographic Security
inferred← citeshttps://doi.org/10.1145/103418.103442openalex-snapshot
Finding hidden Hamiltonian cycles
inferred← citeshttps://doi.org/10.1145/276698.276716openalex-snapshot
Approximating the bandwidth via volume respecting embeddings (extended abstract)
inferred← citeshttps://doi.org/10.1145/3627535.3638496openalex-snapshot
Arrow Matrix Decomposition: A Novel Approach for Communication-Efficient Sparse Matrix Multiplication
inferred← citeshttps://doi.org/10.1145/45054.214373openalex-snapshot
Multicolor reordering of sparse matrices resulting from irregular grids
inferred← citeshttps://doi.org/10.1145/568522.568523openalex-snapshot
A survey of graph layout problems
inferred← citeshttps://doi.org/10.1145/990308.990310openalex-snapshot
Smoothed analysis of algorithms
inferred← citeshttps://doi.org/10.1214/aoap/1019487353openalex-snapshot
Vertex ordering and partitioning problems for random spatial graphs
inferred← citeshttps://doi.org/10.1287/ijoc.1040.0083openalex-snapshot
Laying Out Sparse Graphs with Provably Minimum Bandwidth
inferred← citeshttps://doi.org/10.1287/ijoc.2018.0884openalex-snapshot
Optimization Bounds from the Branching Dual
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0607092openalex-snapshot
Representing graphs as the intersection of axis-parallel cubes
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.