Last update: Thu May 16 02:07:42 MDT 2019
@Article{Feige:2000:CNH,
author = "Uriel Feige",
title = "Coping with the {NP}-Hardness of the Graph Bandwidth
Problem",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1851",
pages = "10--??",
year = "2000",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:08:43 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t1851.htm;
http://www.math.utah.edu/pub/tex/bib/lncs2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1851/18510010.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1851/18510010.pdf",
acknowledgement = ack-nhfb,
}