Computing the bandwidth of interval graphs

A survey of graph layout problems

ACM Computing Surveys (CSUR)

Coping with the NP-Hardness of the Graph Bandwidth Problem

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

Bandwidth of Split and Circular Permutation Graphs

WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science

Minimum Distortion Embeddings into a Path of Bipartite Permutation and Threshold Graphs

SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory

Faster Exact Bandwidth

Graph-Theoretic Concepts in Computer Science

Cutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs

Graph-Theoretic Concepts in Computer Science

Bandwidth of bipartite permutation graphs in polynomial time

Journal of Discrete Algorithms

Bandwidth on AT-Free Graphs

ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation

Hardness and approximation of minimum distortion embeddings

Information Processing Letters

Approximating bandwidth by mixing layouts of interval graphs

STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science

Mixed search number and linear-width of interval and split graphs

WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science

Bandwidth of bipartite permutation graphs in polynomial time

LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics

Hardness results for approximating the bandwidth

Journal of Computer and System Sciences

Computing minimum distortion embeddings into a path for bipartite permutation graphs and threshold graphs

Theoretical Computer Science

Analyzing consistency properties for fun and profit

Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing

Bandwidth on AT-free graphs

Theoretical Computer Science

Even Faster Exact Bandwidth

ACM Transactions on Algorithms (TALG)

Optimal linear arrangement of interval graphs

MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science

Bandwidth of convex bipartite graphs and related graphs

Information Processing Letters

Approximability of the path-distance-width for AT-free graphs

WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science

An exponential time 2-approximation algorithm for bandwidth

Theoretical Computer Science

Approximating the path-distance-width for AT-free graphs and graphs in related classes

Discrete Applied Mathematics