Rados Radoicic

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

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2018
A sharp Pólya-based approximation to the normal cumulative distribution function.
Appl. Math. Comput., 2018

2015
Saturated simple and k-simple topological graphs.
Comput. Geom., 2015

Vertical Visibility Among Parallel Polygons in Three Dimensions.
Proceedings of the Graph Drawing and Network Visualization - 23rd International Symposium, 2015

2014
A Note on Coloring Line Arrangements.
Electron. J. Comb., 2014

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

2009
Hamiltonian paths in Cayley graphs.
Discret. Math., 2009

2008
Rainbow solutions to the Sidon equation.
Discret. Math., 2008

2007
On the Existence of Rainbow 4-Term Arithmetic Progressions.
Graphs Comb., 2007

Sub-Ramsey Numbers for Arithmetic Progressions and Schur Triples.
Electron. Notes Discret. Math., 2007

2006
A Ramsey-type result for the hypercube.
J. Graph Theory, 2006

On empty convex polygons in a planar point set.
J. Comb. Theory A, 2006

On the diameter of separated point sets with many nearly equal distances.
Eur. J. Comb., 2006

Improving the Crossing Lemma by Finding More Crossings in Sparse Graphs.
Discret. Comput. Geom., 2006

Nearly equal distances and Szemerédi's regularity lemma.
Comput. Geom., 2006

2005
Crossing patterns of semi-algebraic sets.
J. Comb. Theory A, 2005

2004
A dense planar point set from iterated line intersections.
Comput. Geom., 2004

Improving the crossing lemma by finding more crossings in sparse graphs: [extended abstract].
Proceedings of the 20th ACM Symposium on Computational Geometry, 2004

2003
Rainbow Arithmetic Progressions and Anti-Ramsey Results.
Comb. Probab. Comput., 2003

Monotone paths in line arrangements.
Comput. Geom., 2003

Topological graphs with no self-intersecting cycle of lenth 4.
Proceedings of the 19th ACM Symposium on Computational Geometry, 2003

2002
Counting 1324-Avoiding Permutations.
Electron. J. Comb., 2002

Relaxing Planarity for Topological Graphs.
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2002

2001
Monotone paths in line arrangement.
Proceedings of the Seventeenth Annual Symposium on Computational Geometry, 2001


  Loading...