PUBLIKÁCIÓK:
1. Solymosi, József and Frank De Zeeuw. 'On a question of Erdős and
Ulam'. Discrete & Computational Geometry, Volume 43, Issue 2
(2010), Page 393-401.
2. Solymosi, József. 'Spectral bounds on incidences'. Additive
Combinatorics. Ed. Javier Cilleruelo, Marc Noy and Oriol Serra.
Advanced Courses in Mathematics CRM Barcelona. Basel:
Birkhäuser 2009. 299-313.
3. Pach, János, József Solymosi and Gábor Tardos. 'Crossing numbers
of imbalanced graphs'. JOURNAL OF GRAPH THEORY. Published
Online: 11 Aug 2009 6 pages. DOI: 10.1002/jgt.20435
4. Solymosi, József and Van Vu. 'Sum-product estimates for wellconditioned matrices'. Bulletin of the London Mathematical Society
2009 41(5):817-822.
5. Solymosi, József. 'Bounding multiplicative energy by the sumset'.
Advances in Mathematics, Volume 222, Issue 2, 2009, 402-408
6. Graham, Ron and József Solymosi. 'Some Ramsey results for the ncube', Journal of Combinatorial Theory, Series A, Volume 117, Issue
2, 2010, 189-195,
7. Solymosi, József and Konrad Swanepoel. 'Elementary incidence
theorems for complex numbers and quaternions'. SIAM JOURNAL
ON DISCRETE MATHEMATICS. 22.3 (2008): 1145 – 1148.
8. Solymosi, József. 'Incidences and the Spectra of Graphs'. Building
Bridges between Mathematics and Computer Science. Vol. 19. Ed.
Martin Groetschel and Gyula Katona. Series: Bolyai Society
Mathematical Studies. Springer, 2008. 499 - 513.
9. Solymosi, József and Van Vu. 'Near optimal bound for the distinct
distances problem in high dimensions'. COMBINATORICA. 28.1
(2008): 113 - 125.
10. Solymosi, József and Csaba D. Tóth. 'On a question of Bourgain
about geometric incidences' Combinatorics, Probability and
Computing. 17.4 (2008): 619 - 625.
11. Solymosi, József and Gábor Tardos. 'On the Number of k-rich
Transformations '. 23rd Annual ACM Symposium on Computational
Geometry. Gyeongju, Korea, Republic of. Jun, 2007. 227 - 231. ACM
Press New York, NY, USA.
12. Solymosi, József. 'Elementary additive combinatorics'. Additive
Combinatorics. Lectures from the CRM-Clay School on Additive
Combinatorics was held at the Universite de Montreal from March
30th to April 5th, 2006.. Ed. Andrew Granville, Melvin Nathanson and
József Solymosi. AMS, 2007. 29 - 38.
13. Laba, Izabella and József Solymosi. 'Incidence theorems for
pseudoflats'. Discrete & Computational Geometry. 37.2 (2007): 163 174.
14. Haart, Derrick, Alex Iosevich and József Solymosi. 'Sum-product
estimates in finite fields via Kloosterman sums'. INTERNATIONAL
MATHEMATICS RESEARCH NOTICES. 2007 (2007): 1 - 14.
15. Chang, Mei-Chu and József Solymosi. 'Sum-product theorems and
incidence geometry'. JOURNAL OF THE EUROPEAN
MATHEMATICAL SOCIETY. 9.3 (2007): 545 - 560.
16. Graham, Ron and József Solymosi. 'Monochromatic equilateral right
triangles on the integer grid'. Topics in Discrete Mathematics.
(Dedicated to Jarik Nešetril on the occasion of his 60th
birthday)Series: Algorithms and Combinatorics. Vol. 26. Ed. Martin
Klazar, Jan Kratochvil, Martin Loebl, Jirka Matousek, Robin Thomas
and Pavel Valtr. Springer, 2006. 61 - 68.
17. Solymosi, József. 'Dense arrangements are locally very dense I'.
SIAM JOURNAL ON DISCRETE MATHEMATICS. 20.3 (2006): 623 627.
18. Solymosi, József and Csaba D. Tóth. 'On distinct distances in
homogeneous sets in the Euclidean space'. Discrete &
Computational Geometry. 35.4 (2006): 629 - 634.
19. Solymosi, József. 'Arithmetic Progressions in Sets with Small
Sumsets'. Combinatorics, Probability and Computing. 15 (2006): 597
- 603.
20. Károlyi, Gyula and József Solymosi. 'Erdős-Szekeres theorem with
forbidden order types'. Journal of Combinatorial Theory, Series A.
113.3 (2006): 455 - 465.
21. Adamy, Udo, Michael Hoffmann, József Solymosi and Milos
Stojakovic. 'Coloring octrees'. THEORETICAL COMPUTER SCIENCE.
363.1 (2006): 11 - 17.
22. Solymosi, József. 'On the number of sums and products'. The
Bulletin of the London Mathematical Society. 37.4 (2005): 491 - 494.
23. Solymosi, József. 'Regularity, uniformity, and quasirandomness'.
Proceedings of the National Academy of Sciences of the United
States of America. 102.23 (2005): 8075 - 8076.
24. Cooper, Joshua N. and József Solymosi. 'Collinear points in
permutations'. Annals of Combinatorics. 9.2 (2005): 169 - 175.
25. Solymosi, József. 'On sum-sets and product-sets of complex
numbers'. Journal de Theorie des Nombres de Bordaux. 17.3 (2005):
921 - 924.
26. Nesetril, Jaroslav, József Solymosi and Pavel Valtr. 'A Ramsey
property of planar graphs'. Towards a theory of geometric graphs;
Contemp. Math.. Vol. 342. Ed. Amer. Math. Soc, 2004. 169 - 176.
27. Solymosi, József and Van Vu. 'Distinct distances in high dimensional
homogeneous sets'. Towards a theory of geometric graphs;
Contemp. Math.. Vol. 342. Ed. Amer. Math. Soc, 2004. 259 - 268.
28. Solymosi, József. 'A note on a question of Erdős and Graham'.
Combinatorics, Probability and Computing. 13.2 (2004): 263 - 267.
29. Adamy, Udo, Michael Hoffmann, József Solymosi and Milos
Stojakovic. 'Coloring octrees'. Computing and combinatorics;
Lecture Notes in Comput. Sci.. Vol. 3106. Ed. Springer, 2004. 62 - 71.
30. Solymosi, József. 'Note on a generalization of Roth's theorem'.
Discrete and computational geometry; Algorithms Combin. Vol. 25.
Ed. János Pach. Springer, 2003. 825 - 827.
31. Solymosi, József. 'Note on integral distances'. Discrete and
Computational Geometry. 30.2 (2003): 337 - 342.
32. Gartner, Bernd, Falk Tschirschnitz, Emo Welzl, József Solymosi and
Pavel Valtr. 'One line and n points'. Random Structures & Algorithms.
23.4 (2003): 453 - 471.
33. Pach, János, József Solymosi and Géza Tóth. 'Unavoidable
configurations in complete topological graphs'. Discrete &
Computational Geometry.. 30.2 (2003): 311 - 320.
34. Solymosi, József and Van Vu. 'Distances in Homogeneous Sets'.
Proceeding of the 19th ACM Symposium on Computational
Geometry. 19th ACM Symposium on Computational Geometry. San
Diego, California, United States. 2003. 104 - 105. ACM Press.
35. Gyárfás, András, Alice Hubenko and József Solymosi. 'Large cliques
in C_4-free graphs'. COMBINATORICA. 22.2 (2002): 269 - 274.
36. Károlyi, Gyula and József Solymosi. 'Almost disjoint triangles in 3space'. Discrete & Computational Geometry. 28.4 (2002): 577 - 583.
37. Solymosi, József, Gábor Tardos and Csaba D. Tóth. 'The k most
frequent distances in the plane'. Discrete & Computational Geometry.
28.4 (2002): 639 - 648.
38. Pach, János and József Solymosi. 'Crossing patterns of segments'.
Journal of Combinatorial Theory.Series A. 96.2 (2001): 316 - 325.
39. Alon, Noga, János Pach and József Solymosi. 'Ramsey-type
theorems with forbidden subgraphs'. COMBINATORICA. 21.2 (2001):
155 - 170.
40. Pach, János and József Solymosi. 'Structure theorems for systems
of segments'. Discrete and computational geometry (Tokyo, 2000);
Lecture Notes in Comput. Sci. Vol. 2098. Ed. Jin Akijama. Springer,
2001. 308 – 317.
41. Solymosi, József and Csaba D. Tóth. 'Different distances in a planar
point set'. Proc. 17th ACM Symp. on Comput. Geom. (Medford, MA,
2001). 17th ACM Symp. on Comput. Geom. Medford, Massachusetts,
United States. 2001. 29 - 31. ACM Press.
42. Nesetril, Jaroslav, József Solymosi and Pavel Valtr. 'Induced
monochromatic subconfigurations'. Contemporary trends in discrete
mathematics Stirin Castle, 1997); DIMACS Ser. Discrete Math.
Theoret. Comput. Sci. Vol. 49. Ed. Amer. Math. Soc, 1999. 219 - 227.
43. Pach, János and József Solymosi. 'Halving lines and perfect crossmatchings'. Advances in discrete and computational geometry
(South Hadley, MA, 1996); Contemp. Math. Vol. 223. Ed. Amer. Math.
Soc, 1999. 245 - 249.
44. Pach, János and József Solymosi. 'Canonical theorems for convex
sets'. Discrete & Computational Geometry. 19.3, Special Issue (1998):
427 – 435.
Könyv:
45. Additive Combinatorics. Lectures from the CRM-Clay School on
Additive Combinatorics, was held at the Universite de Montreal from
March 30th to April 5th, 2006. Ed. Andrew Granville, Melvin
Nathanson and József Solymosi. AMS, 2007. 335 pages, ISBN-13:
978-0821843512
További publikációk:
46. Solymosi, József. 'The sum-product problem'. OBERWOLFACH
REPORTS. 44. (2008): 55 - 56.
47. Károlyi, Gyula, József Solymosi, and Géza Tóth. ‘Forbidden order types’.
OBERWOLFACH REPORTS. 44. (2008):11.
48. Solymosi, József. ‘On Applications of the Hypergraph Removal Lemma'.
OBERWOLFACH REPORTS. 3.1(2006): 18 - 19.
49. Solymosi, József. 'Geometry in Additive Combinatorics'. OBERWOLFACH
REPORTS. 2.2 (2005): 954 - 956.
50. Solymosi, József. 'A simple counting method'. Proceedings Editor: Fiala,
Jiri. Proceedings of Spring School in Combinatorics. Spring School in
Combinatorics. Borova Lada, Czech Republic. Apr, 1997. 29 - 30.
DIMATIA. Prague.
51. Solymosi, József. 'Integral distances in the plane'. Proceedings Editor:
Kratochvil, Jan. Proceedings of Fifth Prague Combinatorial Workshop.
Prague, Czech Republic. Jul, 1997. 31 - 32. DIMATIA. Prague.
Disszertációk:
52. Solymosi, József. ‘Ramsey-type results on planar geometric objects’,
Ph.D. Thesis, Swiss Federal Institute of Technology, ETH Zurich, 2001.
53. Solymosi, József. ‘Combinatorial problems in finite Ramsey theory’,
Master's Thesis, Eötvös Lorand University, Budapest, 1988.