A Dynamic location problem for graphs F. R. K. ChungR. L. GrahamM. E. Saks OriginalPaper Pages: 111 - 131
Tight bounds for minimax grid matching with applications to the average case analysis of algorithms T. LeightonP. Shor OriginalPaper Pages: 161 - 187
Some generalizations of the criss-cross method for the linear complementarity problem of oriented matroids E. KlafszkyT. Terlaky OriginalPaper Pages: 189 - 198
Asymptotic solution for a new class of forbiddenr-graphs A. F. Sidorenko OriginalPaper Pages: 207 - 215
Ahypergraph-free construction of highly chromatic graphs without short cycles Igor Kříž Notes Pages: 227 - 229