2006 | ||
---|---|---|
12 | EE | György Elekes, Imre Z. Ruzsa: The structure of sets with few sums along a graph. J. Comb. Theory, Ser. A 113(7): 1476-1500 (2006) |
2005 | ||
11 | EE | György Elekes, Csaba D. Tóth: Incidences of not-too-degenerate hyperplanes. Symposium on Computational Geometry 2005: 16-21 |
2004 | ||
10 | EE | Bernardo M. Ábrego, György Elekes, Silvia Fernández-Merchant: Structural Results For Planar Sets With Many Similar Subsets. Combinatorica 24(4): 541-554 (2004) |
2000 | ||
9 | EE | György Elekes, Lajos Rónyai: A Combinatorial Problem on Polynomials and Rational Functions. J. Comb. Theory, Ser. A 89(1): 1-20 (2000) |
1999 | ||
8 | EE | György Elekes: On Linear Combinatorics III. Few Directions and Distorted Lattices. Combinatorica 19(1): 43-53 (1999) |
1998 | ||
7 | EE | György Elekes: On Linear Combinatorics II. Structure Theorems via Additive Number Theory. Combinatorica 18(1): 13-25 (1998) |
6 | EE | György Elekes: A Combinatorial Problem on Polynomials. Discrete & Computational Geometry 19(3): 383-389 (1998) |
1997 | ||
5 | György Elekes: On Linear Combinatorics I. Concurrency - An Algebraic Approach. Combinatorica 17(4): 447-458 (1997) | |
1995 | ||
4 | György Elekes: Circle Grids and Bipartite Graphs of Distances. Combinatorica 15(2): 167-174 (1995) | |
1994 | ||
3 | György Elekes: Generalized Breadths, Circular Cantor Sets, and the Least Area UCC. Discrete & Computational Geometry 12: 439-449 (1994) | |
1986 | ||
2 | György Elekes: A Geometric Inequality and the Complexity of Computing Volume. Discrete & Computational Geometry 1: 289-292 (1986) | |
1984 | ||
1 | György Elekes: n points in the plane can determine n 3/2 unit circles. Combinatorica 4(2): 131-131 (1984) |
1 | Bernardo M. Ábrego | [10] |
2 | Silvia Fernández-Merchant | [10] |
3 | Lajos Rónyai | [9] |
4 | Imre Z. Ruzsa | [12] |
5 | Csaba D. Tóth | [11] |