On the public citation graph
Bandwidth Minimization: An approximation algorithm for caterpillars
0 signed · 48 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.3190060302openalex-snapshot
The bandwidth problem for graphs and matrices—a survey
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/0196-6774(84)90006-3openalex-snapshot
Improved dynamic programming algorithms for bandwidth minimization and the MinCut Linear Arrangement problem
inferredcites →https://doi.org/10.1016/0304-3975(83)90078-6openalex-snapshot
Bandwidth constraints on problems complete for polynomial time
inferredcites →https://doi.org/10.1137/0134037openalex-snapshot
Complexity Results for Bandwidth Minimization
inferredcites →https://doi.org/10.1137/0601042openalex-snapshot
Dynamic-Programming Algorithms for Recognizing Small-Bandwidth Graphs in Polynomial Time
inferredcites →https://doi.org/10.1137/0602041openalex-snapshot
The Bandwidth of Caterpillars with Hairs of Length 1 and 2
inferredcites →https://doi.org/10.1137/0607057openalex-snapshot
The Bandwidth Minimization Problem for Caterpillars with Hair Length 3 is NP-Complete
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.1145/800195.805928openalex-snapshot
Reducing the bandwidth of sparse symmetric matrices
inferredcites →https://doi.org/10.2307/2287146openalex-snapshot
The Theory and Applications of Graphs.
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)1097-0118(199906)31:2<75::aid-jgt1>3.0.co;2-sopenalex-snapshot
A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs
inferred← citeshttps://doi.org/10.1006/inco.1995.1029openalex-snapshot
Node Replacement Graph Languages Squeezed with Chains, Trees, and Forests
inferred← citeshttps://doi.org/10.1006/jagm.2000.1118openalex-snapshot
Improved Bandwidth Approximation for Trees and Chordal Graphs
inferred← citeshttps://doi.org/10.1006/jcss.1999.1682openalex-snapshot
Approximating the Bandwidth via Volume Respecting Embeddings
inferred← citeshttps://doi.org/10.1007/11496199_40openalex-snapshot
Graph Bandwidth of Weighted Caterpillars
inferred← citeshttps://doi.org/10.1007/11538462_6openalex-snapshot
Approximating the Bandwidth of Caterpillars
inferred← citeshttps://doi.org/10.1007/3-540-40064-8_23openalex-snapshot
Bandwidth of Split and Circular Permutation Graphs
inferred← citeshttps://doi.org/10.1007/3-540-44399-1_49openalex-snapshot
A New Measure for the Bandwidth Minimization Problem
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-54029-6_155openalex-snapshot
Approximation algorithms for the Bandwidth Minimization Problem for a large class of trees
inferred← citeshttps://doi.org/10.1007/3-540-60246-1_132openalex-snapshot
Graph inference from a walk for trees of bounded degree 3 is NP-complete
inferred← citeshttps://doi.org/10.1007/3-540-63248-4_1openalex-snapshot
Polynomial time approximation schemes for some dense instances of NP-hard optimization problems
inferred← citeshttps://doi.org/10.1007/978-3-540-24855-2_10openalex-snapshot
Improving the Performance of a Genetic Algorithm Using a Variable-Reordering Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-540-78773-0_19openalex-snapshot
Bandwidth of Bipartite Permutation Graphs in Polynomial Time
inferred← citeshttps://doi.org/10.1007/978-3-642-13769-3_49openalex-snapshot
A Hybrid ACO Approach to the Matrix Bandwidth Minimization Problem
inferred← citeshttps://doi.org/10.1007/978-3-662-43948-7_34openalex-snapshot
Parameterized Complexity of Bandwidth on Trees
inferred← citeshttps://doi.org/10.1007/bf02679454openalex-snapshot
Approximation algorithms for the bandwidth minimization problem for a large class of trees
inferred← citeshttps://doi.org/10.1007/s00453-007-9002-0openalex-snapshot
Approximating the Bandwidth of Caterpillars
inferred← citeshttps://doi.org/10.1016/j.jcss.2010.06.006openalex-snapshot
Hardness results for approximating the bandwidth
inferred← citeshttps://doi.org/10.1016/j.jda.2008.11.001openalex-snapshot
Bandwidth of bipartite permutation graphs in polynomial time
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.07.015openalex-snapshot
Graph bandwidth of weighted caterpillars
inferred← citeshttps://doi.org/10.1016/s0140-3664(02)00212-8openalex-snapshot
Wavelength assignment to minimize requirement on tunable range of optical transceivers in WDM networks
inferred← citeshttps://doi.org/10.1016/s0166-218x(97)00101-7openalex-snapshot
Embedding ladders and caterpillars into the hypercube
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00181-4openalex-snapshot
Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems
inferred← citeshttps://doi.org/10.1093/jigpal/jzr004openalex-snapshot
Hybrid ant models with a transition policy for solving a complex problem
inferred← citeshttps://doi.org/10.1109/icccn.1999.805550openalex-snapshot
Wavelength assignment to minimize requirement on tunable range of optical transceivers in WDM networks
inferred← citeshttps://doi.org/10.1109/sfcs.1998.743431openalex-snapshot
The complexity of the approximation of the bandwidth problem
inferred← citeshttps://doi.org/10.1137/080712921openalex-snapshot
Low Distortion Maps Between Point Sets
inferred← citeshttps://doi.org/10.1145/1007352.1007398openalex-snapshot
Low distortion maps between point sets
inferred← citeshttps://doi.org/10.1145/276698.276716openalex-snapshot
Approximating the bandwidth via volume respecting embeddings (extended abstract)
inferred← citeshttps://doi.org/10.1145/276698.276717openalex-snapshot
Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems
inferred← citeshttps://doi.org/10.1145/568522.568523openalex-snapshot
A survey of graph layout problems
inferred← citeshttps://doi.org/10.1287/moor.2014.0706openalex-snapshot
Euclidean Networks with a Backbone and a Limit Theorem for Minimum Spanning Caterpillars
inferred← citeshttps://doi.org/10.3390/a6010060openalex-snapshot
Tractabilities and Intractabilities on Geometric Intersection Graphs
inferred← citeshttps://doi.org/10.5555/338219.338640openalex-snapshot
Improved bandwidth approximation for trees
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.