The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

József Solymosi: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  21. Near optimal bounds for the Erdös distinct distances problem in high dimensions. [Citation Graph (, )][DBLP]


  22. Arithmetic Progressions in Sets with Small Sumsets. [Citation Graph (, )][DBLP]


  23. On a Question of Bourgain about Geometric Incidences. [Citation Graph (, )][DBLP]


  24. On a Question of Erdos and Ulam. [Citation Graph (, )][DBLP]


Search in 0.041secs, Finished in 0.043secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002