V. P. Grishuhin
: Cones of alternating and cut submodular set functions.
, D. S. Cao
: Solution to a problem of C. D. Godsil regarding bipartite graphs with unique perfect matching.
: On the number of C5's in a triangle-free graph.
: A cycle-space invariant of the <2-distance-graph in the plane.
: Matroids algebraic over F(t) are algebraic over F.
: An extremal problem for Graham-Rotschild parameter words.
, Peter W. Shor
: Tight bounds for minimax grid matching wit applications to the average case analysis of algorithms.
, Tamás Terlaky
: Some generalizations of the criss-cross method for the linear complementarity problem of oriented matroids.
: Factoring polynomials modulo special primes.
A. F. Sidorenko
: Asymptotic solution for a new class of forbidden r-graphs.
: A hypergraph-free construction of highly chromatic graph without short cycles.
: A note on monotone paths in labeled graphs.
A. V. Ivanov
: Non rank 3 strongly regular graphs with the 5-vertex condition.
: Query complexity, or why is it difficult to seperate NP A cap co NPA from PA by random oracles A?.