Rados Radoicic

24 papers A 1Journal 17Unranked 6
YearRankTypeTitle / Venue / Authors
2018 J jnl
A sharp Pólya-based approximation to the normal cumulative distribution function.
Appl. Math. Comput.
Ivan Matic, Rados Radoicic, Dan Stefanica
2015 J jnl
Saturated simple and k-simple topological graphs.
Comput. Geom.
Jan Kyncl, János Pach, Rados Radoicic, Géza Tóth
2015 A conf
Vertical Visibility Among Parallel Polygons in Three Dimensions.
GD
Radoslav Fulek, Rados Radoicic
2014 J jnl
A Note on Coloring Line Arrangements.
Electron. J. Comb.
Eyal Ackerman, János Pach, Rom Pinchasi, Rados Radoicic, Géza Tóth
2011 — conf
Tangled Thrackles.
EGC
János Pach, Rados Radoicic, Géza Tóth
2009 J jnl
Hamiltonian paths in Cayley graphs.
Discret. Math.
Igor Pak, Rados Radoicic
2008 J jnl
Rainbow solutions to the Sidon equation.
Discret. Math.
Jacob Fox, Mohammad Mahdian, Rados Radoicic
2007 J jnl
On the Existence of Rainbow 4-Term Arithmetic Progressions.
Graphs Comb.
David Conlon, Veselin Jungic, Rados Radoicic
2007 J jnl
Sub-Ramsey Numbers for Arithmetic Progressions and Schur Triples.
Electron. Notes Discret. Math.
Jacob Fox, Veselin Jungic, Rados Radoicic
2006 J jnl
A Ramsey-type result for the hypercube.
J. Graph Theory
Noga Alon, Rados Radoicic, Benny Sudakov, Jan Vondrák
2006 J jnl
Improving the Crossing Lemma by Finding More Crossings in Sparse Graphs.
Discret. Comput. Geom.
János Pach, Rados Radoicic, Gábor Tardos, Géza Tóth
2006 J jnl
Nearly equal distances and Szemerédi's regularity lemma.
Comput. Geom.
János Pach, Rados Radoicic, Jan Vondrák
2006 J jnl
On empty convex polygons in a planar point set.
J. Comb. Theory A
Rom Pinchasi, Rados Radoicic, Micha Sharir
2006 J jnl
On the diameter of separated point sets with many nearly equal distances.
Eur. J. Comb.
János Pach, Rados Radoicic, Jan Vondrák
2005 J jnl
Crossing patterns of semi-algebraic sets.
J. Comb. Theory A
Noga Alon, János Pach, Rom Pinchasi, Rados Radoicic, Micha Sharir
2004 J jnl
A dense planar point set from iterated line intersections.
Comput. Geom.
Dan Ismailescu, Rados Radoicic
2004 — conf
Improving the crossing lemma by finding more crossings in sparse graphs: [extended abstract].
SCG
János Pach, Rados Radoicic, Gábor Tardos, Géza Tóth
2004 — conf
On empty convex polygons in a planar point set.
SCG
Rom Pinchasi, Rados Radoicic, Micha Sharir
2003 J jnl
Monotone paths in line arrangements.
Comput. Geom.
Rados Radoicic, Géza Tóth
2003 J jnl
Rainbow Arithmetic Progressions and Anti-Ramsey Results.
Comb. Probab. Comput.
Veselin Jungic, Jacob Licht, Mohammad Mahdian, Jaroslav Nesetril, Rados Radoicic
2003 — conf
Topological graphs with no self-intersecting cycle of lenth 4.
SCG
Rom Pinchasi, Rados Radoicic
2002 J jnl
Counting 1324-Avoiding Permutations.
Electron. J. Comb.
Darko Marinov, Rados Radoicic
2002 — conf
Relaxing Planarity for Topological Graphs.
JCDCG
János Pach, Rados Radoicic, Géza Tóth
2001 — conf
Monotone paths in line arrangement.
SCG
Rados Radoicic, Géza Tóth