| |
| 1999 | ||
|---|---|---|
| 7 | EE | Béla Bollobás, Graham Brightwell, Alexander Sidorenko: Geometrical Techniques for Estimating Numbers of Linear Extensions. Eur. J. Comb. 20(5): 329-335 (1999) |
| 6 | EE | David S. Gunderson, Vojtech Rödl, Alexander Sidorenko: Extremal Problems for Sets Forming Boolean Algebras and Complete Partite Hypergraphs. J. Comb. Theory, Ser. A 88(2): 342-367 (1999) |
| 1997 | ||
| 5 | EE | Alexander Sidorenko: Upper Bounds for Turán Numbers. J. Comb. Theory, Ser. A 77(1): 134-147 (1997) |
| 1996 | ||
| 4 | Alexander Sidorenko: Randomness friendly graphs. Random Struct. Algorithms 8(3): 229-241 (1996) | |
| 1995 | ||
| 3 | Vojtech Rödl, Alexander Sidorenko: On the Jumping Constant Conjecture for Multigraphs. J. Comb. Theory, Ser. A 69(2): 347-357 (1995) | |
| 1994 | ||
| 2 | EE | Alexander Sidorenko: A partially ordered set of functionals corresponding to graphs. Discrete Mathematics 131(1-3): 263-277 (1994) |
| 1993 | ||
| 1 | Alexander Sidorenko: Boundedness of optimal matrices in extremal multigraph and digraph problems. Combinatorica 13(1): 109-120 (1993) | |
| 1 | Béla Bollobás | [7] |
| 2 | Graham Brightwell | [7] |
| 3 | David S. Gunderson | [6] |
| 4 | Vojtech Rödl | [3] [6] |