David R. Karger---Library

• Igor Pak's papers
• Eytan Adar's thesis
• Approximating Minimum-Size k-Connected Spanning Subgraph via Matching, Joseph Cheriyan and Ramki Thurimella
• Minimizing Symmetric Submodular Functions, by Maurice Queyranne
• SFB-Report 42, August 1995, 13 pages

H. Kellerer, T. Tautenhahn and G.J. Woeginger
Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine
journal article
• On Randomization in Sequential and Distributed Algorithms by Gupta, Smolka, and Bhasar.
• A compendium of NP optimization problems
• Report on Theoretical Computer Science (Aho, Johnson, Karp, et al)
• A Spectral Algorithm for Seriation and the Consecutive Ones Problem, Jon E. Atkins, Erik G. Boman and Bruce Hendrickson, SIAM J. Comput. (to appear)
• N. Alon, M. Dietzfinbinder, P. B. Miltersen, E. Petrank, and G. Tardos. Linear Hashing Yields Small Buckets
• The Interior-Point Revolution in Constrained Optimization , Margaret H. Wright