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

A survey of graph layout problems

ACM Computing Surveys (CSUR)

Interval degree and bandwidth of a graph

Discrete Applied Mathematics

Low distortion maps between point sets

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing

Flow metrics

Theoretical Computer Science - Latin American theorotical informatics

Virtual coordinates for ad hoc and sensor networks

Proceedings of the 2004 joint workshop on Foundations of mobile computing

Confronting hardness using a hybrid approach

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm

Laying Out Sparse Graphs with Provably Minimum Bandwidth

INFORMS Journal on Computing

A divide and conquer algorithm for d-dimensional arrangement

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms

Low Distortion Maps Between Point Sets

SIAM Journal on Computing

An exponential time 2-approximation algorithm for bandwidth

Theoretical Computer Science