A survey of graph layout problems
ACM Computing Surveys (CSUR)
Approximating bandwidth by mixing layouts of interval graphs
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Hardness results for approximating the bandwidth
Journal of Computer and System Sciences
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
| Hi-index | 0.00 |