Graphs with small bandwidth and cutwidth

Approximating the bandwidth via volume respecting embeddings (extended abstract)

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing

Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing

Coping with the NP-Hardness of the Graph Bandwidth Problem

SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory

Constructive Linear Time Algorithms for Small Cutwidth and Carving-Width

ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation

Cutwidth I: a linear time fixed parameter algorithm

Journal of Algorithms

Cutwidth II: algorithms for partial w-trees of bounded degree

Journal of Algorithms

Lower bounds on treespan

Information Processing Letters

Laying Out Sparse Graphs with Provably Minimum Bandwidth

INFORMS Journal on Computing

Labeling schemes for weighted dynamic trees

Information and Computation

Dynamic routing schemes for graphs with low local density

ACM Transactions on Algorithms (TALG)

Distortion lower bounds for line embeddings

Information Processing Letters

Fixed-parameter algorithms for protein similarity search under mRNA structure constraints

Journal of Discrete Algorithms

Lower bounds on treespan

Information Processing Letters

Cutwidth I: A linear time fixed parameter algorithm

Journal of Algorithms

Cutwidth II: Algorithms for partial w-trees of bounded degree

Journal of Algorithms

Hardness results for approximating the bandwidth

Journal of Computer and System Sciences

Approximating the bandwidth of caterpillars

APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques

Embedding bounded bandwidth graphs into ℓ1

ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I

Fixed-parameter algorithms for protein similarity search under mRnA structure constraints

WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science

Towards fully multivariate algorithmics: Parameter ecology and the deconstruction of computational complexity

European Journal of Combinatorics