Uriel Feige. Coping with the NP-Hardness of the Graph Bandwidth Problem. In Magnús M. Halldórsson, editor, Algorithm Theory - SWAT 2000, 7th Scandinavian Workshop on Algorithm Theory, Bergen, Norway, July 5-7, 2000, Proceedings. Volume 1851 of Lecture Notes in Computer Science, pages 10-19, Springer, 2000. [doi]
Abstract is missing.