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