default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRados Radoicic
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2018
[j17]Ivan Matic, Rados Radoicic, Dan Stefanica:
A sharp Pólya-based approximation to the normal cumulative distribution function. Appl. Math. Comput. 322: 111-122 (2018)- 2015
- [j16]Jan Kyncl
, János Pach, Rados Radoicic, Géza Tóth:
Saturated simple and k-simple topological graphs. Comput. Geom. 48(4): 295-310 (2015) - 2014
- [j15]Eyal Ackerman, János Pach, Rom Pinchasi, Rados Radoicic, Géza Tóth:
A Note on Coloring Line Arrangements. Electron. J. Comb. 21(2): 2 (2014) - 2009
- [j14]Igor Pak, Rados Radoicic:
Hamiltonian paths in Cayley graphs. Discret. Math. 309(17): 5501-5508 (2009) - 2008
- [j13]Jacob Fox, Mohammad Mahdian, Rados Radoicic:
Rainbow solutions to the Sidon equation. Discret. Math. 308(20): 4773-4778 (2008) - 2007
- [j12]Jacob Fox, Veselin Jungic, Rados Radoicic:
Sub-Ramsey Numbers for Arithmetic Progressions and Schur Triples. Electron. Notes Discret. Math. 28: 191-198 (2007) - [j11]David Conlon, Veselin Jungic, Rados Radoicic:
On the Existence of Rainbow 4-Term Arithmetic Progressions. Graphs Comb. 23(3): 249-254 (2007) - 2006
- [j10]János Pach, Rados Radoicic, Jan Vondrák:
Nearly equal distances and Szemerédi's regularity lemma. Comput. Geom. 34(1): 11-19 (2006) - [j9]János Pach, Rados Radoicic, Gábor Tardos, Géza Tóth:
Improving the Crossing Lemma by Finding More Crossings in Sparse Graphs. Discret. Comput. Geom. 36(4): 527-552 (2006) - [j8]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) - [j7]Rom Pinchasi, Rados Radoicic, Micha Sharir:
On empty convex polygons in a planar point set. J. Comb. Theory A 113(3): 385-419 (2006) - [j6]Noga Alon, Rados Radoicic, Benny Sudakov, Jan Vondrák:
A Ramsey-type result for the hypercube. J. Graph Theory 53(3): 196-208 (2006) - 2005
- [j5]Noga Alon, János Pach, Rom Pinchasi, Rados Radoicic, Micha Sharir:
Crossing patterns of semi-algebraic sets. J. Comb. Theory A 111(2): 310-326 (2005) - 2004
- [j4]Dan Ismailescu, Rados Radoicic:
A dense planar point set from iterated line intersections. Comput. Geom. 27(3): 257-267 (2004) - 2003
- [j3]Rados Radoicic, Géza Tóth:
Monotone paths in line arrangements. Comput. Geom. 24(3): 129-134 (2003) - [j2]Veselin Jungic, Jacob Licht, Mohammad Mahdian, Jaroslav Nesetril, Rados Radoicic:
Rainbow Arithmetic Progressions and Anti-Ramsey Results. Comb. Probab. Comput. 12(5-6): 599-620 (2003) - 2002
- [j1]Darko Marinov, Rados Radoicic:
Counting 1324-Avoiding Permutations. Electron. J. Comb. 9(2) (2002)
Conference and Workshop Papers
- 2015
- [c7]Radoslav Fulek, Rados Radoicic:
Vertical Visibility Among Parallel Polygons in Three Dimensions. GD 2015: 373-379 - 2011
- [c6]János Pach, Rados Radoicic, Géza Tóth:
Tangled Thrackles. EGC 2011: 45-53 - 2004
- [c5]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]. SCG 2004: 68-75 - [c4]Rom Pinchasi, Rados Radoicic, Micha Sharir:
On empty convex polygons in a planar point set. SCG 2004: 391-400 - 2003
- [c3]Rom Pinchasi, Rados Radoicic:
Topological graphs with no self-intersecting cycle of lenth 4. SCG 2003: 98-103 - 2002
- [c2]János Pach, Rados Radoicic, Géza Tóth:
Relaxing Planarity for Topological Graphs. JCDCG 2002: 221-232 - 2001
- [c1]Rados Radoicic, Géza Tóth:
Monotone paths in line arrangement. SCG 2001: 312-314
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 12:53 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
