The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Rados Radoicic: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. János Pach, Rados Radoicic, Gábor Tardos, Géza Tóth
    Improving the crossing lemma by finding more crossings in sparse graphs: [extended abstract]. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2004, pp:68-75 [Conf]
  2. Rom Pinchasi, Rados Radoicic
    Topological graphs with no self-intersecting cycle of lenth 4. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2003, pp:98-103 [Conf]
  3. Rom Pinchasi, Rados Radoicic, Micha Sharir
    On empty convex polygons in a planar point set. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2004, pp:391-400 [Conf]
  4. Rados Radoicic, Géza Tóth
    Monotone paths in line arrangement. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2001, pp:312-314 [Conf]
  5. János Pach, Rados Radoicic, Géza Tóth
    Relaxing Planarity for Topological Graphs. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2002, pp:221-232 [Conf]
  6. Darko Marinov, Rados Radoicic
    Counting 1324-Avoiding Permutations. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2002, v:0, n:2, pp:- [Journal]
  7. Dan Ismailescu, Rados Radoicic
    A dense planar point set from iterated line intersections. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2004, v:27, n:3, pp:257-267 [Journal]
  8. János Pach, Rados Radoicic, Jan Vondrák
    Nearly equal distances and Szemerédi's regularity lemma. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2006, v:34, n:1, pp:11-19 [Journal]
  9. Rados Radoicic, Géza Tóth
    Monotone paths in line arrangements. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2003, v:24, n:3, pp:129-134 [Journal]
  10. Veselin Jungic, Jacob Licht, Mohammad Mahdian, Jaroslav Nesetril, Rados Radoicic
    Rainbow Arithmetic Progressions and Anti-Ramsey Results. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2003, v:12, n:5-6, pp:599-620 [Journal]
  11. János Pach, Rados Radoicic, Gábor Tardos, Géza Tóth
    Improving the Crossing Lemma by Finding More Crossings in Sparse Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2006, v:36, n:4, pp:527-552 [Journal]
  12. János Pach, Rados Radoicic, Jan Vondrák
    On the diameter of separated point sets with many nearly equal distances. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2006, v:27, n:8, pp:1321-1332 [Journal]
  13. Noga Alon, János Pach, Rom Pinchasi, Rados Radoicic, Micha Sharir
    Crossing patterns of semi-algebraic sets. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2005, v:111, n:2, pp:310-326 [Journal]
  14. Rom Pinchasi, Rados Radoicic, Micha Sharir
    On empty convex polygons in a planar point set. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2006, v:113, n:3, pp:385-419 [Journal]
  15. Noga Alon, Rados Radoicic, Benny Sudakov, Jan Vondrák
    A Ramsey-type result for the hypercube. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2006, v:53, n:3, pp:196-208 [Journal]

  16. Rainbow solutions to the Sidon equation. [Citation Graph (, )][DBLP]


  17. Hamiltonian paths in Cayley graphs. [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.006secs
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