More recent technical reports are available on-line and we encourage
downloading from WWW browsers or FTP.
Reports that are not available
may be ordered by email to
tech@dimacs.rutgers.edu.
Be sure to include the numbers of the reports needed and your full
Postal Address.
Problems with Technical Reports?
We try to check on the accessibility of technical reports regularly, but
mistakes do happen. If you have trouble obtaining reports, please send email to
tech@dimacs.rutgers.edu identifying the
report you had trouble with. We will try to assist you in obtaining the report.
89-1 Graph Searching, and a Minimax Theorem for Tree-Width
Seymour & Thomas
89-2 Quickly Excluding a Forest
Bienstock, Robertson, Seymour & Thomas
89-3 DIMACS Workshop on Polyhedral Combinatorics Cook & Seymour
89-4 Old and New Proofs of the Erdos-Ko-Rado Theorem Frankl & Graham
89-5 On the Rectilinear Art Gallery Problem Hoffmann
89-6 The Density of the Set of Sums Ruzsa
89-7 A Randomization Scheme for Speeding Up Algorithms for Linear and Convex Programming Problems with High Constraints-to-variables Ratio Adler & Shamir
89-8 Identifying the Finite Groups of Lie Type Gorenstein & Lyons
89-9 Detecting the Intersection of Convex Objects in the Plane Dobkin & Souvaine
89-10 On the Number of Sums and Differences Ruzsa
89-11 1989 Annual Report for NSF DIMACS
89-12 The Intrinsic Spread of a Configuration in R Goodman, Pollack & Sturmfels
89-13 A Data Structure for Arc Insertion and Regular Path Finding Buchsbaum, Kanellakis & Vitter
89-14 Workshop on Distributed Computing and Cryptography Feigenbaum & Merritt
89-15 Universal Elements and the Complexity of Certain Classes of Infinite Graphs Komjath & Pach
89-16 Quickly Excluding a Planar Graph Robertson, Seymour & Thomas
89-17 Excluding Infinite Trees Seymour & Thomas
89-18 A Separator Theorem for Non-Planar Graphs Alon, Seymour & Thomas
89-19 p-Competition Graphs Kim, McKee, McMorris & Roberts
89-20 The Contour Problem for Restricted-Orientation Polygons Souvaine & Bjorling-Sachs
89-21 Sums of Finite Sets Ruzsa
89-22 2-Competition Graphs Isaak, Kim, McKee, McMorris & Roberts
89-23 Workshop on Reliability of Computer and Communication Networks Hwang, Monma & Roberts
89-24 DIMACS Workshop on Geometric Complexity Chazelle
Return to Tech Reports Page
DIMACS Homepage