 | 2008 |
| 24 |  | József Solymosi,
Van H. Vu:
Near optimal bounds for the Erdös distinct distances problem in high dimensions.
Combinatorica 28(1): 113-125 (2008) |
| 23 |  | József Solymosi,
Csaba D. Tóth:
On a Question of Bourgain about Geometric Incidences.
Combinatorics, Probability & Computing 17(4): 619-625 (2008) |
| 2007 |
| 22 |  | József Solymosi,
Gábor Tardos:
On the number of k-rich transformations.
Symposium on Computational Geometry 2007: 227-231 |
| 21 |  | Izabella Laba,
József Solymosi:
Incidence Theorems for Pseudoflats.
Discrete & Computational Geometry 37(2): 163-174 (2007) |
| 2006 |
| 20 |  | József Solymosi:
Arithmetic Progressions in Sets with Small Sumsets.
Combinatorics, Probability & Computing 15(4): 597-603 (2006) |
| 19 |  | József Solymosi,
Csaba D. Tóth:
Distinct Distances in Homogeneous Sets in Euclidean Space.
Discrete & Computational Geometry 35(4): 537-549 (2006) |
| 18 |  | Gyula Károlyi,
József Solymosi:
Erdos-Szekeres theorem with forbidden order types.
J. Comb. Theory, Ser. A 113(3): 455-465 (2006) |
| 17 |  | József Solymosi:
Dense Arrangements are Locally Very Dense. I.
SIAM J. Discrete Math. 20(3): 623-627 (2006) |
| 16 |  | Udo Adamy,
Michael Hoffmann,
József Solymosi,
Milos Stojakovic:
Coloring octrees.
Theor. Comput. Sci. 363(1): 11-17 (2006) |
| 2004 |
| 15 |  | Udo Adamy,
Michael Hoffmann,
József Solymosi,
Milos Stojakovic:
Coloring Octrees.
COCOON 2004: 62-71 |
| 14 |  | József Solymosi:
A Note on a Question of Erdos and Graham.
Combinatorics, Probability & Computing 13(2): 263-267 (2004) |
| 2003 |
| 13 |  | József Solymosi,
Van H. Vu:
Distinct distances in homogeneous sets.
Symposium on Computational Geometry 2003: 104-105 |
| 12 |  | János Pach,
József Solymosi,
Géza Tóth:
Unavoidable Configurations in Complete Topological Graphs.
Discrete & Computational Geometry 30(2): 311-320 (2003) |
| 11 |  | József Solymosi:
Note on Integral Distances.
Discrete & Computational Geometry 30(2): 337-342 (2003) |
| 2002 |
| 10 |  | András Gyárfás,
Alice Hubenko,
József Solymosi:
Large Cliques in C4-Free Graphs.
Combinatorica 22(2): 269-274 (2002) |
| 9 |  | Gyula Károlyi,
József Solymosi:
Almost Disjoint Triangles in 3-Space.
Discrete & Computational Geometry 28(4): 577-583 (2002) |
| 8 |  | József Solymosi,
Gábor Tardos,
Csaba D. Tóth:
The k Most Frequent Distances in the Plane.
Discrete & Computational Geometry 28(4): 639-648 (2002) |
| 2001 |
| 7 |  | Bernd Gärtner,
József Solymosi,
Falk Tschirschnitz,
Emo Welzl,
Pavel Valtr:
One line and n points.
STOC 2001: 306-315 |
| 6 |  | József Solymosi,
Csaba D. Tóth:
On the distinct distances determined by a planar point set.
Symposium on Computational Geometry 2001: 29-32 |
| 5 |  | Noga Alon,
János Pach,
József Solymosi:
Ramsey-type Theorems with Forbidden Subgraphs.
Combinatorica 21(2): 155-170 (2001) |
| 4 |  | József Solymosi,
Csaba D. Tóth:
Distinct Distances in the Plane.
Discrete & Computational Geometry 25(4): 629-634 (2001) |
| 3 |  | János Pach,
József Solymosi:
Crossing Patterns of Segments.
J. Comb. Theory, Ser. A 96(2): 316-325 (2001) |
| 2000 |
| 2 |  | János Pach,
József Solymosi:
Structure Theorems for Systems of Segments.
JCDCG 2000: 308-317 |
| 1998 |
| 1 |  | János Pach,
József Solymosi:
Canonical Theorems for Convex Sets.
Discrete & Computational Geometry 19(3): 427-435 (1998) |