Apologies for X-postings. Dear friends, Can someone kindly send me a full-text copy of the paper in below reference? Lengauer T. , * Upper and lower bounds on the complexity of min cut linear arrangement problem on trees* , SIAM J. Alg. and discrete methods, 1982, Vol 3(1) , pp 99-113 Thanks and regards, Kshema Dr. (Ms.) Kshema Prakash Faculty Librarian - Gr I, Contact Person e-Journals (Library) & Coordinator - Distance Library Services DEI Central Library Dayalbagh Educational Institute (Deemed University) Dayalbagh, Agra 282 0110 Uttar Pradesh, India Mob: +919897190604 http://kshema-distancelibraryservices.blogspot.com/ Jonathan Swifthttp://www.brainyquote.com/quotes/authors/j/jonathan_swift.html - "May you live every day of your life." -- This message has been scanned for viruses and dangerous content by MailScanner, and is believed to be clean.