On a theorem of lovász on covers inr-partite hypergraphs Ron AharoniRon HolzmanMichael Krivelevich OriginalPaper Pages: 149 - 174
All 0–1 polytopes are traveling salesman polytopes Louis J. BilleraA. Sarangarajan OriginalPaper Pages: 175 - 188
Independence and port oracles for matroids, with an application to computational learning theory Collette R. CoullardLisa Hellerstein OriginalPaper Pages: 189 - 208
On point covers of multiple intervals and axis-parallel rectangles Gyula KárolyiGábor Tardos OriginalPaper Pages: 213 - 222
On the recognition complexity of some graph properties Eberhard Triesch OriginalPaper Pages: 259 - 268
Lines, line-point incidences and crossing families in dense sets Pavel Valtr OriginalPaper Pages: 269 - 294