Rados Radoicic

According to our database, Rados Radoicic authored at least 23 papers between 2001 and 2018.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2018

A sharp Pólya-based approximation to the normal cumulative distribution function.

Ivan Matic, Rados Radoicic, Dan Stefanica

Appl. Math. Comput., 2018

2015

Saturated simple and k-simple topological graphs.

Jan Kyncl, János Pach, Rados Radoicic, Géza Tóth

Comput. Geom., 2015

Vertical Visibility Among Parallel Polygons in Three Dimensions.

Radoslav Fulek, Rados Radoicic

Proceedings of the Graph Drawing and Network Visualization - 23rd International Symposium, 2015

2014

A Note on Coloring Line Arrangements.

Eyal Ackerman, János Pach, Rom Pinchasi, Rados Radoicic, Géza Tóth

Electron. J. Comb., 2014

2011

Tangled Thrackles.

János Pach, Rados Radoicic, Géza Tóth

Proceedings of the Computational Geometry - XIV Spanish Meeting on Computational Geometry, 2011

2009

Hamiltonian paths in Cayley graphs.

Igor Pak, Rados Radoicic

Discret. Math., 2009

2008

Rainbow solutions to the Sidon equation.

Jacob Fox, Mohammad Mahdian, Rados Radoicic

Discret. Math., 2008

2007

On the Existence of Rainbow 4-Term Arithmetic Progressions.

David Conlon, Veselin Jungic, Rados Radoicic

Graphs Comb., 2007

Sub-Ramsey Numbers for Arithmetic Progressions and Schur Triples.

Jacob Fox, Veselin Jungic, Rados Radoicic

Electron. Notes Discret. Math., 2007

2006

A Ramsey-type result for the hypercube.

Noga Alon, Rados Radoicic, Benny Sudakov, Jan Vondrák

J. Graph Theory, 2006

On empty convex polygons in a planar point set.

Rom Pinchasi, Rados Radoicic, Micha Sharir

J. Comb. Theory, Ser. A, 2006

On the diameter of separated point sets with many nearly equal distances.

János Pach, Rados Radoicic, Jan Vondrák

Eur. J. Comb., 2006

Improving the Crossing Lemma by Finding More Crossings in Sparse Graphs.

János Pach, Rados Radoicic, Gábor Tardos, Géza Tóth

Discret. Comput. Geom., 2006

Nearly equal distances and Szemerédi's regularity lemma.

János Pach, Rados Radoicic, Jan Vondrák

Comput. Geom., 2006

2005

Crossing patterns of semi-algebraic sets.

Noga Alon, János Pach, Rom Pinchasi, Rados Radoicic, Micha Sharir

J. Comb. Theory, Ser. A, 2005

2004

A dense planar point set from iterated line intersections.

Dan Ismailescu, Rados Radoicic

Comput. Geom., 2004

Improving the crossing lemma by finding more crossings in sparse graphs: [extended abstract].

János Pach, Rados Radoicic, Gábor Tardos, Géza Tóth

Proceedings of the 20th ACM Symposium on Computational Geometry, 2004

2003

Rainbow Arithmetic Progressions and Anti-Ramsey Results.

Veselin Jungic, Jacob Licht, Mohammad Mahdian, Jaroslav Nesetril, Rados Radoicic

Comb. Probab. Comput., 2003

Monotone paths in line arrangements.

Rados Radoicic, Géza Tóth

Comput. Geom., 2003

Topological graphs with no self-intersecting cycle of lenth 4.

Rom Pinchasi, Rados Radoicic

Proceedings of the 19th ACM Symposium on Computational Geometry, 2003

2002

Counting 1324-Avoiding Permutations.

Darko Marinov, Rados Radoicic

Electron. J. Comb., 2002

Relaxing Planarity for Topological Graphs.

János Pach, Rados Radoicic, Géza Tóth

Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2002

2001

Monotone paths in line arrangement.

Rados Radoicic, Géza Tóth

Proceedings of the Seventeenth Annual Symposium on Computational Geometry, 2001