1. Polynomial algorithms for the min-cut linear arrangement problem on degree restricted trees;Chung,1982
2. Complexity results for bandwidth minimization;Garey;SIAM J. Appl. Math.,1978
3. F. Gavril, Some NP-complete problems on graphs, in Proceedings 11th Annual Conference on Information Sciences and Systems, The Johns Hopkins University, Baltimore, pp. 91–95.
4. Cutwidth problems in graphs;Gurari,1981
5. Upper and lower bounds on the complexity of the Min-Cut Linear Arrangement problem on trees;Lengauer;SIAM J. Algebraic Discrete Methods,1982