|Title:||NP-Completeness of Several Arrangement Problems
|Authors:||S. Even and Y. Shiloah
|Abstract:||Scanning this report is a courtesy of Yana Katz and Debbie Miller, along with Rivka Zur, without whom it would not be available online.|
|Copyright||The above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information|
Remark: Any link to this technical report should be to this page (http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/1975/CS/CS0043), rather than to the URL of the PDF files directly. The latter URLs may change without notice.
To the list of the CS technical reports of 1975
To the main CS technical reports page
Computer science department, Technion