The minimum independence number for designs David A. GrableKevin T. PhelpsVojtěch Rödl OriginalPaper Pages: 175 - 185
An approximate max-flow min-cut relation for undirected multicommodity flow, with applications Philip KleinSatish RaoR. Ravi OriginalPaper Pages: 187 - 202
A one-round, two-prover, zero-knowledge protocol for NP Dror LapidotAdi Shamir OriginalPaper Pages: 203 - 214
The geometry of graphs and some of its algorithmic applications Nathan LinialEran LondonYuri Rabinovich OriginalPaper Pages: 215 - 245
The local nature of Δ-coloring and its algorithmic applications Alessandro PanconesiAravind Srinivasan OriginalPaper Pages: 255 - 280